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)

Online Certification of Preference-Based Fairness for Personalized Recommender Systems (Extended Abstract) IJCAI 2023 Online Clustering of Bandits with Misspecified User Models NeurIPS 2023 Online Constrained Meta-Learning: Provable Guarantees for Generalization NeurIPS 2023 Online Control for Meta-optimization NeurIPS 2023 Online Convex Optimization with Unbounded Memory NeurIPS 2023 Online estimation of similarity matrices with incomplete data UAI 2023 Online Heavy-tailed Change-point detection UAI 2023 Online Hyperparameter Optimization for Class-Incremental Learning AAAI 2023 Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization NeurIPS 2023 Online k-means Clustering on Arbitrary Data Streams ALT 2023 Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms NeurIPS 2023 Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback AISTATS 2023 Online Learning for Obstacle Avoidance CoRL 2023 Online Learning for Traffic Routing under Unknown Preferences AISTATS 2023 Online Learning Guided Curvature Approximation: A Quasi-Newton Method with Global Non-Asymptotic Superlinear Convergence COLT 2023 Online Learning in Dynamically Changing Environments COLT 2023 Online Learning in Stackelberg Games with an Omniscient Follower ICML 2023 Online learning of long-range dependencies NeurIPS 2023 Online Learning under Adversarial Nonlinear Constraints NeurIPS 2023 Online Learning with Feedback Graphs: The True Shape of Regret ICML 2023 Online Linearized LASSO AISTATS 2023 Online List Labeling with Predictions NeurIPS 2023 Online Mechanism Design for Information Acquisition ICML 2023 Online Model Adaptation with Feedforward Compensation CoRL 2023 Online (Multinomial) Logistic Bandit: Improved Regret and Constant Computation Cost NeurIPS 2023