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)
Oblivious Sketching for Logistic Regression
ICML 2021
Of Moments and Matching: A Game-Theoretic Framework for Closing the Imitation Gap
ICML 2021
On a Combination of Alternating Minimization and Nesterov’s Momentum
ICML 2021
On a Competitive Secretary Problem with Deferred Selections
IJCAI 2021
On ADMM in Deep Learning: Convergence and Saturation-Avoidance
JMLR 2021
On a Utilitarian Approach to Privacy Preserving Text Generation
NAACL 2021
On Continuous Local BDD-Based Search for Hybrid SAT Solving
AAAI 2021
On efficient multilevel Clustering via Wasserstein distances
JMLR 2021
One for One, or All for All: Equilibria and Optimality of Collaboration in Federated Learning
ICML 2021
One More Step Towards Reality: Cooperative Bandits with Imperfect Communication
NeurIPS 2021
Oneshot Differentially Private Top-k Selection
ICML 2021
One-Shot Federated Learning: Theoretical Limits and Algorithms to Achieve Them
JMLR 2021
One-sided Frank-Wolfe algorithms for saddle problems
ICML 2021
On Estimation in Latent Variable Models
ICML 2021
On Fair Division under Heterogeneous Matroid Constraints
AAAI 2021
On Finding the K-best Non-projective Dependency Trees
ACL 2021
On Information Gain and Regret Bounds in Gaussian Process Bandits
AISTATS 2021
On learning sparse vectors from mixture of responses
NeurIPS 2021
On Limited-Memory Subsampling Strategies for Bandits
ICML 2021
Online Adaptation to Label Distribution Shift
NeurIPS 2021
Online A-Optimal Design and Active Linear Regression
ICML 2021
Online Control of Unknown Time-Varying Dynamical Systems
NeurIPS 2021
Online Convex Optimization with Continuous Switching Constraint
NeurIPS 2021
Online DR-Submodular Maximization: Minimizing Regret and Constraint Violation
AAAI 2021
Online Graph Dictionary Learning
ICML 2021