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)
On the Nyström Approximation for Preconditioning in Kernel Machines
AISTATS 2024
On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games
NeurIPS 2024
On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization
NeurIPS 2024
On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria
AAAI 2024
On the Power of Small-size Graph Neural Networks for Linear Programming
NeurIPS 2024
On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: a regret lower bound for WSU-UX
AISTATS 2024
On the Privacy of Selection Mechanisms with Gaussian Noise
AISTATS 2024
On the Role of Server Momentum in Federated Learning
AAAI 2024
On the Scalability and Memory Efficiency of Semidefinite Programs for Lipschitz Constant Estimation of Neural Networks
ICLR 2024
On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
AAAI 2024
On the Tractability of SHAP Explanations under Markovian Distributions
ICML 2024
On the Unstable Convergence Regime of Gradient Descent
AAAI 2024
On Universally Optimal Algorithms for A/B Testing
ICML 2024
On Weak Regret Analysis for Dueling Bandits
NeurIPS 2024
OPEL: Optimal Transport Guided ProcedurE Learning
NeurIPS 2024
OpenBox: A Python Toolkit for Generalized Black-box Optimization
JMLR 2024
Open Problem: Anytime Convergence Rate of Gradient Descent
COLT 2024
Open Problem: Black-Box Reductions and Adaptive Gradient Methods for Nonconvex Optimization
COLT 2024
Open problem: Convergence of single-timescale mean-field Langevin descent-ascent for two-player zero-sum games
COLT 2024
Operator-Learning-Inspired Modeling of Neural Ordinary Differential Equations
AAAI 2024
OptEx: Expediting First-Order Optimization with Approximately Parallelized Iterations
NeurIPS 2024
OptFlow: Fast Optimization-Based Scene Flow Estimation Without Supervision
WACV 2024
Optimal Acceleration for Minimax and Fixed-Point Problems is Not Unique
ICML 2024
Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
NeurIPS 2024
Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions
JMLR 2024