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)
Nonnegative Tensor Completion via Integer Optimization
NeurIPS 2022
Nonparametric Involutive Markov Chain Monte Carlo
ICML 2022
Non-Probability Sampling Network for Stochastic Human Trajectory Prediction
CVPR 2022
Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret
NeurIPS 2022
Non-stationary Bandits with Knapsacks
NeurIPS 2022
Nonstationary Dual Averaging and Online Fair Allocation
NeurIPS 2022
Non-stationary Online Learning with Memory and Non-stochastic Control
AISTATS 2022
Nonstochastic Bandits and Experts with Arm-Dependent Delays
AISTATS 2022
Nonstochastic Bandits with Composite Anonymous Feedback
JMLR 2022
No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation
NeurIPS 2022
No-Regret Learning in Partially-Informed Auctions
ICML 2022
Norm-Agnostic Linear Bandits
AISTATS 2022
Novel Min-Max Reformulations of Linear Inverse Problems
JMLR 2022
No Weighted-Regret Learning in Adversarial Bandits with Delays
JMLR 2022
NSNet: A General Neural Probabilistic Framework for Satisfiability Problems
NeurIPS 2022
NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem
AAAI 2022
NysADMM: faster composite convex optimization via low-rank approximation
ICML 2022
Offline Vehicle Routing Problem with Online Bookings: A Novel Problem Formulation with Applications to Paratransit
IJCAI 2022
On Acceleration for Convex Composite Minimization with Noise-Corrupted Gradients and Approximate Proximal Mapping
JMLR 2022
On a Connection Between Fast and Sparse Oblivious Subspace Embeddings
AISTATS 2022
On Almost Sure Convergence Rates of Stochastic Gradient Methods
COLT 2022
On Biased Stochastic Gradient Estimation
JMLR 2022
On Constraints in First-Order Optimization: A View from Non-Smooth Dynamical Systems
JMLR 2022
On Convergence of Gradient Descent Ascent: A Tight Local Analysis
ICML 2022
On Convergence of Lookahead in Smooth Games
AISTATS 2022