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)
A Computational Framework for Solving Wasserstein Lagrangian Flows
ICML 2024
A connection between Tempering and Entropic Mirror Descent
ICML 2024
A Contextual Combinatorial Bandit Approach to Negotiation
ICML 2024
Active Adaptive Experimental Design for Treatment Effect Estimation with Covariate Choice
ICML 2024
Active Learning for Derivative-Based Global Sensitivity Analysis with Gaussian Processes
NeurIPS 2024
Active Ranking and Matchmaking, with Perfect Matchings
ICML 2024
AdaLomo: Low-memory Optimization with Adaptive Learning Rate
ACL 2024
Adam with model exponential moving average is effective for nonconvex optimization
NeurIPS 2024
Adaptive and non-adaptive minimax rates for weighted Laplacian-Eigenmap based nonparametric regression
AISTATS 2024
Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
NeurIPS 2024
Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search
AAAI 2024
Adaptive Combinatorial Maximization: Beyond Approximate Greedy Policies
ALT 2024
Adaptive Conformal Inference by Betting
ICML 2024
Adaptive Experimentation When You Can't Experiment
NeurIPS 2024
Adaptive Federated Minimax Optimization with Lower Complexities
AISTATS 2024
Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
COLT 2024
Adaptively Learning to Select-Rank in Online Platforms
ICML 2024
Adaptively Perturbed Mirror Descent for Learning in Games
ICML 2024
Adaptive Observation Cost Control for Variational Quantum Eigensolvers
ICML 2024
Adaptive Online Experimental Design for Causal Discovery
ICML 2024
Adaptive online non-stochastic control
L4DC 2024
Adaptive Proximal Gradient Method for Convex Optimization
NeurIPS 2024
Adaptive Proximal Gradient Methods Are Universal Without Approximation
ICML 2024
Adaptive Quasi-Newton and Anderson Acceleration Framework with Explicit Global (Accelerated) Convergence Rates
AISTATS 2024
Adaptive Softassign via Hadamard-Equipped Sinkhorn
CVPR 2024