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
Multi-view Regression Via Canonical Correlation Analysis2007
Nonlinear Estimators and Tail Bounds for Dimension Reduction in l 1 Using Cauchy Random Projections2007
Observational Learning in Random Networks2007
Occam's Hammer2007
On-Line Estimation with the Multivariate Gaussian Distribution2007
Online Learning with Prior Knowledge2007
Open Problems in Efficient Semi-supervised PAC Learning2007
Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking2007
Property Testing: A Learning Theory Perspective2007
Q -Learning with Linear Function Approximation2007
Rademacher Margin Complexity2007
Regret to the Best vs. Regret to the Average2007
Resampling-Based Confidence Regions and Multiple Tests for a Correlated Random Vector2007
Resource-Bounded Information Gathering for Correlation Clustering2007
Robust Reductions from Ranking to Classification2007
Sketching Information Divergences2007
Sparse Density Estimation with l1 Penalties2007
Spectral Algorithms for Learning and Clustering2007
Stability of k -Means Clustering2007
Stability of-Means Clustering2007
Strategies for Prediction Under Imperfect Monitoring2007
Suboptimality of Penalized Empirical Risk Minimization in Classification2007
Teaching Dimension and the Complexity of Active Learning2007
The Loss Rank Principle for Model Selection2007
Transductive Rademacher Complexity and Its Applications2007
U-Shaped, Iterative, and Iterative-with-Counter Learning2007
When Is There a Free Matrix Lunch?2007
Active Sampling for Multiple Output Identification2006
Aggregation and Sparsity Via l1 Penalized Least Squares2006
A Randomized Online Learning Algorithm for Better Variance Control2006
A Sober Look at Clustering Stability2006
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints2006
Competing with Wild Prediction Rules2006
Continuous Experts and the Binning Algorithm2006
Discriminative Learning Can Succeed Where Generative Learning Fails2006
DNF Are Teachable in the Average Case2006
Efficient Algorithms for General Active Learning2006
Efficient Learning Algorithms Yield Circuit Lower Bounds2006
Exact Learning Composed Classes with a Small Number of Mistakes2006
Functional Classification with Margin Conditions2006
Function Classes That Approximate the Bayes Risk2006
Improved Lower Bounds for Learning Intersections of Halfspaces2006
Improving Random Projections Using Marginal Information2006
Learning Bounds for Support Vector Machines with Learned Kernels2006
Learning Near-Optimal Policies with Bellman-Residual Minimization Based Fitted Policy Iteration and a Single Sample Path2006
Learning Rational Stochastic Languages2006
Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings2006
Logarithmic Regret Algorithms for Online Convex Optimization2006
Maximum Entropy Distribution Estimation with Generalized Regularization2006
Memory-Limited U-Shaped Learning2006

« prev Page 36/51 next »