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 Testing of Samplers
NeurIPS 2020
On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent
JMLR 2020
On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules
IJCAI 2020
On the Convergence of Model Free Learning in Mean Field Games
AAAI 2020
On the Convergence of Nesterov’s Accelerated Gradient Method in Stochastic Settings
ICML 2020
On the Convergence of Stochastic Gradient Descent with Low-Rank Projections for Convex Low-Rank Matrix Problems
COLT 2020
On the Distribution of Minima in Intrinsic-Metric Rotation Averaging
CVPR 2020
On the Enumeration of Association Rules: A Decomposition-based Approach
IJCAI 2020
On the Ergodicity, Bias and Asymptotic Normality of Randomized Midpoint Sampling Method
NeurIPS 2020
On the Expressive Power of Kernel Methods and the Efficiency of Kernel Learning by Association Schemes
ALT 2020
On the interplay between noise and curvature and its effect on optimization and generalization
AISTATS 2020
On the (In)tractability of Computing Normalizing Constants for the Product of Determinantal Point Processes
ICML 2020
On the Max-Min Fair Stochastic Allocation of Indivisible Goods
AAAI 2020
On the Noisy Gradient Descent that Generalizes as SGD
ICML 2020
On the optimality of kernels for high-dimensional clustering
AISTATS 2020
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank
AAAI 2020
On the Power of Compressed Sensing with Generative Models
ICML 2020
On the Problem of Covering a 3-D Terrain
AAAI 2020
On the Robustness of Data-Driven Controllers for Linear Systems
L4DC 2020
On the Role of Sparsity and DAG Constraints for Learning Linear DAGs
NeurIPS 2020
On the Theoretical Guarantees for Parameter Estimation of Gaussian Random Field Models: A Sparse Precision Matrix Approach
JMLR 2020
On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness
ICML 2020
On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm
ICML 2020
Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection
COLT 2020
Open Problem: Fast and Optimal Online Portfolio Selection
COLT 2020