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

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)

Fast Algorithm for Constrained Linear Inverse Problems JMLR 2025 Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play COLT 2025 Fast and Interpretable Mixed-Integer Linear Program Solving by Learning Model Reduction AAAI 2025 Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity ICML 2025 Fast Bayesian Optimization of Function Networks with Partial Evaluations AutoML 2025 Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction JMLR 2025 Fast Computing of Dung Semantics in Acyclic Probabilistic Argumentation Frameworks AAAI 2025 Fast Contiguous Somatic Hypermutations for Single-Objective Optimisation and Multi-Objective Optimisation Via Decomposition AAAI 2025 Fast Convergence of $Φ$-Divergence Along the Unadjusted Langevin Algorithm and Proximal Sampler ALT 2025 Faster Acceleration for Steepest Descent COLT 2025 Faster Algorithms for Agnostically Learning Disjunctions and their Implications COLT 2025 Faster Approximation Algorithms for k-Center via Data Reduction ICML 2025 Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size ACML 2025 Faster Double Adaptive Gradient Methods AAAI 2025 Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nyström Method COLT 2025 Faster Rates for Private Adversarial Bandits ICML 2025 Faster Stochastic Optimization with Arbitrary Delays via Adaptive Asynchronous Mini-Batching ICML 2025 Fast Flow-based Visuomotor Policies via Conditional Optimal Transport Couplings CoRL 2025 Fast Globally Optimal and Geometrically Consistent 3D Shape Matching ICCV 2025 Fast Guaranteed Tensor Recovery with Adaptive Tensor Nuclear Norm IJCAI 2025 Fast Min-$ε$ Segmented Regression using Constant-Time Segment Merging ICML 2025 Fast Non-convex Matrix Sensing with Optimal Sample Complexity UAI 2025 Fast Second-Order Online Kernel Learning Through Incremental Matrix Sketching and Decomposition IJCAI 2025 Fast Tensor Completion via Approximate Richardson Iteration ICML 2025 FCOM: A Federated Collaborative Online Monitoring Framework via Representation Learning AAAI 2025