conftrace_
← Mathematics & Optimization
Mathematics & Optimization ›

Optimization

12,959 papers (55 classified directly here)

Subtopics

Continuous Optimization (3,907) Stochastic Methods (2,788) Combinatorial Optimization (2,409) Online Algorithms (2,192) Optimization (1,207) Game Theory (944) Discrete Optimization (705) Convex Optimization (591) Optimal Transport (369) Sparse Optimization (347) Optimal Control (225) Global Optimization (190) Distributed Learning (157) Multi-Objective Optimization (125) Approximation Algorithms (110) Bayesian Optimization (100) Distributed Optimization (99) Theory (98) Non-Convex Optimization (76) Kernel Methods (73) Compressed Sensing (72) Robust Optimization (70) Evolutionary Algorithm (58) Linear Programming (43) Algorithms (10) Algorithm (10) Integer Programming (9) Submodular Optimization (9) Matrix Completion (8) Bilevel Optimization (8) Tensor Decomposition (6) Regularization (5)

Papers per year

1
15
119
411
1322
644
'00
'05
'10
'15
'20
'25

Papers (including subtopics)

Optimizing Optimizers: Regret-optimal gradient descent algorithms COLT 2021
Black-Box Control for Linear Dynamical Systems COLT 2021
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition COLT 2021
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications COLT 2021
Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm COLT 2021
Sparse sketches with small inversion bias COLT 2021
Random Coordinate Langevin Monte Carlo COLT 2021
Kernel Thinning COLT 2021
On the Convergence of Langevin Monte Carlo: The Interplay between Tail Growth and Smoothness COLT 2021
Adaptivity in Adaptive Submodularity COLT 2021
Convergence rates and approximation results for SGD and its continuous-time counterpart COLT 2021
Frank-Wolfe with a Nearest Extreme Point Oracle COLT 2021
Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games COLT 2021
Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium COLT 2021
Streaming k-PCA: Efficient guarantees for Oja’s algorithm, beyond rank-one updates COLT 2021
Group testing and local search: is there a computational-statistical gap? COLT 2021
Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds COLT 2021
Double Explore-then-Commit: Asymptotic Optimality and Beyond COLT 2021
Reduced-Rank Regression with Operator Norm Error COLT 2021
The Sparse Vector Technique, Revisited COLT 2021
Projected Stochastic Gradient Langevin Algorithms for Constrained Sampling and Non-Convex Learning COLT 2021
Improved Regret for Zeroth-Order Stochastic Convex Bandits COLT 2021
Mirror Descent and the Information Ratio COLT 2021
Structured Logconcave Sampling with a Restricted Gaussian Oracle COLT 2021
Corruption-robust exploration in episodic reinforcement learning COLT 2021