conftrace_

Optimization & Theory

36,874 papers (3 classified directly here)

Subtopics

Optimization (14,983) Bayesian Inference (5,566) Learning Theory (5,334) Theory (4,955) Statistical Learning (4,117) Neural Network Optimization (3,649) Stochastic Processes (2,667) Loss Functions (1,162) Distributed Learning (1,135) Stochastic Methods (1,118) Online Algorithms (806) Statistics (684) Information Theory (318) Generalization (220) Sparse Optimization (158) Sample Complexity (99) Game Theory (30) Robust Optimization (17) Optimal Transport (14) Approximation Algorithms (10) Distributed Optimization (8) Convex Optimization (8)

Papers per year

1
52
337
806
3400
3289
'00
'05
'10
'15
'20
'25

Papers (including subtopics)

The Optimal Approximation Factor in Density Estimation COLT 2019
Sorted Top-k in Rounds COLT 2019
Universality of Computational Lower Bounds for Submatrix Detection COLT 2019
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness COLT 2019
Near-optimal method for highly smooth convex optimization COLT 2019
Optimal Learning of Mallows Block Model COLT 2019
Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret COLT 2019
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm COLT 2019
On the Computational Power of Online Gradient Descent COLT 2019
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal and Parameter-free COLT 2019
Faster Algorithms for High-Dimensional Robust Covariance Estimation COLT 2019
Testing Symmetric Markov Chains Without Hitting COLT 2019
Vortices Instead of Equilibria in MinMax Optimization: Chaos and Butterfly Effects of Online Learning in Zero-Sum Games COLT 2019
A near-optimal algorithm for approximating the John Ellipsoid COLT 2019
Artificial Constraints and Hints for Unbounded Online Learning COLT 2019
Combining Online Learning Guarantees COLT 2019
Learning from Weakly Dependent Data under Dobrushin’s Condition COLT 2019
Space lower bounds for linear prediction in the streaming model COLT 2019
Computationally and Statistically Efficient Truncated Regression COLT 2019
Reconstructing Trees from Traces COLT 2019
Is your function low dimensional? COLT 2019
Computational Limitations in Robust Classification and Win-Win Results COLT 2019
Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression COLT 2019
Communication and Memory Efficient Testing of Discrete Distributions COLT 2019
Testing Identity of Multidimensional Histograms COLT 2019