Parameter Estimation of Mutual Information Maximized Channels
Abstract
We study the problem of estimating a parametric discrete memoryless channel \( p(y x; θ) \) when the transmitter selects its input distribution \( π \) to maximize mutual information under the true parameter \( θ* \). Using only i.i.d.\ observations of the channel output, we aim to jointly estimate the capacity-achieving input distribution \( π* \) and the true channel parameter \( θ* \). In general, recovery of \( π* \) and \( θ* \) can be challenging. To that end, we propose two efficient algorithms based on the Blahut--Arimoto (BA) optimality conditions: (i) a bilevel fixed-point method and (ii) an augmented Lagrangian method. Empirical results demonstrate that both proposed algorithms successfully recover the true \( θ* \) and \( π* \), whereas a naive maximum-likelihood approach that ignores the mutual-information maximization constraint fails to do so.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.