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-Rate-Free Learning by D-Adaptation
ICML 2023
Learning Rate Free Sampling in Constrained Domains
NeurIPS 2023
Learning Regions of Interest for Bayesian Optimization with Adaptive Level-Set Estimation
ICML 2023
Learning Regularized Monotone Graphon Mean-Field Games
NeurIPS 2023
Learning Revenue Maximization Using Posted Prices for Stochastic Strategic Patient Buyers
AAAI 2023
Learning Sparse Graphon Mean Field Games
AISTATS 2023
Learning Sparse Group Models Through Boolean Relaxation
ICLR 2023
Learning the Efficient Frontier
NeurIPS 2023
Learning to Bid in Repeated First-Price Auctions with Budgets
ICML 2023
Learning to Break Symmetries for Efficient Optimization in Answer Set Programming
AAAI 2023
Learning to Configure Separators in Branch-and-Cut
NeurIPS 2023
Learning To Dive In Branch And Bound
NeurIPS 2023
Learning to Generate Columns with Application to Vertex Coloring
ICLR 2023
Learning to Optimize with Stochastic Dominance Constraints
AISTATS 2023
Learning to Rank under Multinomial Logit Choice
JMLR 2023
Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt
NeurIPS 2023
Learning When to Use Automatic Tabulation in Constraint Model Reformulation
IJCAI 2023
Least Squares Model Averaging for Distributed Data
JMLR 2023
Legal Argument Extraction from Court Judgements using Integer Linear Programming
EMNLP 2023
Let the Flows Tell: Solving Graph Combinatorial Problems with GFlowNets
NeurIPS 2023
Leveraging Locality and Robustness to Achieve Massively Scalable Gaussian Process Regression
NeurIPS 2023
Levin Tree Search with Context Models
IJCAI 2023
Lifted Inference with Linear Order Axiom
AAAI 2023
Lifting (D)QBF Preprocessing and Solving Techniques to (D)SSAT
AAAI 2023
Limited Resource Allocation in a Non-Markovian World: The Case of Maternal and Child Healthcare
IJCAI 2023