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)
Linearized Wasserstein Barycenters: Synthesis, Analysis, Representational Capacity, and Applications
AISTATS 2025
Linear Mode Connectivity between Multiple Models modulo Permutation Symmetries
ICML 2025
Linear Streaming Bandit: Regret Minimization and Fixed-Budget Epsilon-Best Arm Identification
AAAI 2025
Linear Submodular Maximization with Bandit Feedback
AISTATS 2025
Linear Supervision for Nonlinear, High-Dimensional Neural Control and Differential Games
L4DC 2025
Linear Trading Position with Sparse Spectrum
IJCAI 2025
Lipschitz Bandits in Optimal Space
ICLR 2025
List Update with Prediction
AAAI 2025
LiteASR: Efficient Automatic Speech Recognition with Low-Rank Approximation
EMNLP 2025
Local convergence of simultaneous min-max algorithms to differential equilibrium on Riemannian manifold
ICLR 2025
Locally Private Sampling with Public Data
AISTATS 2025
LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression
ICLR 2025
Logarithmic Approximations for Fair k-Set Selection
IJCAI 2025
Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit
ALT 2025
Logarithmic regret of exploration in average reward Markov decision processes
COLT 2025
Losing Momentum in Continuous-time Stochastic Optimisation
JMLR 2025
Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes
UAI 2025
LP-Based Weighted Model Integration over Non-Linear Real Arithmetic
IJCAI 2025
MaDCoW: Marginal Distortion Correction for Wide-Angle Photography with Arbitrary Objects
CVPR 2025
Maintaining Proportional Committees with Dynamic Candidate Sets
ICML 2025
MAP: Low-compute Model Merging with Amortized Pareto Fronts via Quadratic Approximation
ICLR 2025
Market Making without Regret
COLT 2025
Massively Parallel Continuous Local Search for Hybrid SAT Solving on GPUs
AAAI 2025
Matrix Completion with Incomplete Side Information via Orthogonal Complement Projection
ICML 2025
Matrix-Free Shared Intrinsics Bundle Adjustment
CVPR 2025