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)
Robust Non-linear Normalization of Heterogeneous Feature Distributions with Adaptive Tanh-Estimators
AISTATS 2024
Robust Reinforcement Learning with General Utility
NeurIPS 2024
Robust Reward Placement under Uncertainty
IJCAI 2024
Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination
ICML 2024
Robust Sparse Regression with Non-Isotropic Designs
NeurIPS 2024
Robust Sparse Voting
AISTATS 2024
Robust variance-regularized risk minimization with concomitant scaling
AISTATS 2024
Roping in Uncertainty: Robustness and Regularization in Markov Games
ICML 2024
Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
AAAI 2024
Runtime Analysis of the (μ + 1) GA: Provable Speed-Ups from Strong Drift towards Diverse Populations
AAAI 2024
Safe and Efficient: A Primal-Dual Method for Offline Convex CMDPs under Partial Data Coverage
NeurIPS 2024
Safe and Robust Subgame Exploitation in Imperfect Information Games
ICML 2024
Safe and Sparse Newton Method for Entropic-Regularized Optimal Transport
NeurIPS 2024
Safe dynamic pricing for nonstationary network resource allocation
L4DC 2024
Safe Linear Bandits over Unknown Polytopes
COLT 2024
Safe online convex optimization with multi-point feedback
L4DC 2024
Safe Time-Varying Optimization based on Gaussian Processes with Spatio-Temporal Kernel
NeurIPS 2024
Sample-and-Bound for Non-convex Optimization
AAAI 2024
Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models
NeurIPS 2024
Sample Average Approximation for Black-Box Variational Inference
UAI 2024
Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut
NeurIPS 2024
Sample Complexity of Posted Pricing for a Single Item
NeurIPS 2024
Sample-Constrained Black Box Optimization for Audio Personalization
AAAI 2024
Sample-efficient Bayesian Optimisation Using Known Invariances
NeurIPS 2024
Sample-Efficient Constrained Reinforcement Learning with General Parameterization
NeurIPS 2024