← Optimization & Theory
Machine Learning › Optimization & Theory ›

Statistical Learning

4076 directly classified papers

Papers per year

Papers

A DNN-HMM Approach to Story Segmentation INTERSPEECH 2016
Inference for High-dimensional Exponential Family Graphical Models AISTATS 2016
ARET — Automatic Reading of Educational Texts for Visually Impaired Students INTERSPEECH 2016
More Supervision, Less Computation: Statistical-Computational Tradeoffs in Weakly Supervised Learning NIPS 2016
L2 Acquisition and Production of the English Rhotic Pharyngeal Gesture INTERSPEECH 2016
Hyperarticulated Production of Korean Glides by Age Group INTERSPEECH 2016
An equivalence between high dimensional Bayes optimal inference and M-estimation NIPS 2016
The Power of Adaptivity in Identifying Statistical Alternatives NIPS 2016
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence JMLR 2016
The Discourse Marker “so” in Turn-Taking and Turn-Releasing Behavior INTERSPEECH 2016
Bipartite Ranking: a Risk-Theoretic Perspective JMLR 2016
A Statistical Perspective on Randomized Sketching for Ordinary Least-Squares JMLR 2016
Semiparametric Differential Graph Models NIPS 2016
Learning and Forecasting Opinion Dynamics in Social Networks NIPS 2016
Accurate Robust and Efficient Error Estimation for Decision Trees ICML 2016
Bootstrap Model Aggregation for Distributed Statistical Learning NIPS 2016
Learning and Testing Junta Distributions COLT 2016
Finite-Sample Analysis of Fixed-k Nearest Neighbor Density Functional Estimators NIPS 2016
Structure-Blind Signal Recovery NIPS 2016
Consistent Kernel Mean Estimation for Functions of Random Variables NIPS 2016
Preterm Birth Prediction: Stable Selection of Interpretable Rules from High Dimensional Data MLHC 2016
Minimax Estimation of Maximum Mean Discrepancy with Radial Kernels NIPS 2016
Learning Additive Exponential Family Graphical Models via $\ell_{2,1}$-norm Regularized M-Estimation NIPS 2016
On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching JMLR 2016
Data-driven Rank Breaking for Efficient Rank Aggregation JMLR 2016