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
PAC Bounds for Multi-armed Bandit and Markov Decision Processes2002
Path Kernels and Multiplicative Updates2002
Performance Guarantees for Hierarchical Clustering2002
Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data2002
Prediction and Dimension2002
Predictive Complexity and Information2002
Self-Optimizing and Pareto-Optimal Policies in General Environments Based on Bayes-Mixtures2002
Some Local Measures of Complexity of Convex Hulls and Generalization Bounds2002
The Consistency of Greedy Algorithms for Classification2002
The Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions2002
Tracking Linear-Threshold Concepts with Winnow2002
Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments2001
A Generalized Representer Theorem2001
Agnostic Boosting2001
A Leave-One-out Cross Validation Bound for Kernel Methods with Applications in Learning2001
A Sequential Approximation Bound for Some Sample-Dependent Convex Optimization Problems with Applications in Learning2001
A Theoretical Analysis of Query Selection for Collaborative Filtering2001
Bounds on Sample Size for Policy Evaluation in Markov Environments2001
Data-Dependent Margin-Based Generalization Bounds for Classification2001
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces2001
Geometric Bounds for Generalization in Boosting2001
How Many Queries Are Needed to Learn One Bit of Information?2001
Learning Additive Models Online with Fast Evaluating Kernels2001
Learning Rates for Q-Learning2001
Limitations of Learning via Embeddings in Euclidean Half-Spaces2001
On the Synthesis of Strategies Identifying Recursive Functions2001
On Using Extended Statistical Queries to Avoid Membership Queries2001
Optimizing Average Reward Using Discounted Rewards2001
Potential-Based Algorithms in Online Prediction and Game Theory2001
Tracking a Small Set of Experts by Mixing Past Posteriors2001
Abstract Combinatorial Characterizations of Exact Learning via Queries2000
Adaptive and Self-Confident On-Line Learning Algorithms2000
An Improved On-line Algorithm for Learning Linear Evaluation Functions2000
Average-Case Complexity of Learning Polynomials2000
Barrier Boosting2000
Bias-Variance Error Bounds for Temporal Difference Updates2000
Boosting Using Branching Programs2000
Computable Shell Decomposition Bounds2000
Continuous Drifting Games2000
Decision Tree Approximations of Boolean Functions2000
Entropy Numbers of Linear Function Classes2000
Estimation and Approximation Bounds for Gradient-Based Reinforcement Learning2000
Generalisation Error Bounds for Sparse Linear Classifiers2000
Generalization Bounds for Decision Trees2000
Hardness Results for General Two-Layer Neural Networks2000
Improved Algorithms for Theory Revision with Queries2000
Improving Algorithms for Boosting2000
Language Learning From Texts: Degrees of Instrinsic Complexity and Their Characterizations2000
Leveraging for Regression2000
Localized Boosting2000

« prev Page 41/51 next »