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)
One-Shot Pruning of Recurrent Neural Networks by Jacobian Spectrum Evaluation
ICLR 2020
One Size Fits All: Can We Train One Denoiser for All Noise Levels?
ICML 2020
On Forgetting to Cite Older Papers: An Analysis of the ACL Anthology
ACL 2020
On Generalization Bounds of a Family of Recurrent Neural Networks
AISTATS 2020
On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning
ICLR 2020
On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
ICML 2020
On hyperparameter tuning in general clustering problemsm
ICML 2020
On Importance Sampling-Based Evaluation of Latent Language Models
ACL 2020
On Infinite-Width Hypernetworks
NeurIPS 2020
On Irrelevant Literals in Pseudo-Boolean Constraint Learning
IJCAI 2020
On Joint Estimation of Pose, Geometry and svBRDF From a Handheld Scanner
CVPR 2020
On Learnability wih Computable Learners
ALT 2020
On Learning Ising Models under Huber's Contamination Model
NeurIPS 2020
Online Agnostic Boosting via Regret Minimization
NeurIPS 2020
Online and stochastic optimization beyond Lipschitz continuity: A Riemannian approach
ICLR 2020
On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and Non-Asymptotic Concentration
COLT 2020
Online Bayesian Moment Matching based SAT Solver Heuristics
ICML 2020
Online Bayesian Persuasion
NeurIPS 2020
Online Convex Optimization Over Erdos-Renyi Random Networks
NeurIPS 2020
Online Convex Optimization with Perturbed Constraints: Optimal Rates against Stronger Benchmarks
AISTATS 2020
Online Decision Based Visual Tracking via Reinforcement Learning
NeurIPS 2020
Online Dense Subgraph Discovery via Blurred-Graph Feedback
ICML 2020
Online Domain Adaptation for Occupancy Mapping
RSS 2020
Online Hashing with Efficient Updating of Binary Codes
AAAI 2020
Online Knowledge Distillation via Collaborative Learning
CVPR 2020