Skip to content
conftrace_

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
16
133
440
1,353
1,441
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III) IJCAI 2025 The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations ICML 2025 The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback ICML 2025 The Impact of Literal Sorting on Cardinality Constraint Encodings AAAI 2025 The impact of uncertainty on regularized learning in games ICML 2025 The Oracle Complexity of Simplex-based Matrix Games: Linear Separability and Nash Equilibria COLT 2025 Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem IJCAI 2025 Theoretical Analysis of Leave-one-out Cross Validation for Non-differentiable Penalties under High-dimensional Settings AISTATS 2025 Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization AISTATS 2025 Theoretical Performance Guarantees for Partial Domain Adaptation via Partial Optimal Transport ICML 2025 The Pivoting Framework: Frank-Wolfe Algorithms with Active Set Size Control AISTATS 2025 The Planted Spanning Tree Problems: Exact Overlap Characterization via Local Weak Convergence Extended Abstract COLT 2025 The Power of Random Features and the Limits of Distribution-Free Gradient Descent ICML 2025 The Relationship Between No-Regret Learning and Online Conformal Prediction ICML 2025 The Role of Randomness in Stability ICML 2025 The Sparse-Plus-Low-Rank Quasi-Newton Method for Entropic-Regularized Optimal Transport ICML 2025 The Value of Recall in Extensive-Form Games AAAI 2025 The Z-Gromov-Wasserstein Distance JMLR 2025 Threshold UCT: Cost-Constrained Monte Carlo Tree Search with Pareto Curves AAAI 2025 Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent AISTATS 2025 Tightening Causal Bounds via Covariate-Aware Optimal Transport ICML 2025 Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity ICLR 2025 Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm IJCAI 2025 Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics ICLR 2025 Time Series Supplier Allocation via Deep Black-Litterman Model AAAI 2025