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)
Exploiting Tradeoffs for Exact Recovery in Heterogeneous Stochastic Block Models
NeurIPS 2016
Extremal Mechanisms for Local Differential Privacy
JMLR 2016
Fast Algorithms for Linear and Kernel SVM+
CVPR 2016
Fast Algorithms for Robust PCA via Gradient Descent
NeurIPS 2016
Fast Algorithms for Segmented Regression
ICML 2016
Fast and Provably Good Seedings for k-Means
NeurIPS 2016
Fast Constrained Submodular Maximization: Personalized Data Summarization
ICML 2016
Fast Convergence of Online Pairwise Learning Algorithms
AISTATS 2016
Fast Dictionary Learning with a Smoothed Wasserstein Loss
AISTATS 2016
Fast Distributed Submodular Cover: Public-Private Data Summarization
NeurIPS 2016
Fast DPP Sampling for Nystrom with Application to Kernel Methods
ICML 2016
Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier
ICML 2016
Faster Eigenvector Computation via Shift-and-Invert Preconditioning
ICML 2016
Faster Projection-free Convex Optimization over the Spectrahedron
NeurIPS 2016
Fast k-means with accurate bounds
ICML 2016
Fast Mixing Markov Chains for Strongly Rayleigh Measures, DPPs, and Constrained Sampling
NeurIPS 2016
Fast recovery from a union of subspaces
NeurIPS 2016
Fast Saddle-Point Algorithm for Generalized Dantzig Selector and FDR Control with Ordered L1-Norm
AISTATS 2016
Fast Stochastic Algorithms for SVD and PCA: Convergence Properties and Convexity
ICML 2016
Feature-distributed sparse regression: a screen-and-clean approach
NeurIPS 2016
Finite Sample Prediction and Recovery Bounds for Ordinal Embedding
NeurIPS 2016
First-order Methods for Geodesically Convex Optimization
COLT 2016
Fitting Spectral Decay with the k-Support Norm
AISTATS 2016
Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities
NeurIPS 2016
Frequency Estimation from Waveforms Using Multi-Layered Neural Networks
Interspeech 2016