← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

On Structured Prediction Theory with Calibrated Convex Surrogate Losses NIPS 2017
Query Complexity of Clustering with Side Information NIPS 2017
Higher-Order Total Variation Classes on Grids: Minimax Theory and Trend Filtering Methods NIPS 2017
Multi-Objective Non-parametric Sequential Prediction NIPS 2017
Neural Networks and Rational Functions ICML 2017
Diffusion Approximations for Online Principal Component Estimation and Global Convergence NIPS 2017
Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning NIPS 2017
Variable Importance Using Decision Trees NIPS 2017
An efficient query learning algorithm for zero-suppressed binary decision diagrams ALT 2017
Oracle Complexity of Second-Order Methods for Finite-Sum Problems ICML 2017
A Learning Error Analysis for Structured Prediction with Approximate Inference NIPS 2017
Collaborative Clustering: Sample Complexity and Efficient Algorithms ALT 2017
Reliably Learning the ReLU in Polynomial Time COLT 2017
Effective Semisupervised Learning on Manifolds COLT 2017
High Dimensional Regression with Binary Coefficients. Estimating Squared Error and a Phase Transtition COLT 2017
Preference-based Teaching of Unions of Geometric Objects ALT 2017
Boundary Crossing for General Exponential Families ALT 2017
Discriminative State Space Models NIPS 2017
ZigZag: A New Approach to Adaptive Online Learning COLT 2017
A General Characterization of the Statistical Query Complexity COLT 2017
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning COLT 2017
Sample Efficient Policy Search for Optimal Stopping Domains IJCAI 2017
New bounds on the price of bandit feedback for mistake-bounded online multiclass learning ALT 2017
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms ICML 2017
Risk Bounds for Transferring Representations With and Without Fine-Tuning ICML 2017