A Training-Based Mutual Information Lower Bound for Large-Scale Systems
Xiangbo Meng, Kang Gao, Bertrand M. Hochwald

TL;DR
This paper introduces a new mutual information lower bound for large-scale systems that leverages derivatives of conditional entropy, enabling analysis of training effects without explicit parameter estimation.
Contribution
It presents a novel mutual information lower bound applicable to large-scale systems that does not require explicit estimation of unknown parameters.
Findings
The bound can be computed using derivatives of a conditional entropy function.
It provides a practical step-by-step process for calculating the bound.
Comparison with classical bounds demonstrates its effectiveness.
Abstract
We provide a mutual information lower bound that can be used to analyze the effect of training in models with unknown parameters. For large-scale systems, we show that this bound can be calculated using the difference between two derivatives of a conditional entropy function. The bound does not require explicit estimation of the unknown parameters. We provide a step-by-step process for computing the bound, and provide an example application. A comparison with known classical mutual information bounds is provided.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Gene Regulatory Network Analysis
