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: Random Averages, Combinatorial Parameters, and Learnability
NeurIPS 2010
Online Markov Decision Processes under Bandit Feedback
NeurIPS 2010
Online Passive-Aggressive Algorithms on a Budget
AISTATS 2010
On-Line Sequential Bin Packing
JMLR 2010
On the Convexity of Latent Social Network Inference
NeurIPS 2010
Optimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets
NeurIPS 2010
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
JMLR 2010
Optimal Web-Scale Tiering as a Flow Problem
NeurIPS 2010
Parallelized Stochastic Gradient Descent
NeurIPS 2010
Parametric Bandits: The Generalized Linear Case
NeurIPS 2010
Policy gradients in linearly-solvable MDPs
NeurIPS 2010
Polynomial-Time Exact Inference in NP-Hard Binary MRFs via Reweighted Perfect Matching
AISTATS 2010
Practical Large-Scale Optimization for Max-norm Regularization
NeurIPS 2010
Random Conic Pursuit for Semidefinite Programming
NeurIPS 2010
Random Walk Approach to Regret Minimization
NeurIPS 2010
REGO: Rank-based Estimation of Renyi Information using Euclidean Graph Optimization
AISTATS 2010
Regret Bounds and Minimax Policies under Partial Monitoring
JMLR 2010
Regret Bounds for Gaussian Process Bandit Problems
AISTATS 2010
Relaxed Clipping: A Global Training Method for Robust Regression and Classification
NeurIPS 2010
Repeated Games against Budgeted Adversaries
NeurIPS 2010
Restricted Eigenvalue Properties for Correlated Gaussian Designs
JMLR 2010
Robust Clustering as Ensembles of Affinity Relations
NeurIPS 2010
Robust PCA via Outlier Pursuit
NeurIPS 2010
Sample Complexity of Testing the Manifold Hypothesis
NeurIPS 2010
Segmentation as Maximum-Weight Independent Set
NeurIPS 2010