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)
Shallow vs. Deep Sum-Product Networks
NeurIPS 2011
Shaping Level Sets with Submodular Functions
NeurIPS 2011
Signal Estimation Under Random Time-Warpings and Nonlinear Signal Alignment
NeurIPS 2011
Simultaneous Sampling and Multi-Structure Fitting with Adaptive Reversible Jump MCMC
NeurIPS 2011
Smoothness, Disagreement Coefficient, and the Label Complexity of Agnostic Active Learning
JMLR 2011
SpaRCS: Recovering low-rank and sparse matrices from compressive measurements
NeurIPS 2011
Sparse Bayesian Multi-Task Learning
NeurIPS 2011
Sparse Estimation with Structured Dictionaries
NeurIPS 2011
Sparse Features for PCA-Like Linear Regression
NeurIPS 2011
Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation
NeurIPS 2011
Sparse Linear Identifiable Multivariate Modeling
JMLR 2011
Sparse recovery by thresholded non-negative least squares
NeurIPS 2011
Sparse Recovery with Brownian Sensing
NeurIPS 2011
Sparsity Regret Bounds for Individual Sequences in Online Linear Regression
COLT 2011
Spatial distance dependent Chinese restaurant processes for image segmentation
NeurIPS 2011
Spectral Dimensionality Reduction via Maximum Entropy
AISTATS 2011
Spectral Methods for Learning Multivariate Latent Tree Structure
NeurIPS 2011
Speedy Q-Learning
NeurIPS 2011
Statistical Optimization of Non-Negative Matrix Factorization
AISTATS 2011
Statistical Performance of Convex Tensor Decomposition
NeurIPS 2011
Statistical Tests for Optimization Efficiency
NeurIPS 2011
Stochastic convex optimization with bandit feedback
NeurIPS 2011
Stochastic Methods for -regularized Loss Minimization
JMLR 2011
Structural equations and divisive normalization for energy-dependent component analysis
NeurIPS 2011
Structured sparse coding via lateral inhibition
NeurIPS 2011