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)
The Unusual Effectiveness of Averaging in GAN Training
ICLR 2019
The Value Function Polytope in Reinforcement Learning
ICML 2019
The Variational Predictive Natural Gradient
ICML 2019
Thinning for Accelerating the Learning of Point Processes
NeurIPS 2019
Thompson Sampling and Approximate Inference
NeurIPS 2019
Thompson Sampling Guided Stochastic Searching on the Line for Deceptive Environments with Applications to Root-Finding Problems
JMLR 2019
Thompson Sampling on Symmetric Alpha-Stable Bandits
IJCAI 2019
Thompson Sampling with Information Relaxation Penalties
NeurIPS 2019
Three Mechanisms of Weight Decay Regularization
ICLR 2019
Three-quarter Sibling Regression for Denoising Observational Data
IJCAI 2019
Thresholding Bandit with Optimal Aggregate Regret
NeurIPS 2019
Tight analyses for non-smooth stochastic gradient descent
COLT 2019
Tight Dimension Independent Lower Bound on the Expected Convergence Rate for Diminishing Step Sizes in SGD
NeurIPS 2019
Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds
ICML 2019
Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel k-means Clustering
ICML 2019
Tight Lower Bounds on the VC-dimension of Geometric Set Systems
JMLR 2019
Tightness-Aware Evaluation Protocol for Scene Text Detection
CVPR 2019
Tight Sample Complexity of Learning One-hidden-layer Convolutional Neural Networks
NeurIPS 2019
TIGS: An Inference Algorithm for Text Infilling with Gradient Search
ACL 2019
Time/Accuracy Tradeoffs for Learning a ReLU with respect to Gaussian Marginals
NeurIPS 2019
Time Matters in Regularizing Deep Networks: Weight Decay and Data Augmentation Affect Early Learning Dynamics, Matter Little Near Convergence
NeurIPS 2019
Time to Frequency Domain Mapping of the Voice Source: The Influence of Open Quotient and Glottal Skew on the Low End of the Source Spectrum
Interspeech 2019
Tiresias: A GPU Cluster Manager for Distributed Deep Learning
NSDI 2019
T-Net: Parametrizing Fully Convolutional Nets With a Single High-Order Tensor
CVPR 2019
To Annotate or Not? Predicting Performance Drop under Domain Shift
EMNLP 2019