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
Probabilistic and Team PFIN-Type Learning: General Properties1996
Proceedings of the Ninth Annual Conference on Computational Learning Theory, COLT 1996, Desenzano del Garda, Italy, June 28-July 1, 19961996
Strong Minimax Lower Bounds for Learning1996
Synthesizing Enumeration Techniques for Language Learning1996
The Dual DFA Learning Problem: Hardness Results for Programming by Demonstration and Learning First-Order Representations (Extended Abstract)1996
The Importance of Convexity in Learning with Squared Loss1996
Towards Robust Model Selection Using Estimation and Approximation Error Bounds1996
Trees and Learning1996
VC Dimension of an Integrate-and-Fire Neuron Model1996
A Comparison of New and Old Algorithms for a Mixture Estimation Problem1995
A Game of Prediction with Expert Advice1995
An Experimental and Theoretical Comparison of Model Selection Methods1995
A Note on Learning Multivariate Polynomials Under the Uniform Distribution (Extended Abstract)1995
A Note on VC-Dimension and Measures of Sets of Reals1995
Being Taught can be Faster than Asking Questions1995
Concept Learning with Geometric Hypotheses1995
Corrigendum for "Learnability of Description Logics"1995
Criteria for Specifying Machine Complexity in Learning1995
DNF - If You Can't Learn'em, Teach'em: An Interactive Model of Teaching1995
Exactly Learning Automata with Small Cover Time1995
From Noise-Free to Noise-Tolerant and from On-line to Batch Learning1995
General Bounds on the Mutual Information Between a Parameter and n Conditionally Independent Observations1995
Generalized Teaching Dimensions and the Query Complexity of Learning1995
How to Use Expert Advice in the Case when Actual Values of Estimated Events Remain Unknown1995
Inductive Inference of Functions on the Rationals1995
Language Learning from Texts: Mind Changes, Limited Memory and Monotonicity (Extended Abstract)1995
Learning by a Population of Perceptrons1995
Learning DNF over the Uniform Distribution using a Quantum Example Oracle1995
Learning from a Mixture of Labeled and Unlabeled Examples with Parametric Side Information1995
Learning Internal Representations1995
Learning to Model Sequences Generated by Switching Distributions1995
Learning to Reason with a Restricted View1995
Learning Using Group Representations (Extended Abstract)1995
Learning via Queries and Oracles1995
Learning with Unreliable Boundary Queries1995
Markov Decision Processes in Large State Spaces1995
More or Less Efficient Agnostic Learning of Convex Polygons1995
More Theorems about Scale-sensitive Dimensions and Learning1995
Noise-Tolerant Parallel Learning of Geometric Concepts1995
On Efficient Agnostic Learning of Linear Combinations of Basis Functions1995
On Genetic Algorithms1995
On Learning Bounded-Width Branching Programs1995
On Learning Decision Trees with Large Output Domains (Extended Abstract)1995
On Learning from Noisy and Incomplete Examples1995
On-line Learning of Binary and n-ary Relations over Multi-dimensional Clusters1995
Online Learning via Congregational Gradient Descent1995
On Self-Directed Learning1995
On the Inductive Inference of Real Valued Functions1995
On the Learnability and Usage of Acyclic Probabilistic Finite Automata1995
On the Learnability of Zn-DNF Formulas (Extended Abstract)1995

« prev Page 45/51 next »