Learning Theory

Multi-class SVMs: From Tighter Data-Dependent Generalization Bounds to Novel Algorithms NeurIPS 2015 No-Regret Learning in Bayesian Games NeurIPS 2015 Norm-Based Capacity Control in Neural Networks COLT 2015 On Elicitation Complexity NeurIPS 2015 Online Density Estimation of Bradley-Terry Models COLT 2015 Online Gradient Boosting NeurIPS 2015 Online Learning for Adversaries with Memory: Price of Past Mistakes NeurIPS 2015 Online Learning via Sequential Complexities JMLR 2015 Online Learning with Adversarial Delays NeurIPS 2015 Online Optimization : Competing with Dynamic Comparators AISTATS 2015 Online Ranking with Top-1 Feedback AISTATS 2015 On TD(0) with function approximation: Concentration bounds and a centered variant with exponential convergence ICML 2015 On the Accuracy of Self-Normalized Log-Linear Models NeurIPS 2015 On the Complexity of Learning with Kernels COLT 2015 On the consistency theory of high dimensional variable screening NeurIPS 2015 On the High Dimensional Power of a Linear-Time Two Sample Test under Mean-shift Alternatives AISTATS 2015 On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank-One Perturbations of Gaussian Tensors NeurIPS 2015 On the Optimality of Multi-Label Classification under Subset Zero-One Loss for Distributions Satisfying the Composition Property ICML 2015 On the Pseudo-Dimension of Nearly Optimal Auctions NeurIPS 2015 On the Rate of Convergence and Error Bounds for LSTD(λ) ICML 2015 On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs NeurIPS 2015 Open Problem: Learning Quantum Circuits with Queries COLT 2015 Open Problem: Online Sabotaged Shortest Path COLT 2015 Open Problem: Recursive Teaching Dimension Versus VC Dimension COLT 2015 Open Problem: The landscape of the loss surfaces of multilayer networks COLT 2015