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)
Nostalgic Adam: Weighting More of the Past Gradients When Designing the Adaptive Learning Rate
IJCAI 2019
Not All FPRASs are Equal: Demystifying FPRASs for DNF-Counting (Extended Abstract)
IJCAI 2019
Numerical Optimization to AI, and Back
AAAI 2019
Object Reachability via Swaps along a Line
AAAI 2019
Oblivious and Semi-Oblivious Boundedness for Existential Rules
IJCAI 2019
Obtaining Fairness using Optimal Transport Theory
ICML 2019
Offline Contextual Bayesian Optimization
NeurIPS 2019
On Computational Complexity of Pickup-and-Delivery Problems with Precedence Constraints or Time Windows
IJCAI 2019
On Constrained Nonconvex Stochastic Optimization: A Case Study for Generalized Eigenvalue Decomposition
AISTATS 2019
On Differentially Private Graph Sparsification and Applications
NeurIPS 2019
On Division Versus Saturation in Pseudo-Boolean Solving
IJCAI 2019
On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms
ICML 2019
On Fast Convergence of Proximal Algorithms for SQRT-Lasso Optimization: Don’t Worry About its Nonsmooth Loss Function
UAI 2019
On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles
IJCAI 2019
On First-Order Bounds, Variance and Gap-Dependent Bounds for Adversarial Bandits
UAI 2019
On Geometric Alignment in Low Doubling Dimension
AAAI 2019
On Learning Graphs with Edge-Detecting Queries
ALT 2019
Online Adaptive Principal Component Analysis and Its extensions
ICML 2019
Online Algorithm for Unsupervised Sensor Selection
AISTATS 2019
Online Algorithms for Rent-Or-Buy with Expert Advice
ICML 2019
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback
NeurIPS 2019
Online Control with Adversarial Disturbances
ICML 2019
Online Convex Matrix Factorization with Representative Regions
NeurIPS 2019
Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games
AAAI 2019
Online Convex Optimization in Adversarial Markov Decision Processes
ICML 2019