Pith. sign in

REVIEW 1 cited by

Neural Entropic Estimation: A faster path to mutual information estimation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1905.12957 v2 pith:IWU7RSRA submitted 2019-05-30 cs.IT cs.LGmath.IT

classification cs.ITcs.LGmath.IT
keywords distributionestimationconvergencefasterinformationmutualreferenceentropy
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We point out a limitation of the mutual information neural estimation (MINE) where the network fails to learn at the initial training phase, leading to slow convergence in the number of training iterations. To solve this problem, we propose a faster method called the mutual information neural entropic estimation (MI-NEE). Our solution first generalizes MINE to estimate the entropy using a custom reference distribution. The entropy estimate can then be used to estimate the mutual information. We argue that the seemingly redundant intermediate step of entropy estimation allows one to improve the convergence by an appropriate reference distribution. In particular, we show that MI-NEE reduces to MINE in the special case when the reference distribution is the product of marginal distributions, but faster convergence is possible by choosing the uniform distribution as the reference distribution instead. Compared to the product of marginals, the uniform distribution introduces more samples in low-density regions and fewer samples in high-density regions, which appear to lead to an overall larger gradient for faster convergence.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Lower Bounds on the MMSE of Adversarially Inferring Sensitive Features

    stat.ML 2025-05 conditional novelty 5.0 of 10

    The paper establishes finite-sample lower bounds on the true MMSE of sensitive feature inference, expressed as empirical MSE minus finite-sample and approximation error terms, with closed-form approximation bounds for...

Pith tools