P
PaperPicks
Conferences
← All conferences
Editions
2026
2025
2024
COLT
2026
A*
Annual Conference on Learning Theory
Official site ↗
197
accepted papers
186
authors
June 29 - July 3, 2026
dates
California
location
197
/ 197 papers
All
197
Main Track
196
Editorship
1
1
A Characterization of List Language Identification in the Limit
Moses Charikar
DBLP profile ↗
ORCID search ↗
2
A Complexity Measure for Active Learning in Multi-group Mean Estimation
Abdellah Aznag
DBLP profile ↗
ORCID search ↗
3
A Depth Hierarchy for Computing the Maximum in ReLU Networks via Extremal Graph Theory
Itay Safran
DBLP profile ↗
ORCID search ↗
4
A Distribution Testing Approach to Clustering Distributions
Gunjan Kumar
DBLP profile ↗
ORCID search ↗
5
A Perfectly Truthful Calibration Measure
Jason D. Hartline
DBLP profile ↗
ORCID search ↗
6
A Quasi-Polynomial Time Mean Estimator Under Mean-Shift Contamination with Unknown Covariance
Ilias Diakonikolas
DBLP profile ↗
ORCID 0000-0002-5486-1856 ↗
7
A simple, optimal and efficient algorithm for online exp-concave optimization
Yi-Han Wang
DBLP profile ↗
ORCID search ↗
8
A Single Stepsize Suffices for Unprojected Linear TD(0): Simultaneous Robust and Fast Rates via Polyak-Ruppert Averaging
Wei-Cheng Lee
DBLP profile ↗
ORCID search ↗
9
A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
Zachary Chase
DBLP profile ↗
ORCID search ↗
10
A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions
Yuzhou Gu
DBLP profile ↗
ORCID search ↗
11
Accelerated Convex Optimization via Hamiltonian Dynamics with Deterministic Integration Time
Xiuyuan Wang
DBLP profile ↗
ORCID search ↗
12
Active Learning on Adversarially Corrupted Graphs
Marco Bressan
DBLP profile ↗
ORCID search ↗
13
Actively Learning Halfspaces without Synthetic Data
Hadley Black
DBLP profile ↗
ORCID search ↗
14
Adaptive Learning Rates with Surrogate Probability for Follow-the-Perturbed-Leader
Jongyeong Lee
DBLP profile ↗
ORCID search ↗
15
Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization
Ruichen Jiang
DBLP profile ↗
ORCID search ↗
16
Adaptive Weighted Averaging
Aditya Bhaskara
DBLP profile ↗
ORCID search ↗
17
Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret
Shinji Ito
DBLP profile ↗
ORCID search ↗
18
Algorithmic Thinking Theory
MohammadHossein Bateni
DBLP profile ↗
ORCID search ↗
19
Almost Linear Convergence under Minimal Score Assumptions: Quantized Transition Diffusion
Xunpeng Huang
DBLP profile ↗
ORCID search ↗
20
Almost sure null bankruptcy of testing-by-betting strategies
Hongjian Wang
DBLP profile ↗
ORCID search ↗
21
Ambiguous Online Learning
Vanessa Kosoy
DBLP profile ↗
ORCID search ↗
22
An Empirical Bayes Perspective on Heteroskedastic Mean Estimation
Yanjun Han
DBLP profile ↗
ORCID search ↗
23
An Exponential Lower Bound for Spectral Density Estimation on Unweighted Graphs
Pan Peng
DBLP profile ↗
ORCID search ↗
24
Avoiding exp(k*) Scaling for Thompson Sampling in Combinatorial Semi-Bandits: From Multiple Seeds to a Single Seed
Tianyuan Jin
DBLP profile ↗
ORCID search ↗
25
Blackwell Approachability and Gradient Equilibrium are Equivalent
Brian W. Lee
DBLP profile ↗
ORCID search ↗
26
Boosting with List-Decodable Codes
Addison Prairie
DBLP profile ↗
ORCID search ↗
27
Calibeating Made Simple
Yurong Chen
DBLP profile ↗
ORCID search ↗
28
Can SGD Select Good Fishermen? Local Convergence under Self-Selection Biases (Extended Abstract)
Alkis Kalavasis
DBLP profile ↗
ORCID search ↗
29
Characterizing Online and Private Learnability under Distributional Constraints via Generalized Smoothness
Moïse Blanchard
DBLP profile ↗
ORCID search ↗
30
Clipping the Price of Adaptivity at the Tail
Itai Kreisler
DBLP profile ↗
ORCID search ↗
31
Cloning is as Hard as Learning for Stabilizer States
Nikhil Bansal
DBLP profile ↗
ORCID search ↗
32
Compact Geometric Representations of Hierarchies
Prashant Gokhale
DBLP profile ↗
ORCID search ↗
33
Computing Lewis weights to high precision using local relative smoothness
Sander Gribling
DBLP profile ↗
ORCID search ↗
34
Continuous time policy evaluation is easier with noisy dynamics
Samuel Robertson
DBLP profile ↗
ORCID search ↗
35
Convergence of Continual Learning in Homogeneous Deep Networks
Matan Schliserman
DBLP profile ↗
ORCID search ↗
36
CONVERGENCE RATES FOR DISTRIBUTION MATCHING WITH SLICED OPTIMAL TRANSPORT
Gauthier Thurin
DBLP profile ↗
ORCID search ↗
37
Data Augmentation: A Fourier Analysis Perspective
Behrooz Tahmasebi
DBLP profile ↗
ORCID search ↗
38
DDPM Score Matching and Distribution Learning (Extended Abstract)
Sinho Chewi
DBLP profile ↗
ORCID search ↗
39
Deep Q-Learning on Hölder Spaces
Qian Qi
DBLP profile ↗
ORCID search ↗
40
Defensive Generation
Gabriele Farina
DBLP profile ↗
ORCID search ↗
41
Density estimation for Hellinger via minimum-distance estimators: mixtures of Gaussians, log-concave, and more
Spencer Compton
DBLP profile ↗
ORCID search ↗
42
Differentially Private Language Generation and Identification in the Limit (Extended Abstract)
Anay Mehrotra
DBLP profile ↗
ORCID search ↗
43
Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds
Ziao Wang
DBLP profile ↗
ORCID search ↗
44
Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures
Prashanti Anderson
DBLP profile ↗
ORCID search ↗
45
Distribution-Free Sequential Prediction with Abstentions
Jialin Yu
DBLP profile ↗
ORCID search ↗
46
Efficient Learning and Symmetry Discovery under Exact Invariances
Ashkan Soleymani
DBLP profile ↗
ORCID search ↗
47
Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
Daniil Dmitriev
DBLP profile ↗
ORCID search ↗
48
Efficient Swap Multicalibration of Elicitable Properties
Lunjia Hu
DBLP profile ↗
ORCID search ↗
49
Eigen-Spike Emergence and Quadratic Equivalents for Conjugate Kernels on Nonlinearly Separable Data
Collin Cranston
DBLP profile ↗
ORCID search ↗
50
Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift
Shyamal Patel
DBLP profile ↗
ORCID search ↗
Show 100 more
(147 left)