conftrace_
← Machine Learning
Machine Learning ›

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)

On the Complexity of A/B Testing COLT 2014
Elicitation and Identification of Properties COLT 2014
The sample complexity of agnostic learning under deterministic labels COLT 2014
A Convex Formulation for Mixed Regression with Two Components: Minimax Optimal Rates COLT 2014
Efficiency of conformalized ridge regression COLT 2014
Most Correlated Arms Identification COLT 2014
Computational Limits for Matrix Completion COLT 2014
Robust Multi-objective Learning with Mentor Feedback COLT 2014
Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability COLT 2014
New Algorithms for Learning Incoherent and Overcomplete Dictionaries COLT 2014
Online Linear Optimization via Smoothing COLT 2014
Localized Complexities for Transductive Learning COLT 2014
On the Consistency of Output Code Based Learning Algorithms for Multiclass Learning Problems COLT 2014
Lower Bounds on the Performance of Polynomial-time Algorithms for Sparse Linear Regression COLT 2014
Follow the Leader with Dropout Perturbations COLT 2014
Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity COLT 2014
Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations COLT 2014
Principal Component Analysis and Higher Correlations for Distributed Data COLT 2014
Compressed Counting Meets Compressed Sensing COLT 2014
The Geometry of Losses COLT 2014
Resourceful Contextual Bandits COLT 2014
The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures COLT 2014
Near-Optimal Herding COLT 2014
Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians COLT 2014