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)

Synthesis and Analysis of Data as Probability Measures With Entropy-Regularized Optimal Transport AISTATS 2025 Synthesizing Composite Hierarchical Structure from Symbolic Music Corpora IJCAI 2025 Tab-Shapley: Identifying Top-k Tabular Data Quality Insights AAAI 2025 Taking a Big Step: Large Learning Rates in Denoising Score Matching Prevent Memorization COLT 2025 Tamed Langevin sampling under weaker conditions AISTATS 2025 Temperature-Annealed Boltzmann Generators ICML 2025 Temporal Difference Learning: Why It Can Be Fast and How It Will Be Faster ICLR 2025 Temporal Fair Division AAAI 2025 Temporal Logic Control for Nonlinear Stochastic Systems Under Unknown Disturbances L4DC 2025 Tensor Network Based Feature Learning Model AISTATS 2025 Tensor Network-Constrained Kernel Machines as Gaussian Processes AISTATS 2025 Tensor-Var: Efficient Four-Dimensional Variational Data Assimilation ICML 2025 Testing Juntas and Junta Subclasses with Relative Error COLT 2025 The Adaptive Complexity of Finding a Stationary Point COLT 2025 The Batch Complexity of Bandit Pure Exploration ICML 2025 The Benefits and Limitations of User Interrupts for Preemptive Userspace Scheduling NSDI 2025 The Butterfly Effect: Neural Network Training Trajectories Are Highly Sensitive to Initial Conditions ICML 2025 The Complexity of Extending Fair Allocations of Indivisible Goods AAAI 2025 The Complexity of Two-Team Polymatrix Games with Independent Adversaries ICLR 2025 The Computational Complexity of Positive Non-Clashing Teaching in Graphs ICLR 2025 The Cost Perspective of Liquid Democracy: Feasibility and Control AAAI 2025 The Curse of Conditions: Analyzing and Improving Optimal Transport for Conditional Flow-Based Generation ICCV 2025 The Dimension Strikes Back with Gradients: Generalization of Gradient Methods in Stochastic Convex Optimization ALT 2025 The Distortion of Public-Spirited Participatory Budgeting AAAI 2025 The (Exact) Price of Cardinality for Indivisible Goods: A Parametric Perspective AAAI 2025