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)

Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion ICML 2023 Optimal Regret Is Achievable with Bounded Approximate Inference Error: An Enhanced Bayesian Upper Confidence Bound Framework NeurIPS 2023 Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems AISTATS 2023 Optimal Sample Complexity Bounds for Non-convex Optimization under Kurdyka-Lojasiewicz Condition AISTATS 2023 Optimal Scoring Rules for Multi-dimensional Effort COLT 2023 Optimal Seat Arrangement: What Are the Hard and Easy Cases? IJCAI 2023 Optimal Shrinkage for Distributed Second-Order Optimization ICML 2023 Optimal Sketching Bounds for Sparse Linear Regression AISTATS 2023 Optimal Sparse Regression Trees AAAI 2023 Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion ICML 2023 Optimal Time Complexities of Parallel Stochastic Optimization Methods Under a Fixed Computation Model NeurIPS 2023 Optimal Transport for Unsupervised Hallucination Detection in Neural Machine Translation ACL 2023 Optimal Transport Model Distributional Robustness NeurIPS 2023 Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization ICML 2023 Optimistic Planning by Regularized Dynamic Programming ICML 2023 Optimistic Whittle Index Policy: Online Learning for Restless Bandits AAAI 2023 Optimization for Amortized Inverse Problems ICML 2023 Optimization of Inter-group criteria for clustering with minimum size constraints NeurIPS 2023 Optimization or Architecture: How to Hack Kalman Filtering NeurIPS 2023 Optimizing Multiple Simultaneous Objectives for Voting and Facility Location AAAI 2023 Optimizing NOTEARS Objectives via Topological Swaps ICML 2023 Optimizing over trained GNNs via symmetry breaking NeurIPS 2023 Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization NeurIPS 2023 Oracle-Efficient Smoothed Online Learning for Piecewise Continuous Decision Making COLT 2023 Oracle-free Reinforcement Learning in Mean-Field Games along a Single Sample Path AISTATS 2023