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
Mercer's Theorem, Feature Maps, and Smoothing2006
Nonlinear Estimators and Tail Bounds for Dimension Reduction in $l_1$ Using Cauchy Random Projections2006
On Learning and Logic2006
On Learning Languages from Positive Data and a Limited Number of Short Counterexamples2006
Online Learning Meets Optimization in the Dual2006
Online Learning with Constraints2006
Online Learning with Variable Stage Duration2006
Online Multitask Learning2006
Online Tracking of Linear Subspaces2006
Online Variance Minimization2006
On Optimal Learning Algorithms for Multiplicity Automata2006
Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise Condition2006
PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption2006
Parent Assignment Is Hard for the MDL, AIC, and NML Costs2006
Predictions as Statements and Decisions2006
Random Multivariate Search Trees2006
Ranking with a P-Norm Push2006
Significance and Recovery of Block Structures in Binary Matrices with Noise2006
Stable Transductive Learning2006
Subset Ranking Using Regression2006
Teaching Randomized Learners2006
The Rademacher Complexity of Linear Transformation Classes2006
Tracking the Best Hyperplane with a Simple Budget Perceptron2006
Uniform Convergence of Adaptive Graph-Based Regularization2006
Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention2006
Unifying Divergence Minimization and Statistical Inference Via Convex Duality2006
Analysis of Perceptron-Based Active Learning2005
A New Perspective on an Old Perceptron Algorithm2005
A PAC-Style Model for Learning from Labeled and Unlabeled Data2005
Approximating a Gram Matrix for Improved Kernel-Based Learning2005
Asymptotic Log-Loss of Prequential Maximum Likelihood Codes2005
Competitive Collaborative Learning2005
Compute Inclusion Depth of a Pattern2005
Data Dependent Concentration Bounds for Sequential Prediction Algorithms2005
Ellipsoid Approximation Using Random Vectors2005
Exponential Convergence Rates in Classification2005
Fast Rates for Support Vector Machines2005
From External to Internal Regret2005
From Graphs to Manifolds - Weak and Strong Pointwise Consistency of Graph Laplacians2005
Generalization Error Bounds Using Unlabeled Data2005
General Polynomial Time Decomposition Algorithms2005
Improved Minimax Bounds on the Test and Training Distortion of Empirically Designed Vector Quantizers2005
Improved Second-Order Bounds for Prediction with Expert Advice2005
Learnability of Bipartite Ranking Functions2005
Learning a Hidden Hypergraph2005
Learning Convex Combinations of Continuously Parameterized Basic Kernels2005
Learning Theory, 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005, Proceedings2005
Leaving the Span2005
Localized Upper and Lower Bounds for Some Estimation Problems2005
Loss Bounds for Online Category Ranking2005

« prev Page 37/51 next »