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)
Batch Reinforcement Learning Through Continuation Method
ICLR 2021
Bayesian Latent Factor Model for Higher-order Data
ACML 2021
Bayesian Optimistic Optimisation with Exponentially Decaying Regret
ICML 2021
Bayesian Optimization with High-Dimensional Outputs
NeurIPS 2021
Bayesian Persuasion under Ex Ante and Ex Post Constraints
AAAI 2021
Bayesian Quadrature on Riemannian Data Manifolds
ICML 2021
Benchmarking Scalable Methods for Streaming Cross Document Entity Coreference
ACL 2021
Best Arm Identification in Graphical Bilinear Bandits
ICML 2021
Best-case lower bounds in online learning
NeurIPS 2021
Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up
IJCAI 2021
Best Model Identification: A Rested Bandit Formulation
ICML 2021
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
NeurIPS 2021
Better Algorithms for Individually Fair k-Clustering
NeurIPS 2021
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback
AAAI 2021
Beyond $log^2(T)$ regret for decentralized bandits in matching markets
ICML 2021
Beyond Bandit Feedback in Online Multiclass Classification
NeurIPS 2021
Beyond Perturbation Stability: LP Recovery Guarantees for MAP Inference on Noisy Stable Instances
AISTATS 2021
Beyond the Pareto Efficient Frontier: Constraint Active Search for Multiobjective Experimental Design
ICML 2021
Bias-corrected peaks-over-threshold estimation of the CVaR
UAI 2021
Bilevel Optimization: Convergence Analysis and Enhanced Design
ICML 2021
Bilinear Parameterization for Non-Separable Singular Value Penalties
CVPR 2021
Binary Matrix Factorisation via Column Generation
AAAI 2021
Black-Box Control for Linear Dynamical Systems
COLT 2021
Black-Box Reductions for Zeroth-Order Gradient Algorithms to Achieve Lower Query Complexity
JMLR 2021
Block-wise Word Embedding Compression Revisited: Better Weighting and Structuring
EMNLP 2021