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)
On Explore-Then-Commit strategies
NeurIPS 2016
On Graduated Optimization for Stochastic Non-Convex Problems
ICML 2016
Online and Distributed Bayesian Moment Matching for Parameter Learning in Sum-Product Networks
AISTATS 2016
Online (and Offline) Robust PCA: Novel Algorithms and Performance Guarantees
AISTATS 2016
Online Collaborative Learning for Open-Vocabulary Visual Classifiers
CVPR 2016
Online Convex Optimization with Unconstrained Domains and Losses
NeurIPS 2016
Online Isotonic Regression
COLT 2016
Online Learning and Blackwell Approachability in Quitting Games
COLT 2016
Online learning in repeated auctions
COLT 2016
Online Learning to Rank with Feedback at the Top
AISTATS 2016
Online Learning with Feedback Graphs Without the Graphs
ICML 2016
Online PCA with Optimal Regret
JMLR 2016
Online Pricing with Strategic and Patient Buyers
NeurIPS 2016
Online Stochastic Linear Optimization under One-bit Feedback
ICML 2016
On Lloyd’s Algorithm: New Theoretical Insights for Clustering in Practice
AISTATS 2016
On Lower and Upper Bounds in Smooth and Strongly Convex Optimization
JMLR 2016
On Robustness of Kernel Clustering
NeurIPS 2016
On the Approximability of Sparse PCA
COLT 2016
On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models
JMLR 2016
On the Influence of Momentum Acceleration on Online Learning
JMLR 2016
On the Iteration Complexity of Oblivious First-Order Optimization Algorithms
ICML 2016
On the low-rank approach for semidefinite programs arising in synchronization and community detection
COLT 2016
On the Reducibility of Submodular Functions
AISTATS 2016
On the Statistical Limits of Convex Relaxations
ICML 2016
On the Use of Non-Stationary Strategies for Solving Two-Player Zero-Sum Markov Games
AISTATS 2016