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 the Efficient Minimization of Classification Calibrated Surrogates
NeurIPS 2008
On the Generalization Ability of Online Strongly Convex Programming Algorithms
NeurIPS 2008
On the Size and Recovery of Submatrices of Ones in a Random Binary Matrix
JMLR 2008
Optimal Solutions for Sparse Principal Component Analysis
JMLR 2008
Optimization on a Budget: A Reinforcement Learning Approach
NeurIPS 2008
Particle Filter-based Policy Gradient in POMDPs
NeurIPS 2008
Phase transitions for high-dimensional joint support recovery
NeurIPS 2008
PSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning
NeurIPS 2008
QUIC-SVD: Fast SVD Using Cosine Trees
NeurIPS 2008
Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension
JMLR 2008
Ranking Individuals by Group Comparisons
JMLR 2008
Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking
NeurIPS 2008
Resolution Limits of Sparse Coding in High Dimensions
NeurIPS 2008
Robust Regression and Lasso
NeurIPS 2008
Robust Submodular Observation Selection
JMLR 2008
Sparse Signal Recovery Using Markov Random Fields
NeurIPS 2008
Spectral Clustering with Perturbed Data
NeurIPS 2008
Stochastic Recruitment: A Limited-Feedback Control Policy for Large Ensemble Systems
RSS 2008
Stochastic Relational Models for Large-scale Dyadic Data using MCMC
NeurIPS 2008
Structural Improvement Filtering Strategy for PRM
RSS 2008
Supervised Dictionary Learning
NeurIPS 2008
Supervised Exponential Family Principal Component Analysis via Convex Optimization
NeurIPS 2008
Support Vector Machinery for Infinite Ensemble Learning
JMLR 2008
Trust Region Newton Method for Logistic Regression
JMLR 2008
Value Function Approximation using Multiple Aggregation for Multiattribute Resource Management
JMLR 2008