SOURCE-LINKED INTELLIGENCE

Instance-Optimal Adaptive Location Estimation via Multiscale Mid-Summaries

arXiv · AI, language, vision and robotics · article · Sep 17, 2026 · UTC

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 \(δ\) is known

Read original source ↗ Open in workspace

recordType

paper

region

Global