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)
Bayesian optimization for automated model selection
NeurIPS 2016
Bayesian optimization for automated model selection
AutoML 2016
Bayesian Optimization for Likelihood-Free Inference of Simulator-Based Statistical Models
JMLR 2016
Bayesian Optimization for Probabilistic Programs
NeurIPS 2016
Bayesian optimization under mixed constraints with a slack-variable augmented Lagrangian
NeurIPS 2016
Bayesian Optimization with a Finite Budget: An Approximate Dynamic Programming Approach
NeurIPS 2016
Bayesian Optimization with Robust Bayesian Neural Networks
NeurIPS 2016
Bayesian Poisson Tucker Decomposition for Learning the Structure of International Relations
ICML 2016
Bayesian Policy Gradient and Actor-Critic Algorithms
JMLR 2016
Bayesian Torrent Classification by File Name and Size Only
PGM 2016
Bayes-Optimal Effort Allocation in Crowdsourcing: Bounds and Index Policies
AISTATS 2016
benefits of depth in neural networks
COLT 2016
Best-of-K-bandits
COLT 2016
Bethe Learning of Graphical Models via MAP Decoding
AISTATS 2016
Better call Saul: Flexible Programming for Learning and Inference in NLP
COLING 2016
Beyond Parity Constraints: Fourier Analysis of Hash Functions for Inference
ICML 2016
Bi-Objective Online Matching and Submodular Allocations
NeurIPS 2016
Bipartite Ranking: a Risk-Theoretic Perspective
JMLR 2016
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits
ICML 2016
Black-Box Alpha Divergence Minimization
ICML 2016
Black-box Optimization with a Politician
ICML 2016
Blazing the trails before beating the path: Sample-efficient Monte-Carlo planning
NeurIPS 2016
Blind Attacks on Machine Learners
NeurIPS 2016
Blind Image Deconvolution by Automatic Gradient Activation
CVPR 2016
Blind Recovery of Perceptual Models in Distributed Speech and Audio Coding
Interspeech 2016