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)

Basilisk: Using Provenance Invariants to Automate Proofs of Undecidable Protocols OSDI 2025 Batch List-Decodable Linear Regression via Higher Moments ICML 2025 Bayes correlated equilibria, no-regret dynamics in Bayesian games, and the price of anarchy COLT 2025 Bayesian Analysis of Combinatorial Gaussian Process Bandits ICLR 2025 Bayesian Optimization for Unknown Cost-Varying Variable Subsets with No-Regret Costs AAAI 2025 Bayesian Optimization from Human Feedback: Near-Optimal Regret Bounds ICML 2025 Bayesian Optimization over Bounded Domains with the Beta Product Kernel UAI 2025 Bayesian Optimization with Inexact Acquisition: Is Random Grid Search Sufficient? UAI 2025 Bayesian Persuasion with Externalities: Exploiting Agent Types AAAI 2025 Beehive: A Scalable Disaggregated Memory Runtime Exploiting Asynchrony of Multithreaded Programs NSDI 2025 Benefits of Early Stopping in Gradient Descent for Overparameterized Logistic Regression ICML 2025 Best of Both Worlds: Regret Minimization versus Minimax Play ICML 2025 Best Subset Selection: Optimal Pursuit for Feature Selection and Elimination ICML 2025 Better Understandings and Configurations in MaxSAT Stochastic Local Search Solvers via Anytime Performance Analysis AAAI 2025 Beyond Discretization: Learning the Optimal Solution Path AISTATS 2025 Beyond Low-rankness: Guaranteed Matrix Recovery via Modified Nuclear Norm IJCAI 2025 Beyond Mandatory Federations: Balancing Egoism, Utilitarianism and Egalitarianism in Mixed-Motive Games AAAI 2025 Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity ICML 2025 Beyond Monotonicity: On the Convergence of Learning Algorithms in Standard Auction Games AAAI 2025 Beyond propagation of chaos: A stochastic algorithm for mean field optimization COLT 2025 Beyond Self-Interest: How Group Strategies Reshape Content Creation in Recommendation Platforms? ICML 2025 Beyond Size-Based Metrics: Measuring Task-Specific Complexity in Symbolic Regression AISTATS 2025 Beyond Worst-Case Dimensionality Reduction for Sparse Vectors ICLR 2025 Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks COLT 2025 Bilevel Reinforcement Learning via the Development of Hyper-gradient without Lower-Level Convexity AISTATS 2025