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 Learning Discrete Graphical Models using Greedy Methods
NeurIPS 2011
Online Learning: Beyond Regret
COLT 2011
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm
JMLR 2011
Online Learning of Structured Predictors with Multiple Kernels
AISTATS 2011
Online Learning: Stochastic, Constrained, and Smoothed Adversaries
NeurIPS 2011
Online Submodular Set Cover, Ranking, and Repeated Active Learning
NeurIPS 2011
On the accuracy of l1-filtering of signals with block-sparse structure
NeurIPS 2011
On the Universality of Online Mirror Descent
NeurIPS 2011
Optimal aggregation of affine estimators
COLT 2011
Optimal and Robust Price Experimentation: Learning by Lottery
AISTATS 2011
Optimal Distributed Market-Based Planning for Multi-Agent Systems with Shared Resources
AISTATS 2011
Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness
NeurIPS 2011
Orthogonal Matching Pursuit with Replacement
NeurIPS 2011
Parallel Algorithm for Learning Optimal Bayesian Network Structure
JMLR 2011
Parameter Screening and Optimisation for ILP using Designed Experiments
JMLR 2011
Penalty Decomposition Methods for Rank Minimization
NeurIPS 2011
Phase transition in the family of p-resistances
NeurIPS 2011
Predicting Dynamic Difficulty
NeurIPS 2011
Prediction strategies without loss
NeurIPS 2011
Prismatic Algorithm for Discrete D.C. Programming Problem
NeurIPS 2011
Projection onto A Nonnegative Max-Heap
NeurIPS 2011
Pylon Model for Semantic Segmentation
NeurIPS 2011
Quasi-Newton Methods for Markov Chain Monte Carlo
NeurIPS 2011
Randomized Algorithms for Comparison-based Search
NeurIPS 2011
Rapid Deformable Object Detection using Dual-Tree Branch-and-Bound
NeurIPS 2011