TL;DR
This paper introduces two new classes of mutual information estimators based on k-nearest neighbor entropy estimates, which are data-efficient, adaptive, and unbiased, especially effective for high-dimensional and small-scale structures.
Contribution
The authors develop novel mutual information estimators that outperform traditional binning methods by being more accurate, adaptive, and unbiased, with extensions to multiple variables and practical applications in ICA.
Findings
Estimators become exact for independent distributions, vanishing when variables are independent.
The methods are effective across various marginal distributions and dimensions.
Applications include assessing independence in ICA and improving blind source separation.
Abstract
We present two classes of improved estimators for mutual information , from samples of random points distributed according to some joint probability density . In contrast to conventional estimators based on binnings, they are based on entropy estimates from -nearest neighbour distances. This means that they are data efficient (with we resolve structures down to the smallest possible scales), adaptive (the resolution is higher where data are more numerous), and have minimal bias. Indeed, the bias of the underlying entropy estimates is mainly due to non-uniformity of the density at the smallest resolved scale, giving typically systematic errors which scale as functions of for points. Numerically, we find that both families become {\it exact} for independent distributions, i.e. the estimator vanishes (up to statistical fluctuations) if…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
