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
Minimizing Regret with Label Efficient Prediction2004
Model Selection by Bootstrap Penalization for Classification2004
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary2004
On the Convergence of MDL Density Estimation2004
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case2004
On the Learnability of E-pattern Languages over Small Alphabets2004
Oracle Bounds and Exact Algorithm for Dyadic Classification Trees2004
Perceptron-Like Performance for Intersections of Halfspaces2004
Performance Guarantees for Regularized Maximum Entropy Density Estimation2004
PExact = Exact Learning2004
Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability2004
Regret Bounds for Hierarchical Classification with Linear-Threshold Functions2004
Regularization and Semi-supervised Learning on Large Graphs2004
Reinforcement Learning for Average Reward Zero-Sum Games2004
Replacing Limit Learners with Equally Powerful One-Shot Query Learners2004
Sparseness Versus Estimating Conditional Probabilities: Some Asymptotic Results2004
Statistical Properties of Kernel Principal Component Analysis2004
Suboptimal Behavior of Bayes and MDL in Classification Under Misspecification2004
The Budgeted Multi-armed Bandit Problem2004
The Optimal PAC Algorithm2004
Toward Attribute Efficient Learning of Decision Lists and Parities2004
Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions (Extended Abstract)2004
A General Class of No-Regret Learning Algorithms and Game-Theoretic Equilibria2003
An Information Theoretic Tradeoff between Complexity and Accuracy2003
An Open Problem Regarding the Convergence of Universal A Priori Probability2003
Approximate Equivalence of Markov Decision Processes2003
Bhattacharyya Expected Likelihood Kernels2003
Boosting with Diverse Base Classifiers2003
Comparing Clusterings by the Variation of Information2003
Compressing to VC Dimension Many Points2003
Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA, August 24-27, 2003, Proceedin2003
Data-Dependent Bounds for Multi-category Classification Based on Convex Losses2003
Distance-Based Classification with Lipschitz Functions2003
Efficient Algorithms for Online Decision Problems2003
Entropy Bounds for Restricted Convex Hulls2003
Exploiting Task Relatedness for Mulitple Task Learning2003
Fast Kernels for Inexact String Matching2003
Generality's Price: Inescapable Deficiencies in Machine-Learned Programs2003
Generalization Bounds for Voting Classifiers Based on Sparsity and Clustering2003
How Fast Is k-Means?2003
How Many Strings Are Easy to Predict?2003
Internal Regret in On-Line Portfolio Selection2003
Kernels and Regularization on Graphs2003
Knowledge-Based Nonlinear Kernel Classifiers2003
Learning a Function of r Relevant Variables2003
Learning Algorithm for Enclosing Points in Bregmanian Spheres2003
Learning All Subfunctions of a Function2003
Learning and Parsing Stochastic Unification-Based Grammars2003
Learning Arithmetic Circuits via Partial Derivatives2003
Learning from Uncertain Data2003

« prev Page 39/51 next »