← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

A Primal-Dual Convergence Analysis of Boosting JMLR 2012
No Internal Regret via Neighborhood Watch AISTATS 2012
Information, Divergence and Risk for Binary Experiments JMLR 2011
Regret Bounds for the Adaptive Control of Linear Quadratic Systems COLT 2011
Blackwell Approachability and No-Regret Learning are Equivalent COLT 2011
Competitive Closeness Testing COLT 2011
Sample Complexity Bounds for Differentially Private Learning COLT 2011
Complexity-Based Approach to Calibration with Checking Rules COLT 2011
On the Consistency of Multi-Label Learning COLT 2011
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 2011
Contextual Bandits with Linear Payoff Functions AISTATS 2011
Adaptive Hedge NIPS 2011
The Sample Complexity of Dictionary Learning COLT 2011
Learning to Locate Relative Outliers ACML 2011
On NDCG Consistency of Listwise Ranking Methods AISTATS 2011
Error Analysis of Laplacian Eigenmaps for Semi-supervised Learning AISTATS 2011
A Refined Margin Analysis for Boosting Algorithms via Equilibrium Margin JMLR 2011
The Sample Complexity of Dictionary Learning JMLR 2011
Smoothness, Disagreement Coefficient, and the Label Complexity of Agnostic Active Learning JMLR 2011
Models of Cooperative Teaching and Learning JMLR 2011
Adaptive Bandits: Towards the best history-dependent strategy AISTATS 2011
On the Relation between Realizable and Nonrealizable Cases of the Sequence Prediction Problem JMLR 2011
A More Powerful Two-Sample Test in High Dimensions using Random Projection NIPS 2011
Internal Regret with Partial Monitoring: Calibration-Based Optimal Algorithms JMLR 2011
Better Algorithms for Benign Bandits JMLR 2011