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)

A Unified Convergence Analysis for Shuffling-Type Gradient Methods JMLR 2021 A unified framework for bandit multiple testing NeurIPS 2021 A Unified Framework for Planning with Learned Neural Network Transition Models AAAI 2021 AutoBandit: A Meta Bandit Online Learning System IJCAI 2021 Automated Mechanism Design for Classification with Partial Verification AAAI 2021 Automated Reasoning and Learning for Automated Payroll Management AAAI 2021 Automatic and Harmless Regularization with Constrained and Lexicographic Optimization: A Dynamic Barrier Approach NeurIPS 2021 Automatic Design of Heuristic Algorithms for Binary Optimization Problems IJCAI 2021 Automatic Optimal Multi-Agent Path Finding Algorithm Selector (Student Abstract) AAAI 2021 Automatic Text Evaluation through the Lens of Wasserstein Barycenters EMNLP 2021 A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization ICML 2021 Average-Case Communication Complexity of Statistical Problems COLT 2021 Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent NeurIPS 2021 A Wasserstein Minimax Framework for Mixed Linear Regression ICML 2021 A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization ICML 2021 Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings AAAI 2021 BANANAS: Bayesian Optimization with Neural Architectures for Neural Architecture Search AAAI 2021 Bandit Convex Optimization in Non-stationary Environments JMLR 2021 Bandit Learning in Decentralized Matching Markets JMLR 2021 Bandit Linear Optimization for Sequential Decision Making and Extensive-Form Games AAAI 2021 Bandit Phase Retrieval NeurIPS 2021 Bandits with Knapsacks beyond the Worst Case NeurIPS 2021 Batched Thompson Sampling NeurIPS 2021 Batch greedy maximization of non-submodular functions: Guarantees and applications to experimental design JMLR 2021 Batch Multi-Fidelity Bayesian Optimization with Deep Auto-Regressive Networks NeurIPS 2021