COLT

ML/AI Core

1,791 papers · 2011–2026

COLT (Conference on Learning Theory) is dedicated to the theoretical foundations of machine learning and computational learning theory.

Papers per year

127

126

141

163

170

182

197

'15

'20

'25

Top authors

Ilias Diakonikolas 35 papers

Alexander Rakhlin 34 papers

Shay Moran 34 papers

Ohad Shamir 29 papers

Steve Hanneke 29 papers

Haipeng Luo 28 papers

Yishay Mansour 25 papers

Daniel M. Kane 22 papers

Nathan Srebro 22 papers

Tomer Koren 21 papers

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their counts at this venue are combined. How identity is handled.

Newest papers

Invited Open Problem: Does Differential Privacy Make PAC Learning Much Harder? 2026

Open Problem: Is Interaction Necessary for Order-Optimal 1-bit Mean Estimation? 2026

Invited Open Problem: Is the Power of Deep Learning over Linear Models Inherently Distribution Dependent? 2026

Invited Open Problem: Online Optimization of Piecewise-Lipschitz Functions with Applications to Data-Driven Algorithm Design 2026

Open Problem: How much overparametrization is needed for ALS in tensor decomposition? 2026

Gradient-Variation Regret Bounds for Unconstrained Online Learning 2026

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs 2026

Stable algorithms Lower Bounds for Estimation from MMSE Discontinuities: Extended Abstract 2026

Distribution-Free Sequential Prediction with Abstentions 2026

Learning Decision-Sufficient Representations for Linear Optimization 2026

Tight Sample Complexity of Transformers 2026

Optimism Stabilizes Thompson Sampling for Adaptive Inference 2026

Worst-case Error Bounds for Online Learning of Smooth Functions 2026

Lyapunov-Based Sample Complexity Analysis for Weakly-Coupled MDPs (extended abstract) 2026

Risk Comparisons in Linear Regression: Implicit Regularization Dominates Explicit Regularization (Extended Abstract) 2026

Minimax Limits of k-Fold Cross-Validation via Majority 2026

Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds 2026

Accelerated Convex Optimization via Hamiltonian Dynamics with Deterministic Integration Time 2026

A simple, optimal and efficient algorithm for online exp-concave optimization 2026

Almost sure null bankruptcy of testing-by-betting strategies 2026

All COLT 2026 papers →