conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5,334 papers

Papers per year

17
66
123
466
307
'05
'10
'15
'20
'25

Papers

Competitive Closeness Testing COLT 2011
Sample Complexity Bounds for Differentially Private Learning COLT 2011
Multiclass Learnability and the ERM principle COLT 2011
Distribution-Independent Evolvability of Linear Threshold Functions COLT 2011
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas COLT 2011
Complexity-Based Approach to Calibration with Checking Rules COLT 2011
On the Consistency of Multi-Label Learning COLT 2011
Sparsity Regret Bounds for Individual Sequences in Online Linear Regression COLT 2011
Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 2011
A Close Look to Margin Complexity and Related Parameters COLT 2011
A Finite-Time Analysis of Multi-armed Bandits Problems with Kullback-Leibler Divergences COLT 2011
Online Learning: Beyond Regret COLT 2011
Agnostic KWIK learning and efficient approximate reinforcement learning COLT 2011
The Sample Complexity of Dictionary Learning COLT 2011
Bounds on Individual Risk for Log-loss Predictors COLT 2011
Missing Information Impediments to Learnability COLT 2011
Models of Cooperative Teaching and Learning JMLR 2011
Information, Divergence and Risk for Binary Experiments JMLR 2011
Better Algorithms for Benign Bandits JMLR 2011
A Refined Margin Analysis for Boosting Algorithms via Equilibrium Margin JMLR 2011
Internal Regret with Partial Monitoring: Calibration-Based Optimal Algorithms JMLR 2011
On the Relation between Realizable and Nonrealizable Cases of the Sequence Prediction Problem JMLR 2011
Smoothness, Disagreement Coefficient, and the Label Complexity of Agnostic Active Learning JMLR 2011
Weisfeiler-Lehman Graph Kernels JMLR 2011
The Sample Complexity of Dictionary Learning JMLR 2011