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)
Learning to Identify Top Elo Ratings: A Dueling Bandits Approach
AAAI 2022
Learning to Plan Variable Length Sequences of Actions with a Cascading Bandit Click Model of User Feedback
AISTATS 2022
Learning to Reach, Swim, Walk and Fly in One Trial: Data-Driven Control with Scarce Data and Side Information
L4DC 2022
Learning to Re-weight Examples with Optimal Transport for Imbalanced Classification
NeurIPS 2022
Learning to Search in Local Branching
AAAI 2022
Learning To Solve Hard Minimal Problems
CVPR 2022
Learning to Solve PDE-constrained Inverse Problems with Graph Networks
ICML 2022
Learning to Solve Routing Problems via Distributionally Robust Optimization
AAAI 2022
Learning with Interactive Models over
Decision-Dependent Distributions
ACML 2022
Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets
NeurIPS 2022
Least Squares Estimation using Sketched Data with Heteroskedastic Errors
ICML 2022
Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence
JMLR 2022
Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time
ICML 2022
Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions
NeurIPS 2022
Lexicographic Multi-Objective Reinforcement Learning
IJCAI 2022
Lifted Division for Lifted Hugin Belief Propagation
AISTATS 2022
Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization
AISTATS 2022
Lightweight Projective Derivative Codes for Compressed Asynchronous Gradient Descent
ICML 2022
Linear Bandit Algorithms with Sublinear Time Complexity
ICML 2022
Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs
ICML 2022
Lipschitz Bandits with Batched Feedback
NeurIPS 2022
LMGP: Lifted Multicut Meets Geometry Projections for Multi-Camera Multi-Object Tracking
CVPR 2022
Local and Global Convergence of General Burer-Monteiro Tensor Optimizations
AAAI 2022
Local and Global Linear Convergence of General Low-Rank Matrix Recovery Problems
AAAI 2022
Local Bayesian optimization via maximizing probability of descent
NeurIPS 2022