← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Open Problem: Meeting Times for Learning Random Automata COLT 2017
A Second-order Look at Stability and Generalization COLT 2017
Nearly-tight VC-dimension bounds for piecewise linear neural networks COLT 2017
Quadratic Upper Bound for Recursive Teaching Dimension of Finite VC Classes COLT 2017
Open Problem: First-Order Regret Bounds for Contextual Bandits COLT 2017
The Sample Complexity of Optimizing a Convex Function COLT 2017
An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits COLT 2017
Mixing Implies Lower Bounds for Space Bounded Learning COLT 2017
Learning Disjunctions of Predicates COLT 2017
Provably Safe Robot Navigation with Obstacle Uncertainty RSS 2017
Discriminative Information Retrieval for Question Answering Sentence Selection EACL 2017
An Information-Theoretic Route from Generalization in Expectation to Generalization in Probability AISTATS 2017
Learning Theory for Conditional Risk Minimization AISTATS 2017
Regret Bounds for Lifelong Learning AISTATS 2017
Regret Bounds for Transfer Learning in Bayesian Optimisation AISTATS 2017
Stochastic Rank-1 Bandits AISTATS 2017
Linear Convergence of Stochastic Frank Wolfe Variants AISTATS 2017
Fast rates with high probability in exp-concave statistical learning AISTATS 2017
Binary and Multi-Bit Coding for Stable Random Projections AISTATS 2017
Improved Dynamic Regret for Non-degenerate Functions NIPS 2017
Minimizing a Submodular Function from Samples NIPS 2017
Asymptotic Analysis of Objectives Based on Fisher Information in Active Learning JMLR 2017
Breaking the Curse of Dimensionality with Convex Neural Networks JMLR 2017
Revenue Optimization with Approximate Bid Predictions NIPS 2017
Diverse Neural Network Learns True Target Functions AISTATS 2017