Skip to content

A Generative Cramér-Rao Bound

arxiv.org
1 pointhasley1 comment
On HN

Comments

The Cramér-Rao Bound (CRB) lets one compute the minimal mean-squared error that any unbiased estimator (algorithm) can achieve. Unfortunately, you need to know the probability density function (PDF) to compute the CRB. This work proposes a way to overcome this drawback. Maybe with this, the CRB gains more attention in the machine learning community - or even as much attention as it gets in the parameter estimation community.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.