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)
ZARTS: On Zero-order Optimization for Neural Architecture Search
NeurIPS 2022
Zero-Sum Stochastic Stackelberg Games
NeurIPS 2022
Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity
NeurIPS 2022
Zeroth-Order Methods for Convex-Concave Min-max Problems: Applications to Decision-Dependent Risk Minimization
AISTATS 2022
Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients
NeurIPS 2022
Zeroth-Order Optimization for Composite Problems with Functional Constraints
AAAI 2022
Zonotope Domains for Lagrangian Neural Network Verification
NeurIPS 2022
LeadCache: Regret-Optimal Caching in Networks
NeurIPS 2021
4D Cloud Scattering Tomography
ICCV 2021
A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs
NeurIPS 2021
A Blind Block Term Decomposition of High Order Tensors
AAAI 2021
A/B/n Testing with Control in the Presence of Subpopulations
NeurIPS 2021
Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract)
IJCAI 2021
Abstraction-based branch and bound approach to Q-learning for hybrid optimal control
L4DC 2021
Accelerated Algorithms for Smooth Convex-Concave Minimax Problems with O(1/k^2) Rate on Squared Gradient Norm
ICML 2021
Accelerated Combinatorial Search for Outlier Detection with Provable Bound on Sub-Optimality
AAAI 2021
Accelerated Concurrent Learning Algorithms via Data-Driven Hybrid Dynamics and Nonsmooth ODEs
L4DC 2021
Accelerated Learning with Robustness to Adversarial Regressors
L4DC 2021
Accelerating Atmospheric Turbulence Simulation via Learned Phase-to-Space Transform
ICCV 2021
Accelerating Distributed SGD for Linear Regression using Iterative Pre-Conditioning
L4DC 2021
Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descent
JMLR 2021
Accelerating Metropolis-Hastings with Lightweight Inference Compilation
AISTATS 2021
Acceleration via Fractal Learning Rate Schedules
ICML 2021
Accomplice Manipulation of the Deferred Acceptance Algorithm
IJCAI 2021
Accumulations of Projections—A Unified Framework for Random Sketches in Kernel Ridge Regression
AISTATS 2021