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 EXP3 Learning in Adversarial Bandits with Delayed Feedback
NeurIPS 2019
Online Forecasting of Total-Variation-bounded Sequences
NeurIPS 2019
Online High Rank Matrix Completion
CVPR 2019
Online Learning from Capricious Data Streams: A Generative Approach
IJCAI 2019
Online Learning in Kernelized Markov Decision Processes
AISTATS 2019
On-Line Learning of Linear Dynamical Systems: Exponential Forgetting in Kalman Filters
AAAI 2019
Online Learning via the Differential Privacy Lens
NeurIPS 2019
Online learning with feedback graphs and switching costs
AISTATS 2019
Online learning with kernel losses
ICML 2019
Online Learning with Sleeping Experts and Feedback Graphs
ICML 2019
Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms
NeurIPS 2019
Online Meta-Learning
ICML 2019
Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysis
NeurIPS 2019
Online Pandora’s Boxes and Bandits
AAAI 2019
Online Prediction of Switching Graph Labelings with Cluster Specialists
NeurIPS 2019
Online sampling from log-concave distributions
NeurIPS 2019
Online Stochastic Shortest Path with Bandit Feedback and Unknown Transition Function
NeurIPS 2019
On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons
NeurIPS 2019
On Sampling Complexity of the Semidefinite Affine Rank Feasibility Problem
AAAI 2019
On Scalable and Efficient Computation of Large Scale Optimal Transport
ICML 2019
On Testing of Uniform Samplers
AAAI 2019
On the Complexity of Approximating Wasserstein Barycenters
ICML 2019
On the Complexity of the Inverse Semivalue Problem for Weighted Voting Games
AAAI 2019
On the Computational Power of Online Gradient Descent
COLT 2019
On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimization
ICLR 2019