Metraipolis › archive › dc_0963a1d198ff
Instance-Optimal Adaptive Location Estimation via Multiscale Mid-Summaries — arXiv:2609.20749
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20749
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T04:15:57.712Z
- SHA-256 of the archived text
5ecdfc28c1ad91b15629e224f86644e1cc7723e95aeb75fbff9ee8f38fdcf03a- Stable URL of this page
https://metraipolis.com/documento/dc_0963a1d198ff
How to cite
Instance-Optimal Adaptive Location Estimation via Multiscale Mid-Summaries — arXiv:2609.20749 — arXiv (en), https://arxiv.org/abs/2609.20749 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0963a1d198ff (Metraipolis archive dc_0963a1d198ff, sha256 5ecdfc28c1ad91b15629e224f86644e1cc7723e95aeb75fbff9ee8f38fdcf03a)
BibTeX
@misc{dc0963a1d198ff,
title = {Instance-Optimal Adaptive Location Estimation via Multiscale Mid-Summaries — arXiv:2609.20749},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20749},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0963a1d198ff; sha256 5ecdfc28c1ad91b15629e224f86644e1cc7723e95aeb75fbff9ee8f38fdcf03a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20749. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Location estimation exhibits markedly different finite-sample behavior across noise distributions: regular families typically yield root-\(n\) rates, whereas compactly supported laws may admit faster, boundary-driven rates. We question whether a single estimator, without knowledge of the density's shape, can adapt to the instance-wise optimal estimation rate, as an oracle that knows the underlying location family can. For a known location family with symmetric log-concave noise density \(f\), the optimal location estimation error with sample size \(n\) under failure probability \(\delta\) is known to be Le Cam's two-point rate: \[ \sup\left\{r>0:\mathsf{H}^2\left(f_0, f_{2r}\right)\lesssim \frac{\log(1/\delta)}{n}\right\}. \] When the location family is unknown, we propose a shape-agnostic estimator that attains this oracle benchmark simultaneously over all symmetric unimodal densities with non-decreasing hazard rates, a class strictly broader than symmetric log-concave distributions. We establish that the Hellinger-driven two-point rate can be characterized solely by a multiscale function of dyadic quantile gaps. This new structural connection between Hellinger divergence and quantile geometry motivates a simple estimation procedure that aggregates sample mid-summaries with carefully designed data-dependent weights. The resulting estimator is finite-sample instance-optimal and runs in only \(O(\log(n))\) time on sorted samples.
Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-18 in stat.ML).
Categorie arXiv: Statistics Theory (math.ST) ; Methodology (stat.ME); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2609.20749 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T04:02:52.989Z dalla pagina https://arxiv.org/catchup/stat.ML/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).