Simple and Optimal Sublinear Algorithms for Mean Estimation
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909824208338944 |
|---|---|
| author | Bertolotti, Beatrice Russo, Matteo Schwiegelshohn, Chris Shyam, Sudarshan |
| author_facet | Bertolotti, Beatrice Russo, Matteo Schwiegelshohn, Chris Shyam, Sudarshan |
| contents | We study the sublinear multivariate mean estimation problem in $d$-dimensional Euclidean space. Specifically, we aim to find the mean $μ$ of a ground point set $A$, which minimizes the sum of squared Euclidean distances of the points in $A$ to $μ$. We first show that a multiplicative $(1+\varepsilon)$ approximation to $μ$ can be found with probability $1-δ$ using $O(\varepsilon^{-1}\log δ^{-1})$ many independent uniform random samples, and provide a matching lower bound. Furthermore, we give two estimators with optimal sample complexity that can be computed in optimal running time for extracting a suitable approximate mean:
1. The coordinate-wise median of $\log δ^{-1}$ sample means of sample size $\varepsilon^{-1}$. As a corollary, we also show improved convergence rates for this estimator for estimating means of multivariate distributions.
2. The geometric median of $\log δ^{-1}$ sample means of sample size $\varepsilon^{-1}$. To compute a solution efficiently, we design a novel and simple gradient descent algorithm that is significantly faster for our specific setting than all other known algorithms for computing geometric medians.
In addition, we propose an order statistics approach that is empirically competitive with these algorithms, has an optimal sample complexity and matches the running time up to lower order terms.
We finally provide an extensive experimental evaluation among several estimators which concludes that the geometric-median-of-means-based approach is typically the most competitive in practice. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_05254 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Simple and Optimal Sublinear Algorithms for Mean Estimation Bertolotti, Beatrice Russo, Matteo Schwiegelshohn, Chris Shyam, Sudarshan Data Structures and Algorithms We study the sublinear multivariate mean estimation problem in $d$-dimensional Euclidean space. Specifically, we aim to find the mean $μ$ of a ground point set $A$, which minimizes the sum of squared Euclidean distances of the points in $A$ to $μ$. We first show that a multiplicative $(1+\varepsilon)$ approximation to $μ$ can be found with probability $1-δ$ using $O(\varepsilon^{-1}\log δ^{-1})$ many independent uniform random samples, and provide a matching lower bound. Furthermore, we give two estimators with optimal sample complexity that can be computed in optimal running time for extracting a suitable approximate mean: 1. The coordinate-wise median of $\log δ^{-1}$ sample means of sample size $\varepsilon^{-1}$. As a corollary, we also show improved convergence rates for this estimator for estimating means of multivariate distributions. 2. The geometric median of $\log δ^{-1}$ sample means of sample size $\varepsilon^{-1}$. To compute a solution efficiently, we design a novel and simple gradient descent algorithm that is significantly faster for our specific setting than all other known algorithms for computing geometric medians. In addition, we propose an order statistics approach that is empirically competitive with these algorithms, has an optimal sample complexity and matches the running time up to lower order terms. We finally provide an extensive experimental evaluation among several estimators which concludes that the geometric-median-of-means-based approach is typically the most competitive in practice. |
| title | Simple and Optimal Sublinear Algorithms for Mean Estimation |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2406.05254 |