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)
Online learning with dynamics: A minimax perspective
NeurIPS 2020
Online Learning with Vector Costs and Bandits with Knapsacks
COLT 2020
Online Linear Optimization with Many Hints
NeurIPS 2020
Online MAP Inference of Determinantal Point Processes
NeurIPS 2020
Online metric algorithms with untrusted predictions
ICML 2020
Online mirror descent and dual averaging: keeping pace in the dynamic case
ICML 2020
Online Neural Connectivity Estimation with Noisy Group Testing
NeurIPS 2020
Online Non-Convex Learning: Following the Perturbed Leader is Optimal
ALT 2020
Online Non-Convex Optimization with Imperfect Feedback
NeurIPS 2020
Online Optimization with Memory and Competitive Control
NeurIPS 2020
Online Portfolio Selection with Cardinality Constraint and Transaction Costs based on Contextual Bandit
IJCAI 2020
Online Pricing with Offline Data: Phase Transition and Inverse Square Law
ICML 2020
Online Second Price Auction with Semi-Bandit Feedback under the Non-Stationary Setting
AAAI 2020
Online Sinkhorn: Optimal Transport distances from sample streams
NeurIPS 2020
Online Sufficient Dimension Reduction Through Sliced Inverse Regression
JMLR 2020
On lp-Support Vector Machines and Multidimensional Kernels
JMLR 2020
On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness
AISTATS 2020
On Metric DBSCAN with Low Doubling Dimension
IJCAI 2020
On Performance Estimation in Automatic Algorithm Configuration
AAAI 2020
On Regret with Multiple Best Arms
NeurIPS 2020
On Robustness in Qualitative Constraint Networks
IJCAI 2020
On Simulation and Trajectory Prediction with Gaussian Process Dynamics
L4DC 2020
On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach
ICLR 2020
On Stationary-Point Hitting Time and Ergodicity of Stochastic Gradient Langevin Dynamics
JMLR 2020
On Swap Convexity of Voting Rules
AAAI 2020