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)
Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract)
AAAI 2022
Bandit Data-Driven Optimization for Crowdsourcing Food Rescue Platforms
AAAI 2022
Bandit Limited Discrepancy Search and Application to Machine Learning Pipeline Optimization
AAAI 2022
Bandits for Structure Perturbation-Based Black-Box Attacks To Graph Neural Networks With Theoretical Guarantees
CVPR 2022
Bandit Theory and Thompson Sampling-Guided Directed Evolution for Sequence Optimization
NeurIPS 2022
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit
IJCAI 2022
Basis Matters: Better Communication-Efficient Second Order Methods for Federated Learning
AISTATS 2022
Batch Bayesian Optimization on Permutations using the Acquisition Weighted Kernel
NeurIPS 2022
Batched Dueling Bandits
ICML 2022
Batch Greenkhorn Algorithm for Entropic-Regularized Multimarginal Optimal Transport: Linear Rate of Convergence and Iteration Complexity
ICML 2022
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
NeurIPS 2022
Bayesian Change-Point Detection for Bandit Feedback
in Non-stationary Environments
ACML 2022
Bayesian Continuous-Time Tucker Decomposition
ICML 2022
Bayesian Optimization over Discrete and Mixed Spaces via Probabilistic Reparameterization
NeurIPS 2022
Bayesian Optimization over Permutation Spaces
AAAI 2022
Bayesian Optimization under Stochastic Delayed Feedback
ICML 2022
Bayesian quantile and expectile optimisation
UAI 2022
Bending Graphs: Hierarchical Shape Matching Using Gated Optimal Transport
CVPR 2022
Benefits of Permutation-Equivariance in Auction Mechanisms
NeurIPS 2022
Best Arm Identification with Safety Constraints
AISTATS 2022
Best Heuristic Identification for Constraint Satisfaction
IJCAI 2022
Best of Both Worlds Model Selection
NeurIPS 2022
Better Best of Both Worlds Bounds for Bandits with Switching Costs
NeurIPS 2022
Better Parameter-Free Stochastic Optimization with ODE Updates for Coin-Betting
AAAI 2022
Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness
NeurIPS 2022