Statistical Learning

Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes NeurIPS 2018 Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities COLT 2018 Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model NeurIPS 2018 Nebula: F0 Estimation and Voicing Detection by Modeling the Statistical Properties of Feature Extractors Interspeech 2018 Noise Contrastive Estimation and Negative Sampling for Conditional Models: Consistency and Statistical Efficiency EMNLP 2018 Nonlinear Structured Signal Estimation in High Dimensions via Iterative Hard Thresholding AISTATS 2018 Nonparametric Density Estimation under Adversarial Losses NeurIPS 2018 Nonparametric Sharpe Ratio Function Estimation in Heteroscedastic Regression Models via Convex Optimization AISTATS 2018 Normal Bandits of Unknown Means and Variances JMLR 2018 On Binary Classification in Extreme Regions NeurIPS 2018 On Fast Leverage Score Sampling and Optimal Learning NeurIPS 2018 On how complexity affects the stability of a predictor AISTATS 2018 On Learning Markov Chains NeurIPS 2018 Online Bootstrap Confidence Intervals for the Stochastic Gradient Descent Estimator JMLR 2018 On the Dimensionality of Word Embedding NeurIPS 2018 On the Information Bottleneck Theory of Deep Learning ICLR 2018 On the Stability of Feature Selection Algorithms JMLR 2018 On the Statistical Efficiency of Compositional Nonparametric Prediction AISTATS 2018 On Tight Bounds for the Lasso JMLR 2018 Open problem: Improper learning of mixtures of Gaussians COLT 2018 Open Problem: The Dependence of Sample Complexity Lower Bounds on Planning Horizon COLT 2018 Optimal Cooperative Inference AISTATS 2018 Optimal Quantum Sample Complexity of Learning Algorithms JMLR 2018 Optimal Rates of Sketched-regularized Algorithms for Least-Squares Regression over Hilbert Spaces ICML 2018 Optimal Subsampling with Influence Functions NeurIPS 2018