conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Statistical Learning

4,117 papers

Papers per year

9
62
100
382
192
'05
'10
'15
'20
'25

Papers

Local Privacy and Minimax Bounds: Sharp Rates for Probability Estimation NIPS 2013
Convex Relaxations for Permutation Problems NIPS 2013
A Comparative Framework for Preconditioned Lasso Algorithms NIPS 2013
Fantope Projection and Selection: A near-optimal convex relaxation of sparse PCA NIPS 2013
Statistical Active Learning Algorithms NIPS 2013
Near-optimal Anomaly Detection in Graphs using Lovasz Extended Scan Statistic NIPS 2013
Sensor Selection in High-Dimensional Gaussian Trees with Nuisances NIPS 2013
Dirty Statistical Models NIPS 2013
More data speeds up training time in learning halfspaces over sparse vectors NIPS 2013
Small-Variance Asymptotics for Hidden Markov Models NIPS 2013
Model Selection for High-Dimensional Regression under the Generalized Irrepresentability Condition NIPS 2013
B-test: A Non-parametric, Low Variance Kernel Two-sample Test NIPS 2013
Moment-based Uniform Deviation Bounds for $k$-means and Friends NIPS 2013
Spectral methods for neural characterization using generalized quadratic models NIPS 2013
PAC-Bayes-Empirical-Bernstein Inequality NIPS 2013
Statistical analysis of coupled time series with Kernel Cross-Spectral Density operators. NIPS 2013
Confidence Intervals and Hypothesis Testing for High-Dimensional Statistical Models NIPS 2013
Stochastic blockmodel approximation of a graphon: Theory and consistent estimation NIPS 2013
On the Sample Complexity of Subspace Learning NIPS 2013
Speeding up Permutation Testing in Neuroimaging NIPS 2013
Learning Hidden Markov Models from Non-sequence Data via Tensor Decomposition NIPS 2013
Scoring Workers in Crowdsourcing: How Many Control Questions are Enough? NIPS 2013
Cluster Trees on Manifolds NIPS 2013
Generalized Method-of-Moments for Rank Aggregation NIPS 2013
Density estimation from unweighted k-nearest neighbor graphs: a roadmap NIPS 2013