Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913003147886592 |
|---|---|
| author | Lau, Ivan Scarlett, Jonathan |
| author_facet | Lau, Ivan Scarlett, Jonathan |
| contents | In this paper, we study the problem of distributed mean estimation with 1-bit communication constraints. We propose a mean estimator that is based on (randomized and sequentially-chosen) interval queries, whose 1-bit outcome indicates whether the given sample lies in the specified interval. Our estimator is $(ε, δ)$-PAC for all distributions with bounded mean ($-λ\le \mathbb{E}(X) \le λ$) and variance ($\mathrm{Var}(X) \le σ^2$) for some known parameters $λ$ and $σ$. We derive a sample complexity bound $\widetilde{O}\big( \frac{σ^2}{ε^2}\log\frac{1}δ + \log\fracλσ\big)$, which matches the minimax lower bound for the unquantized setting up to logarithmic factors and the additional $\log\fracλσ$ term that we show to be unavoidable. We also establish an adaptivity gap for interval-query based estimators: the best non-adaptive mean estimator is considerably worse than our adaptive mean estimator for large $\fracλσ$. Finally, we give tightened sample complexity bounds for distributions with stronger tail decay, and present additional variants that (i) handle an unknown sampling budget (ii) adapt to the unknown true variance given (possibly loose) upper and lower bounds on the variance, and (iii) use only two stages of adaptivity at the expense of more complicated (non-interval) queries. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_21940 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity Lau, Ivan Scarlett, Jonathan Machine Learning Information Theory Statistics Theory In this paper, we study the problem of distributed mean estimation with 1-bit communication constraints. We propose a mean estimator that is based on (randomized and sequentially-chosen) interval queries, whose 1-bit outcome indicates whether the given sample lies in the specified interval. Our estimator is $(ε, δ)$-PAC for all distributions with bounded mean ($-λ\le \mathbb{E}(X) \le λ$) and variance ($\mathrm{Var}(X) \le σ^2$) for some known parameters $λ$ and $σ$. We derive a sample complexity bound $\widetilde{O}\big( \frac{σ^2}{ε^2}\log\frac{1}δ + \log\fracλσ\big)$, which matches the minimax lower bound for the unquantized setting up to logarithmic factors and the additional $\log\fracλσ$ term that we show to be unavoidable. We also establish an adaptivity gap for interval-query based estimators: the best non-adaptive mean estimator is considerably worse than our adaptive mean estimator for large $\fracλσ$. Finally, we give tightened sample complexity bounds for distributions with stronger tail decay, and present additional variants that (i) handle an unknown sampling budget (ii) adapt to the unknown true variance given (possibly loose) upper and lower bounds on the variance, and (iii) use only two stages of adaptivity at the expense of more complicated (non-interval) queries. |
| title | Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity |
| topic | Machine Learning Information Theory Statistics Theory |
| url | https://arxiv.org/abs/2509.21940 |