Optimization & Theory
43,292 papers (3 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Optimization (17,731)
Learning Theory (6,809)
Bayesian Inference (6,267)
Theory (5,579)
Statistical Learning (4,564)
Neural Network Optimization (4,155)
Stochastic Processes (2,948)
Stochastic Methods (1,283)
Loss Functions (1,220)
Distributed Learning (1,202)
Online Algorithms (1,013)
Statistics (822)
Generalization (376)
Information Theory (370)
Sample Complexity (282)
Sparse Optimization (241)
Game Theory (151)
Convex Optimization (132)
Optimal Transport (104)
Robust Optimization (84)
Distributed Optimization (73)
Approximation Algorithms (33)
Papers per year
1
14
29
44
31
52
189
195
212
235
352
382
457
787
816
828
1,066
1,391
1,913
3,012
3,646
4,303
4,450
5,357
6,155
5,854
1,521
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
On the universality of deep learning
NeurIPS 2020
On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness
ICML 2020
On the Value of Out-of-Distribution Testing: An Example of Goodhart's Law
NeurIPS 2020
On the Variance of the Adaptive Learning Rate and Beyond
ICLR 2020
On the weak link between importance and prunability of attention heads
EMNLP 2020
On Thompson Sampling for Smoother-than-Lipschitz Bandits
AISTATS 2020
On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm
ICML 2020
On Uniform Convergence and Low-Norm Interpolation Learning
NeurIPS 2020
On Universal Equivariant Set Networks
ICLR 2020
On Validation and Planning of An Optimal Decision Rule with Application in Healthcare Studies
ICML 2020
On Warm-Starting Neural Network Training
NeurIPS 2020
Opening the Black Box: Automatically Characterizing Software for Algorithm Selection (Student Abstract)
AAAI 2020
Open Problem: Fast and Optimal Online Portfolio Selection
COLT 2020
Open Problem: Information Complexity of VC Learning
COLT 2020
Open Problem: Model Selection for Contextual Bandits
COLT 2020
Open Problem: Tight Convergence of SGD in Constant Dimension
COLT 2020
Opportunistic Decoding with Timely Correction for Simultaneous Translation
ACL 2020
Optimal $δ$-Correct Best-Arm Selection for Heavy-Tailed Distributions
ALT 2020
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization
JMLR 2020
Optimal Algorithms for Stochastic Multi-Armed Bandits with Heavy Tailed Rewards
NeurIPS 2020
Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization
NeurIPS 2020
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions
NeurIPS 2020
Optimal Attack against Autoregressive Models by Manipulating the Environment
AAAI 2020
Optimal Auction Based Automated Negotiation in Realistic Decentralised Market Environments
AAAI 2020
Optimal Bipartite Network Clustering
JMLR 2020