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)
Learning to Round for Discrete Labeling Problems
AISTATS 2018
Learning to Solve SMT Formulas
NeurIPS 2018
Learning without the Phase: Regularized PhaseMax Achieves Optimal Sample Complexity
NeurIPS 2018
Learning Word Vectors with Linear Constraints: A Matrix Factorization Approach
IJCAI 2018
Least-Squares Temporal Difference Learning for the Linear Quadratic Regulator
ICML 2018
Legendre Decomposition for Tensors
NeurIPS 2018
Let’s be Honest: An Optimal No-Regret Framework for Zero-Sum Games
ICML 2018
Level-Set Methods for Finite-Sum Constrained Convex Optimization
ICML 2018
Leveraged volume sampling for linear regression
NeurIPS 2018
Leveraging Well-Conditioned Bases: Streaming and Distributed Summaries in Minkowski p-Norms
ICML 2018
Limited Memory Kelley's Method Converges for Composite Convex and Submodular Objectives
NeurIPS 2018
Linear Satisfiability Preserving Assignments (Extended Abstract)
IJCAI 2018
Linear Spectral Estimators and an Application to Phase Retrieval
ICML 2018
Local and Global Optimization Techniques in Graph-Based Clustering
CVPR 2018
Local Convergence Properties of SAGA/Prox-SVRG and Acceleration
ICML 2018
Local Identifiability of ℓ_1-minimization Dictionary Learning: a Sufficient and Almost Necessary Condition
JMLR 2018
Locally Private Hypothesis Testing
ICML 2018
Local moment matching: A unified methodology for symmetric functional estimation and distribution estimation under Wasserstein distance
COLT 2018
Log-concave sampling: Metropolis-Hastings algorithms are fast!
COLT 2018
Loss Decomposition for Fast Learning in Large Output Spaces
ICML 2018
Lower Bounds for Higher-Order Convex Optimization
COLT 2018
Low-rank Interaction with Sparse Additive Effects Model for Large Data Frames
NeurIPS 2018
Low-Rank Riemannian Optimization on Positive Semidefinite Stochastic Matrices with Applications to Graph Clustering
ICML 2018
Low-Rank Tucker Decomposition of Large Tensors Using TensorSketch
NeurIPS 2018
LP Heuristics over Conjunctions: Compilation, Convergence, Nogood Learning
IJCAI 2018