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)
Exponential Lower Bounds for Fictitious Play in Potential Games
NeurIPS 2023
expOSE: Accurate Initialization-Free Projective Factorization Using Exponential Regularization
CVPR 2023
Expressive Optimal Temporal Planning via Optimization Modulo Theory
AAAI 2023
Extending Kernel PCA through Dualization: Sparsity, Robustness and Fast Algorithms
ICML 2023
Extremal Domain Translation with Neural Optimal Transport
NeurIPS 2023
Facility Location Games with Entrance Fees
AAAI 2023
Facto-CNN: Memory-Efficient CNN Training with Low-rank Tensor Factorization and Lossy Tensor Compression
ACML 2023
Fair Adaptive Experiments
NeurIPS 2023
Fair Allocation of Indivisible Chores: Beyond Additive Costs
NeurIPS 2023
Fair and Optimal Classification via Post-Processing
ICML 2023
Fair Division with Prioritized Agents
AAAI 2023
Fair learning with Wasserstein barycenters for non-decomposable performance measures
AISTATS 2023
Fairness and Welfare Quantification for Regret in Multi-Armed Bandits
AAAI 2023
Fairness Concepts for Indivisible Items with Externalities
AAAI 2023
Fairness in Streaming Submodular Maximization over a Matroid Constraint
ICML 2023
Fair, Polylog-Approximate Low-Cost Hierarchical Clustering
NeurIPS 2023
Fair Short Paths in Vertex-Colored Graphs
AAAI 2023
Faith-Shap: The Faithful Shapley Interaction Index
JMLR 2023
Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers
AAAI 2023
Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization
ICML 2023
Fast Algorithms for a New Relaxation of Optimal Transport
COLT 2023
Fast Algorithms for Distributed k-Clustering with Outliers
ICML 2023
Fast Algorithms for SAT with Bounded Occurrences of Variables
IJCAI 2023
FastAMI – a Monte Carlo Approach to the Adjustment for Chance in Clustering Comparison Metrics
AAAI 2023
Fast and Interpretable Dynamics for Fisher Markets via Block-Coordinate Updates
AAAI 2023