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)

Improved Approximation Algorithms for Clustered TSP and Subgroup Planning AAAI 2025 Improved Approximation Ratio for Strategyproof Facility Location on a Cycle IJCAI 2025 Improved Bounds for Online Facility Location with Predictions AAAI 2025 Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants AAAI 2025 Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization ICML 2025 Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves ICML 2025 Improved Lower Bounds for First-order Stochastic Non-convex Optimization under Markov Sampling ICML 2025 Improved Margin Generalization Bounds for Voting Classifiers COLT 2025 Improved Maximin Share Approximations for Chores by Bin Packing AAAI 2025 Improved MMS Approximations for Few Agent Types IJCAI 2025 Improved Online Confidence Bounds for Multinomial Logistic Bandits ICML 2025 Improved Rank Aggregation Under Fairness Constraint IJCAI 2025 Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance ICML 2025 Improved Regret Bounds for Online Fair Division with Bandit Learning AAAI 2025 Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization ICML 2025 Improving Community-Participated Patrol for Anti-Poaching AAAI 2025 Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization ICLR 2025 Improving Generalization in Federated Learning with Highly Heterogeneous Data via Momentum-Based Stochastic Controlled Weight Averaging ICML 2025 Improving Generalization with Flat Hilbert Bayesian Inference ICML 2025 Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks AAAI 2025 Improving Stochastic Cubic Newton with Momentum AISTATS 2025 Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT AAAI 2025 Inapproximability of Optimal Multi-Agent Pathfinding Problems AAAI 2025 Incentives for Early Arrival in Cooperative Games (Extended Abstract) IJCAI 2025 In-Context Linear Regression Demystified: Training Dynamics and Mechanistic Interpretability of Multi-Head Softmax Attention ICML 2025