By meaning
Describe a problem, a method or a question in your own words, and refract.science finds matching papers from COLT, even when they use other terms.
Search all 2,290 papers of the Conference on Learning Theory (COLT) from 2000 to 2026, by meaning or by exact keywords. refract.science is free and private. Connect your AI agent to search through all COLT papers for you.
| Year | Papers |
|---|---|
| 2000 | 35 |
| 2001 | 41 |
| 2002 | 27 |
| 2003 | 60 |
| 2004 | 46 |
| 2005 | 48 |
| 2006 | 48 |
| 2007 | 48 |
| 2008 | 51 |
| 2009 | 44 |
| 2010 | 48 |
| 2011 | 43 |
| 2012 | 47 |
| 2013 | 51 |
| 2014 | 61 |
| 2015 | 77 |
| 2016 | 70 |
| 2017 | 75 |
| 2018 | 94 |
| 2019 | 127 |
| 2020 | 126 |
| 2021 | 141 |
| 2022 | 163 |
| 2023 | 170 |
| 2024 | 170 |
| 2025 | 182 |
| 2026 | 197 |
Describe a problem, a method or a question in your own words, and refract.science finds matching papers from COLT, even when they use other terms.
Find exact phrases, authors and titles with boolean queries, e.g. author:"…" AND title:transformer, and filter by year. Run reproducible searches for literature studies.
Search COLT alongside 302,922 papers from 35 more venues, and follow similar papers across them.
Save papers to collections, screen them and export BibTeX, or let your AI agent search COLT for you.
Quiet Planting for $k$-SAT, Multiple Solutions of Arbitrary Geometry
Optimal Prediction-Augmented Algorithms for Testing Independence of Distributions
Swap Regret Minimization Through Response-Based Approachability
Dimension Reduction via Sum-of-Squares and Improved Clustering Algorithms for Non-Spherical Mixtures
Tight Long-Term Tail Decay of (Clipped) SGD in Non-Convex Optimization
Open Problem: How much overparametrization is needed for ALS in tensor decomposition?
Strongly Polynomial Time Complexity of Policy Iteration for $L_∞$ Robust MDPs
A Complexity Measure for Active Learning in Multi-group Mean Estimation
Variational Tail Bounds for Norms of Random Vectors and Matrices
Limitations of SGD for Multi-Index Models Beyond Statistical Queries
All 2,290 papers of the Conference on Learning Theory from 2000 to 2026, 97 % of them with abstracts. The COLT data was last updated on 2026-11-19.
Describe the topic in your own words, as a question, a short description or a few keywords. Semantic search ranks the COLT papers by how well their title and abstract match the meaning of your description, so you also find papers that use different terms than you do.
Use keyword search with fields and boolean operators, e.g. author:"…" AND venue:colt, or title:"…" to match an exact phrase in titles. Results are sorted by date and can be filtered by year.
Yes. Search COLT alongside other machine learning venues such as NeurIPS, ICML, ICLR and AISTATS, or across all 36 venues in refract.science, and follow similar papers between them.
Save papers to a collection and export it as BibTeX, CSV or JSON. You can also screen a collection by title and abstract, with include, maybe and exclude decisions, before you cite it.
Yes. Agents that support the Model Context Protocol (MCP), such as Claude, Cursor or VS Code, can search COLT in your browser, follow similar papers and add them to your collections.