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)
Efficient Projection-free Algorithms for Saddle Point Problems
NeurIPS 2020
Efficient Projection-Free Online Methods with Stochastic Recursive Gradient
AAAI 2020
Efficient Proximal Mapping of the 1-path-norm of Shallow Networks
ICML 2020
Efficient Rollout Strategies for Bayesian Optimization
UAI 2020
Efficient semidefinite-programming-based inference for binary and multi-class MRFs
NeurIPS 2020
Efficient Spectrum-Revealing CUR Matrix Decomposition
AISTATS 2020
Eigenvalue Normalized Recurrent Neural Networks for Short Term Memory
AAAI 2020
EiGLasso: Scalable Estimation of Cartesian Product of Sparse Inverse Covariance Matrices
UAI 2020
Electing Successive Committees: Complexity and Algorithms
AAAI 2020
Election Control by Manipulating Issue Significance
UAI 2020
Election Control in Social Networks via Edge Addition or Removal
AAAI 2020
Embedding Conjugate Gradient in Learning Random Walks for Landscape Connectivity Modeling in Conservation
IJCAI 2020
Enabling Programmable Transport Protocols in High-Speed NICs
NSDI 2020
End-to-End Transition-Based Online Dialogue Disentanglement
IJCAI 2020
Enriching Documents with Compact, Representative, Relevant Knowledge Graphs
IJCAI 2020
Ensemble Gaussian Processes with Spectral Features for Online Interactive Learning with Scalability
AISTATS 2020
Entropic Optimal Transport between Unbalanced Gaussian Measures has a Closed Form
NeurIPS 2020
Entrywise convergence of iterative methods for eigenproblems
NeurIPS 2020
Enumerating Maximal k-Plexes with Worst-Case Time Guarantee
AAAI 2020
Envelope-Based Approaches to Real-Time Heuristic Search
AAAI 2020
Erdos Goes Neural: an Unsupervised Learning Framework for Combinatorial Optimization on Graphs
NeurIPS 2020
Error-Correcting and Verifiable Parallel Inference in Graphical Models
AAAI 2020
Error Estimation for Sketched SVD via the Bootstrap
ICML 2020
Escaping Saddle-Point Faster under Interpolation-like Conditions
NeurIPS 2020
Escaping the Gravitational Pull of Softmax
NeurIPS 2020