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)

Ant Colony Sampling with GFlowNets for Combinatorial Optimization AISTATS 2025 Anytime Acceleration of Gradient Descent COLT 2025 Anytime-Constrained Equilibria in Polynomial Time ICML 2025 A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization ICML 2025 A Parametric Contextual Online Learning Theory of Brokerage ICML 2025 APLOT: Robust Reward Modeling via Adaptive Preference Learning with Optimal Transport EMNLP 2025 A Plug-and-Play Bregman ADMM Module for Inferring Event Branches in Temporal Point Processes AAAI 2025 Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear Programming ICLR 2025 A Polynomial-time Algorithm for Online Sparse Linear Regression with Improved Regret Bound under Weaker Conditions COLT 2025 A Pontryagin Perspective on Reinforcement Learning L4DC 2025 App2Exa: Accelerating Exact kNN Search via Dynamic Cache-Guided Approximation IJCAI 2025 Approximate Bilevel Difference Convex Programming for Bayesian Risk Markov Decision Processes AAAI 2025 Approximate Differential Privacy of the ℓ_2 Mechanism ICML 2025 Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees ICML 2025 Approximate Lifted Model Construction IJCAI 2025 Approximate State Abstraction for Markov Games AAAI 2025 Approximate Thompson Sampling for Learning Linear Quadratic Regulators with O(√T) Regret L4DC 2025 Approximating Metric Magnitude of Point Sets AAAI 2025 Approximating Optimal Labelings for Temporal Connectivity AAAI 2025 Approximation algorithms for combinatorial optimization with predictions ICLR 2025 A Primal-dual Perspective for Distributed TD-learning IJCAI 2025 A-PSRO: A Unified Strategy Learning Method with Advantage Metric for Normal-form Games ICML 2025 Are all models wrong? Fundamental limits in distribution-free empirical model falsification COLT 2025 A Reduction-Based Algorithm for the Clique Interdiction Problem IJCAI 2025 Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching ACL 2025