Search arXivSearch

arXiv · 2604.25106

Relaxation Kernel, Spectral Dissipation, and Global Convergence of Blahut--Arimoto Dynamics

Abstract

We develop a spectral theory for continuous- and discrete-time Blahut--Arimoto (BA) dynamics, centered on the relaxation kernel $ \G = \E_p[K^*_X \otimes K^*_X] $. Five main results are established. (i) Along the continuous-time BA flow, the free energy satisfies the exact $ χ^2 $-dissipation identity $ \dot F_β= -\D(q) $, where $ \D(q)=χ^2(\T q \| q) $ is the Pearson $ χ^2 $-divergence. (ii) The operator $ \G $ admits a threefold identity: it is simultaneously the Gram matrix of the equilibrium Gibbs kernels, the linearised generator of the BA vector field, and the Fisher--Rao Hessian of the free energy at the fixed point. (iii) For the discrete iteration, the one-step Lyapunov dissipation decomposes spectrally as $ Δ\mathcal{L}^{(2)} = \sum_i c_i^2\, d(λ_i) $, where $ d(λ) = -λ+ \tfrac{3}{2}λ^2 - \tfrac{1}{2}λ^3 $. This reveals a double bottleneck at $ λ\approx 0 $ and $ λ\approx 1 $, with optimal dissipation near $ λ\approx 0.423 $. (iv) Global convergence follows a two-stage mechanism: $ χ^2 $-dissipation drives finite-time entry into a local neighbourhood, after which the spectral gap $ \lam = λ_{\min}(\G|_T) $ governs exponential contraction. (v) The KL convergence factor is explicit: $ \KL(q^*\|q_{n+1}) \le (1-\lam)^2\,\KL(q^*\|q_n) + O(\|v_n\|_*^3) $, with per-iteration improvement $ γ= \lam(2-\lam) $. For Gaussian sources, $ \lam = 1/(2βσ^2) $ and the Jacobian is diagonalised by Hermite polynomials. The spectral formula complements Hayashi's global convergence theory with a constructive, computable local rate.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qiao Wang. 2026-05-30. Relaxation Kernel, Spectral Dissipation, and Global Convergence of Blahut--Arimoto Dynamics. https://arxiv.org/abs/2604.25106

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT