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

Learning without concentration COLT 2014
A second-order bound with excess losses COLT 2014
The Complexity of Learning Halfspaces using Generalized Linear Methods COLT 2014
Optimal learners for multiclass problems COLT 2014
Sample Compression for Multi-label Concept Classes COLT 2014
An Inequality with Applications to Structured Sparsity and Multitask Dictionary Learning COLT 2014
The sample complexity of agnostic learning under deterministic labels COLT 2014
A Convex Formulation for Mixed Regression with Two Components: Minimax Optimal Rates COLT 2014
Localized Complexities for Transductive Learning COLT 2014
On the Consistency of Output Code Based Learning Algorithms for Multiclass Learning Problems COLT 2014
Lower Bounds on the Performance of Polynomial-time Algorithms for Sparse Linear Regression COLT 2014
Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity COLT 2014
Online Learning with Composite Loss Functions COLT 2014
Online Non-Parametric Regression COLT 2014
Deep Fisher Kernels - End to End Learning of the Fisher Kernel GMM Parameters CVPR 2014
A Statistical Convergence Perspective of Algorithms for Rank Aggregation from Pairwise Data ICML 2014
Learning Theory and Algorithms for revenue optimization in second price auctions with reserve ICML 2014
Generalized Exponential Concentration Inequality for Renyi Divergence Estimation ICML 2014
Condensed Filter Tree for Cost-Sensitive Multi-Label Classification ICML 2014
Bias in Natural Actor-Critic Algorithms ICML 2014
Dimension-free Concentration Bounds on Hankel Matrices for Spectral Learning ICML 2014
Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint ICML 2014
Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms ICML 2014
Provable Bounds for Learning Some Deep Representations ICML 2014