Statistical Mean Estimation with Coded Relayed Observations
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912375686299648 |
|---|---|
| author | Ling, Yan Hao Yang, Zhouhao Scarlett, Jonathan |
| author_facet | Ling, Yan Hao Yang, Zhouhao Scarlett, Jonathan |
| contents | We consider a problem of statistical mean estimation in which the samples are not observed directly, but are instead observed by a relay (``teacher'') that transmits information through a memoryless channel to the decoder (``student''), who then produces the final estimate. We consider the minimax estimation error in the large deviations regime, and establish achievable error exponents that are tight in broad regimes of the estimation accuracy and channel quality. In contrast, two natural baseline methods are shown to yield strictly suboptimal error exponents. We initially focus on Bernoulli sources and binary symmetric channels, and then generalize to sub-Gaussian and heavy-tailed settings along with arbitrary discrete memoryless channels. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_09098 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Statistical Mean Estimation with Coded Relayed Observations Ling, Yan Hao Yang, Zhouhao Scarlett, Jonathan Information Theory Machine Learning Statistics Theory We consider a problem of statistical mean estimation in which the samples are not observed directly, but are instead observed by a relay (``teacher'') that transmits information through a memoryless channel to the decoder (``student''), who then produces the final estimate. We consider the minimax estimation error in the large deviations regime, and establish achievable error exponents that are tight in broad regimes of the estimation accuracy and channel quality. In contrast, two natural baseline methods are shown to yield strictly suboptimal error exponents. We initially focus on Bernoulli sources and binary symmetric channels, and then generalize to sub-Gaussian and heavy-tailed settings along with arbitrary discrete memoryless channels. |
| title | Statistical Mean Estimation with Coded Relayed Observations |
| topic | Information Theory Machine Learning Statistics Theory |
| url | https://arxiv.org/abs/2505.09098 |