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 learning in bandits with predicted context
AISTATS 2024
Online Learning in Betting Markets: Profit versus Prediction
ICML 2024
Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints
ICML 2024
Online Learning in Contextual Second-Price Pay-Per-Click Auctions
AISTATS 2024
Online Learning of Delayed Choices
NeurIPS 2024
Online Learning of Partitions in Additively Separable Hedonic Games
IJCAI 2024
Online Learning under Budget and ROI Constraints via Weak Adaptivity
ICML 2024
Online Learning with Bounded Recall
ICML 2024
Online Learning with Off-Policy Feedback in Adversarial MDPs
IJCAI 2024
Online Learning with Sublinear Best-Action Queries
NeurIPS 2024
Online Linear Regression in Dynamic Environments via Discounting
ICML 2024
Online Markov Decision Processes Configuration with Continuous Decision Space
AAAI 2024
Online Matrix Completion: A Collaborative Approach with Hott Items
ICML 2024
Online Newton Method for Bandit Convex Optimisation Extended Abstract
COLT 2024
Online Non-convex Learning in Dynamic Environments
NeurIPS 2024
Online non-parametric likelihood-ratio estimation by Pearson-divergence functional minimization
AISTATS 2024
Online Policy Optimization in Unknown Nonlinear Systems
COLT 2024
Online Recommendations for Agents with Discounted Adaptive Preferences
ALT 2024
Online Resource Allocation with Non-Stationary Customers
ICML 2024
Online Sampling and Decision Making with Low Entropy
IJCAI 2024
Online Stackelberg Optimization via Nonlinear Control
COLT 2024
Online Submodular Maximization via Adaptive Thresholds
IJCAI 2024
Online Submodular Maximization via Online Convex Optimization
AAAI 2024
Online Variational Sequential Monte Carlo
ICML 2024
Online Weighted Paging with Unknown Weights
NeurIPS 2024