Mean Estimation with Sub-Gaussian Rates in Polynomial Time

Mean Estimation with Sub-Gaussian Rates in Polynomial Time

Neyman Seminar
Feb 27, 2019, 04:00 PM - 05:00 PM | 1011 Evans Hall | Happening As Scheduled
Sam Hopkins, UC Berkeley
We study polynomial time algorithms for estimating the mean of a heavy-tailed multivariate random vector. We assume only that the random vector X has finite mean and covariance. In this setting, the radius of confidence intervals achieved by the empirical mean are large compared to the case that X is Gaussian or sub-Gaussian. We offer the first polynomial time algorithm to estimate the mean with...