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)

Implicit Regularization and Entrywise Convergence of Riemannian Optimization for Low Tucker-Rank Tensor Completion JMLR 2023 Implicit Regularization Leads to Benign Overfitting for Sparse Linear Regression ICML 2023 Importance Sparsification for Sinkhorn Algorithm JMLR 2023 Improved Algorithm for Regret Ratio Minimization in Multi-Objective Submodular Maximization AAAI 2023 Improved Algorithms for Allen's Interval Algebra by Dynamic Programming with Sublinear Partitioning IJCAI 2023 Improved Algorithms for Maximum Satisfiability and Its Special Cases AAAI 2023 Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback ICML 2023 Improved Algorithms for Stochastic Linear Bandits Using Tail Bounds for Martingale Mixtures NeurIPS 2023 Improved Algorithms for White-Box Adversarial Streams ICML 2023 Improved Best-of-Both-Worlds Guarantees for Multi-Armed Bandits: FTRL with General Regularizers and Multiple Optimal Arms NeurIPS 2023 Improved Convergence in High Probability of Clipped Gradient Methods with Heavy Tailed Noise NeurIPS 2023 Improved dimension dependence of a proximal algorithm for sampling COLT 2023 Improved Discretization Analysis for Underdamped Langevin Monte Carlo COLT 2023 Improved Dynamic Regret for Online Frank-Wolfe COLT 2023 Improved Frequency Estimation Algorithms with and without Predictions NeurIPS 2023 Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation AISTATS 2023 Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs ALT 2023 Improved Kernel Alignment Regret Bound for Online Kernel Learning AAAI 2023 Improved Learning-Augmented Algorithms for the Multi-Option Ski Rental Problem via Best-Possible Competitive Analysis ICML 2023 Improved Online Conformal Prediction via Strongly Adaptive Online Learning ICML 2023 Improved Online Learning Algorithms for CTR Prediction in Ad Auctions ICML 2023 Improved Powered Stochastic Optimization Algorithms for Large-Scale Machine Learning JMLR 2023 Improved Rate of First Order Algorithms for Entropic Optimal Transport AISTATS 2023 Improving Pareto Front Learning via Multi-Sample Hypernetworks AAAI 2023 Improving the Knowledge Gradient Algorithm NeurIPS 2023