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)
Differentiable Convex Optimization Layers
NeurIPS 2019
Differentiable Game Mechanics
JMLR 2019
Differentiable Linearized ADMM
ICML 2019
Differentiable Ranking and Sorting using Optimal Transport
NeurIPS 2019
Differentiable reservoir computing
JMLR 2019
Differential Inclusions for Modeling Nonsmooth ADMM Variants: A Continuous Limit Theory
ICML 2019
Differentially Private Online Submodular Minimization
AISTATS 2019
Differentially Private Optimal Transport: Application to Domain Adaptation
IJCAI 2019
Diffusion and Auction on Graphs
IJCAI 2019
Dimensionality Reduction and (Bucket) Ranking: a Mass Transportation Approach
ALT 2019
Dimensionality Reduction for Tukey Regression
ICML 2019
Dimension-Free Error Bounds from Random Projections
AAAI 2019
Dimension-Wise Importance Sampling Weight Clipping for Sample-Efficient Reinforcement Learning
ICML 2019
DINGO: Distributed Newton-Type Method for Gradient-Norm Optimization
NeurIPS 2019
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm
COLT 2019
Discovering Dialog Rules by Means of an Evolutionary Approach
Interspeech 2019
Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms
IJCAI 2019
Discrepancy, Coresets, and Sketches in Machine Learning
COLT 2019
Discrete Laplace Operator Estimation for Dynamic 3D Reconstruction
ICCV 2019
Discriminator optimal transport
NeurIPS 2019
Dispatching Through Pricing: Modeling Ride-Sharing and Designing Dynamic Prices
IJCAI 2019
Distributed estimation of the inverse Hessian by determinantal averaging
NeurIPS 2019
Distributed Inexact Newton-type Pursuit for Non-convex Sparse Learning
AISTATS 2019
Distributed Learning with Sublinear Communication
ICML 2019
Distributed Low-rank Matrix Factorization With Exact Consensus
NeurIPS 2019