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)
Quasi-Newton Methods for Saddle Point Problems
NeurIPS 2022
Quaternion Ordinal Embedding
IJCAI 2022
Query-Efficient and Scalable Black-Box Adversarial Attacks on Discrete Sequential Data via Bayesian Optimization
ICML 2022
Queue Up Your Regrets: Achieving the Dynamic Capacity Region of Multiplayer Bandits
NeurIPS 2022
RAGO: Recurrent Graph Optimizer for Multiple Rotation Averaging
CVPR 2022
RAMA: A Rapid Multicut Algorithm on GPU
CVPR 2022
Randomized Stochastic Gradient Descent Ascent
AISTATS 2022
Random Mapping Method for Large-Scale Terrain Modeling
AAAI 2022
Rapid Convergence of Informed Importance Tempering
AISTATS 2022
Rapidly Mixing Multiple-try Metropolis Algorithms for Model Selection Problems
NeurIPS 2022
Rate-Distortion Theoretic Bounds on Generalization Error for Distributed Learning
NeurIPS 2022
Rate-Optimal Online Convex Optimization in Adaptive Linear Control
NeurIPS 2022
Real-Time Driver-Request Assignment in Ridesourcing
AAAI 2022
RECAPP: Crafting a More Efficient Catalyst for Convex Optimization
ICML 2022
Reconstruction on Trees and Low-Degree Polynomials
NeurIPS 2022
Recruitment Strategies That Take a Chance
NeurIPS 2022
Re-evaluating Word Mover’s Distance
ICML 2022
Refined Lower Bounds for Nearest Neighbor Condensation
ALT 2022
Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
AISTATS 2022
Regret Bounds for Risk-Sensitive Reinforcement Learning
NeurIPS 2022
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation
ICML 2022
Regularized and Smooth Double Core Tensor Factorization for Heterogeneous Data
JMLR 2022
Regularized Gradient Descent Ascent for Two-Player Zero-Sum Markov Games
NeurIPS 2022
Reinforced Genetic Algorithm for Structure-based Drug Design
NeurIPS 2022
Rejection sampling from shape-constrained distributions in sublinear time
AISTATS 2022