conftrace
_
Papers
Trends
Conferences
Explore
Authors
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Achievements
← Optimization & Theory
Machine Learning
›
Optimization & Theory
›
Learning Theory
5,312 papers
Papers per year
2001: 1
2002: 16
2003: 16
2004: 15
2005: 17
2006: 30
2007: 32
2008: 32
2009: 34
2010: 66
2011: 76
2012: 74
2013: 94
2014: 115
2015: 123
2016: 128
2017: 185
2018: 219
2019: 390
2020: 466
2021: 640
2022: 664
2023: 799
2024: 688
2025: 307
2026: 85
Papers
Exponential Convergence of Testing Error for Stochastic Gradient Methods
COLT 2018
Learning Without Mixing: Towards A Sharp Analysis of Linear System Identification
COLT 2018
Active Tolerant Testing
COLT 2018
Optimal Errors and Phase Transitions in High-Dimensional Generalized Linear Models
COLT 2018
Nonstochastic Bandits with Composite Anonymous Feedback
COLT 2018
Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms
COLT 2018
Time-Space Tradeoffs for Learning Finite Functions from Random Evaluations, with Applications to Polynomials
COLT 2018
Local Optimality and Generalization Guarantees for the Langevin Algorithm via Empirical Metastability
COLT 2018
Hardness of Learning Noisy Halfspaces using Polynomial Thresholds
COLT 2018
Best of both worlds: Stochastic & adversarial best-arm identification
COLT 2018
Adaptivity to Smoothness in X-armed bandits
COLT 2018
A Direct Sum Result for the Information Complexity of Learning
COLT 2018
Efficient Contextual Bandits in Non-stationary Worlds
COLT 2018
Learning Single-Index Models in Gaussian Space
COLT 2018
Breaking the $1/\sqrt{n}$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time
COLT 2018
Minimax Bounds on Stochastic Batched Convex Optimization
COLT 2018
Open Problem: The Dependence of Sample Complexity Lower Bounds on Planning Horizon
COLT 2018
From Strings to Other Things: Linking the Neighborhood and Transposition Effects in Word Reading
CONLL 2018
Empirical Study of the Topology and Geometry of Deep Networks
CVPR 2018
What Have We Learned From Deep Representations for Action Recognition?
CVPR 2018
SimpleQuestions Nearly Solved: A New Upperbound and Baseline Approach
EMNLP 2018
What Makes Reading Comprehension Questions Easier?
EMNLP 2018
When does deep multi-task learning work for loosely related document classification tasks?
EMNLP 2018
Nightmare at test time: How punctuation prevents parsers from generalizing
EMNLP 2018
Evaluating the Ability of LSTMs to Learn Context-Free Grammars
EMNLP 2018
<
1
…
166
167
168
…
213
>