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)
Energetically Optimal Action Potentials
NeurIPS 2011
Exploiting Variable Stiffness in Explosive Movement Tasks
RSS 2011
Fast b-matching via Sufficient Selection Belief Propagation
AISTATS 2011
Fast Trajectory Correction for Nonholonomic Mobile Robots using Affine Transformations
RSS 2011
Finite Time Analysis of Stratified Sampling for Monte Carlo
NeurIPS 2011
Finite-Time Regional Verification of Stochastic Nonlinear Systems
RSS 2011
Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization
AISTATS 2011
From Bandits to Experts: On the Value of Side-Observations
NeurIPS 2011
Generalised Coupled Tensor Factorisation
NeurIPS 2011
Generalized Lasso based Approximation of Sparse Coding for Visual Recognition
NeurIPS 2011
Generative Modeling for Maximizing Precision and Recall in Information Visualization
AISTATS 2011
Global Optimization of Robotic Grasps
RSS 2011
Greedy Algorithms for Structurally Constrained High Dimensional Problems
NeurIPS 2011
Hashing Algorithms for Large-Scale Learning
NeurIPS 2011
Hierarchical Knowledge Gradient for Sequential Sampling
JMLR 2011
High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity
NeurIPS 2011
Higher-Order Correlation Clustering for Image Segmentation
NeurIPS 2011
Improved Algorithms for Linear Stochastic Bandits
NeurIPS 2011
Improved Moves for Truncated Convex Models
JMLR 2011
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback
AISTATS 2011
Information Theoretical Clustering via Semidefinite Programming
AISTATS 2011
Internal Regret with Partial Monitoring: Calibration-Based Optimal Algorithms
JMLR 2011
Learning Auto-regressive Models from Sequence and Non-sequence Data
NeurIPS 2011
Learning Eigenvectors for Free
NeurIPS 2011
Learning Higher-Order Graph Structure with Features by Structure Penalty
NeurIPS 2011