← Optimization & Theory
Machine Learning › Optimization & Theory ›

Statistical Learning

4076 directly classified papers

Papers per year

Papers

Variable Importance Using Decision Trees NIPS 2017
Certified Defenses for Data Poisoning Attacks NIPS 2017
Identification and Model Testing in Linear Structural Equation Models using Auxiliary Variables ICML 2017
Predicting with Distributions COLT 2017
Differentially Private Chi-squared Test by Unit Circle Mechanism ICML 2017
Deeply AggreVaTeD: Differentiable Imitation Learning for Sequential Prediction ICML 2017
Robust and Proper Learning for Mixtures of Gaussians via Systems of Polynomial Inequalities COLT 2017
Noisy Population Recovery from Unknown Noise COLT 2017
Passive Realtime Datacenter Fault Detection and Localization NSDI 2017
Statistical and Computational Guarantees for the Baum-Welch Algorithm JMLR 2017
Consistency Analysis for Binary Classification Revisited ICML 2017
Being Robust (in High Dimensions) Can Be Practical ICML 2017
Statistical Inference for Incomplete Ranking Data: The Case of Rank-Dependent Coarsening ICML 2017
Meritocratic Fairness for Cross-Population Selection ICML 2017
Algorithmic Stability and Hypothesis Complexity ICML 2017
Identifying Best Interventions through Online Importance Sampling ICML 2017
Sample complexity of population recovery COLT 2017
Empirical Risk Minimization for Stochastic Convex Optimization: $O(1/n)$- and $O(1/n^2)$-type of Risk Bounds COLT 2017
High-Dimensional Structured Quantile Regression ICML 2017
Selective Inference for Sparse High-Order Interaction Models ICML 2017
Rational Distortions of Learners’ Linguistic Input CONLL 2017
On the Distribution of Lexical Features at Multiple Levels of Analysis ACL 2017
Sparse + Group-Sparse Dirty Models: Statistical Guarantees without Unreasonable Conditions and a Case for Non-Convexity ICML 2017
Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions NIPS 2017
Regularization and the small-ball method II: complexity dependent error rates JMLR 2017