Optimization
14,850 papers (55 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Continuous Optimization (4,424)
Stochastic Methods (2,991)
Combinatorial Optimization (2,615)
Online Algorithms (2,404)
Optimization (1,521)
Game Theory (1,046)
Convex Optimization (864)
Discrete Optimization (721)
Optimal Transport (474)
Sparse Optimization (416)
Optimal Control (271)
Global Optimization (200)
Non-Convex Optimization (182)
Distributed Learning (164)
Approximation Algorithms (162)
Multi-Objective Optimization (151)
Distributed Optimization (136)
Bayesian Optimization (132)
Theory (109)
Compressed Sensing (102)
Algorithms (89)
Robust Optimization (86)
Submodular Optimization (77)
Kernel Methods (75)
Evolutionary Algorithm (72)
Linear Programming (54)
Tensor Decomposition (48)
Bilevel Optimization (42)
Integer Programming (38)
Matrix Completion (33)
Algorithm (21)
Regularization (11)
Papers per year
1
2
6
6
5
16
67
72
80
102
133
171
219
398
425
440
487
649
812
1,162
1,353
1,487
1,474
1,600
1,870
1,441
372
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
Online Submodular Resource Allocation with Applications to Rebalancing Shared Mobility Systems
ICML 2021
Online Unrelated Machine Load Balancing with Predictions Revisited
ICML 2021
On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization
ICML 2021
On lp-hyperparameter Learning via Bilevel Nonsmooth Optimization
JMLR 2021
On Minimizing the Number of Running Buffers for Tabletop Rearrangement
RSS 2021
On Multi-Armed Bandit Designs for Dose-Finding Trials
JMLR 2021
On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems
AAAI 2021
On Optimal Robustness to Adversarial Corruption in Online Decision Problems
NeurIPS 2021
On Riemannian Optimization over Positive Definite Matrices with the Bures-Wasserstein Geometry
NeurIPS 2021
On Riemannian Stochastic Approximation Schemes with Fixed Step-Size
AISTATS 2021
On Robust Optimal Transport: Computational Complexity and Barycenter Computation
NeurIPS 2021
On Solving Probabilistic Linear Diophantine Equations
JMLR 2021
On the Approximation of Nash Equilibria in Sparse Win-Lose Multi-player Games
AAAI 2021
On the Bias-Variance-Cost Tradeoff of Stochastic Optimization
NeurIPS 2021
On the Complexity of Sum-of-Products Problems over Semirings
AAAI 2021
On the Convergence of Hamiltonian Monte Carlo with Stochastic Gradients
ICML 2021
On the Convergence of Langevin Monte Carlo: The Interplay between Tail Growth and Smoothness
COLT 2021
On the Convergence of Stochastic Compositional Gradient Descent Ascent Method
IJCAI 2021
On the convergence of the Metropolis algorithm with fixed-order updates for multivariate binary probability distributions
AISTATS 2021
On the Convex Combination of Determinantal Point Processes
ACML 2021
On the Impossibility of Global Convergence in Multi-Loss Optimization
ICLR 2021
On the Minimax Optimality of the EM Algorithm for Learning Two-Component Mixed Linear Regression
AISTATS 2021
On the Parameterized Complexity of Polytree Learning
IJCAI 2021
On the PTAS for Maximin Shares in an Indivisible Mixed Manna
AAAI 2021
On the Rate of Convergence of Regularized Learning in Games: From Bandits and Uncertainty to Optimism and Beyond
NeurIPS 2021