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)
On the Convergence of Stochastic Multi-Objective Gradient Manipulation and Beyond
NeurIPS 2022
On the Convergence Rate of Off-Policy Policy Optimization Methods with Density-Ratio Correction
AISTATS 2022
On the Convergence Theory for Hessian-Free Bilevel Algorithms
NeurIPS 2022
On the Effectiveness of Iterative Learning Control
L4DC 2022
On the Effectiveness of Persistent Homology
NeurIPS 2022
On the Efficiency of Entropic Regularized Algorithms for Optimal Transport
JMLR 2022
On the Finite-Time Complexity and Practical Computation of Approximate Stationarity Concepts of Lipschitz Functions
ICML 2022
On-the-fly adaptation of patrolling strategies in changing environments
UAI 2022
On the Impossibility of Learning to Cooperate with Adaptive Partner Strategies in Repeated Games
ICML 2022
On the Initialization for Convex-Concave Min-max Problems
ALT 2022
On The Memory Complexity of Uniformity Testing
COLT 2022
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization
AISTATS 2022
On the Practical Robustness of the Nesterov’s Accelerated Quasi-Newton Method
AAAI 2022
On the Sample Complexity of Stabilizing LTI Systems on a Single Trajectory
NeurIPS 2022
On the SDEs and Scaling Rules for Adaptive Gradient Algorithms
NeurIPS 2022
On Transportation of Mini-batches: A Hierarchical Approach
ICML 2022
Open Problem: Finite-Time Instance Dependent Optimality for Stochastic Online Learning with Feedback Graphs
COLT 2022
Open Problem: Optimal Best Arm Identification with Fixed-Budget
COLT 2022
Open Problem: Regret Bounds for Noise-Free Kernel-Based Bandits
COLT 2022
Open Problem: Running time complexity of accelerated ℓ_1-regularized PageRank
COLT 2022
Operator-Potential Heuristics for Symbolic Search
AAAI 2022
OpReg-Boost: Learning to Accelerate Online Algorithms with Operator Regression
L4DC 2022
Optimal Accounting of Differential Privacy via Characteristic Function
AISTATS 2022
Optimal Algorithms for Decentralized Stochastic Variational Inequalities
NeurIPS 2022
Optimal Algorithms for Stochastic Multi-Level Compositional Optimization
ICML 2022