MS student, University of Pavia
1 paper at NeurIPS 2025
We present algorithms with optimal sample complexity and running time for estimating a high dimensional Euclidean mean.