Theory
5,579 papers
Papers per year
1
2
3
3
9
4
32
25
33
25
39
38
47
78
67
80
103
156
267
383
486
592
713
822
805
612
154
2000
'5
'10
'15
'20
'25
Papers
Predictive PAC Learning and Process Decompositions
NeurIPS 2013
Projecting Ising Model Parameters for Fast Mixing
NeurIPS 2013
Rectangling Stereographic Projection for Wide-Angle Image Visualization
ICCV 2013
Regret based Robust Solutions for Uncertain Markov Decision Processes
NeurIPS 2013
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima
NeurIPS 2013
Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel
NeurIPS 2013
Robust Low Rank Kernel Embeddings of Multivariate Distributions
NeurIPS 2013
Scoring Workers in Crowdsourcing: How Many Control Questions are Enough?
NeurIPS 2013
Sharp Generalization Error Bounds for Randomly-projected Classifiers
ICML 2013
Stochastic Gradient Descent for Non-smooth Optimization: Convergence Results and Optimal Averaging Schemes
ICML 2013
The Fast Convergence of Incremental PCA
NeurIPS 2013
The Sample-Complexity of General Reinforcement Learning
ICML 2013
Top-Down Segmentation of Non-rigid Visual Objects Using Derivative-Based Search on Sparse Manifolds
CVPR 2013
Transition Matrix Estimation in High Dimensional Time Series
ICML 2013
Uncertainty-Driven Efficiently-Sampled Sparse Graphical Models for Concurrent Tumor Segmentation and Atlas Registration
ICCV 2013
Understanding variable importances in forests of randomized trees
NeurIPS 2013
Unsupervised Spectral Learning of Finite State Transducers
NeurIPS 2013
When are Overcomplete Topic Models Identifiable? Uniqueness of Tensor Tucker Decompositions with Structured Sparsity
NeurIPS 2013
Active Learning of Multi-Index Function Models
NeurIPS 2012
A Geometric Approach to Sample Compression
JMLR 2012
Algebraic Geometric Comparison of Probability Distributions
JMLR 2012
A new metric on the manifold of kernel matrices with application to matrix geometric means
NeurIPS 2012
A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound
NeurIPS 2012
Attribute-Efficient Learning andWeight-Degree Tradeoffs for Polynomial Threshold Functions
COLT 2012
Classification Calibration Dimension for General Multiclass Losses
NeurIPS 2012