COLT

2,540 papers1,556 directions

Papers by Year

2026 6
2025 177
2024 176
2023 168
2022 153
2021 141
2020 127
2019 126
2018 95
2017 74
2016 68
2015 79
2014 61
2013 51
2012 52
2011 44
2010 49
2009 44
2008 54
2007 50
2006 49
2005 49
2004 47
2003 61
2002 28
2001 19
2000 35
1999 37
1998 33
1997 36
1996 38
1995 57
1994 40
1993 56
1992 49
1991 36
1990 37
1989 27
1988 29

Top Research Directions

Research directions most represented by papers from this venue.

The Statistical Computational Gap in High Dimensions 107
Multi-Agent Learning Under Bandit Feedback 46
Regret Scaling in High Dimensional Online Learning 36
Adapting to Stochastic and Adversarial Environments 34
Bypassing Learning Constraints by Relaxing the Hypothesis Class 31
The Computational Cost of High Precision 31
The Empirical Validation Gap 28
Dynamic Regret Minimization in Non-Stationary Online Learning 27
The Mechanics of Benign Overfitting in High Dimensions 24
Agnostic Learning with Adversarial Label Noise 23
Scaling Bandit Learning to Large Action Spaces 22
Managing Hidden Constant Overhead in Algorithm Design 22
Generalization Bounds for Unbounded Loss Functions 18
Parameter-Free and Scale-Free Online Learning 18
Computational Lower Bounds via Statistical Queries 17

Top Authors

AuthorPapers
Yishay Mansour42
Ilias Diakonikolas34
Nicolò Cesa-Bianchi34
Peter Bartlett34
Alexander Rakhlin32
Ohad Shamir31
Steve Hanneke31
Daniel Kane29
Nathan Srebro27
Robert E. Schapire27
Shay Moran27
Elad Hazan26
Hans U. Simon25
Vitaly Feldman24
Manfred K Warmuth23
Shie Mannor23
Haipeng Luo22
Karthik Sridharan22
Adam Klivans21
Sebastien Bubeck19

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Margin-Based Ranking Meets Boosting in the Middle2005
Martingale Boosting2005
Mind Change Efficient Learning2005
On a Syntactic Characterization of Classification with a Mind Change Bound2005
On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions2005
On Spectral Learning of Mixtures of Distributions2005
On the Consistency of Multiclass Classification Methods2005
On the Limitations of Embedding Methods2005
Optimum Follow the Leader Algorithm2005
Permutation Tests for Classification2005
Ranking and Scoring Using Empirical Risk Minimization2005
Rank, Trace-Norm and Max-Norm2005
Sensitive Error Correcting Output Codes2005
Separating Models of Learning from Correlated and Uncorrelated Data2005
Stability and Generalization of Bipartite Ranking Algorithms2005
Teaching Classes with High Teaching Dimension Using Few Examples2005
The Cross Validation Problem2005
The Spectral Method for General Mixture Models2005
The Spectral Method for General Mixture Models2005
The Value of Agreement, a New Boosting Algorithm2005
The Weak Aggregating Algorithm and Weak Mixability2005
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods2005
Trading in Markovian Price Models2005
Unlabeled Compression Schemes for Maximum Classes,2005
Variations on U-Shaped Learning2005
A Framework for Statistical Clustering with a Constant Time Approximation Algorithms for K-Median Clustering2004
A Function Representation for Learning in Banach Spaces2004
A General Convergence Theorem for the Decomposition Method2004
A New PAC Bound for Intersection-Closed Concept Classes2004
An Improved VC Dimension Bound for Sparse Polynomials2004
An Inequality for Nearly Log-Concave Distributions with Applications to Learning2004
A Statistical Mechanics Analysis of Gram Matrix Eigenvalue Spectra2004
Bayes and Tukey Meet at the Center Point2004
Bayesian Networks and Inner Product Spaces2004
Boosting Based on a Smooth Margin2004
Concentration Bounds for Unigrams Language Model2004
Consistency in Models for Communication Constrained Distributed Learning2004
Convergence of Discrete MDL for Sequential Prediction2004
Data Dependent Risk Bounds for Hierarchical Mixture of Experts Classifiers2004
Deterministic Calibration and Nash Equilibrium2004
Graphical Economics2004
Inferring Mixtures of Markov Chains2004
Kernelizing Sorting, Permutation, and Alignment for Minimum Volume PCA2004
Learning a Hidden Graph Using O(log n) Queries Per Edge2004
Learning Classes of Probabilistic Automata2004
Learning Intersections of Halfspaces with a Margin2004
Learning Monotonic Linear Functions2004
Learning Over Compact Metric Spaces2004
Learning Theory, 17th Annual Conference on Learning Theory, COLT 2004, Banff, Canada, July 1-4, 2004, Proceedings2004
Local Complexities for Empirical Risk Minimization2004

« prev Page 38/51 next »