Two New Families of Local Asymptotically Minimax Lower Bounds in Parameter Estimation
Neri Merhav, Raúl Alcaraz, Luca Faes, Leandro Pardo, Boris Ryabko · 2024
Read Two New Families of Local Asymptotically Minimax Lower Bounds in Parameter Estimation by Neri Merhav, Raúl Alcaraz, Luca Faes, Leandro Pardo, Boris Ryabko (2024) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-11592794.txt.
Description
Neri Merhav and co-authors propose two new families of lower bounds on how well any estimator can pin down an unknown parameter, in this 2024 paper. Lower bounds tell engineers when to stop chasing impossible accuracy. The first family covers any estimator judged by a convex, symmetric error cost; the second targets the moments of the error.
The bounds ask little of the underlying probability model and stay local, hugging the true parameter's neighborhood. They are also cheap to compute, needing optimization over only a few helper numbers. Across many test cases they beat older bounds of similar effort, sometimes by a wide margin. The first family extends cleanly to several parameters at once.
Catalog record
| CREATOR | Neri Merhav, Raúl Alcaraz, Luca Faes, Leandro Pardo, Boris Ryabko |
|---|---|
| YEAR | 2024 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 53 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |