Search arXiv⌕ Search

arXiv · 2610.15549

Rate-Distortion Theory of Gaussian Mixtures via Posterior Label Sampling

Abstract

We study the mean-squared error (MSE) rate-distortion function (RDF) of finite Gaussian mixture models (GMMs) in $\mathbb{R}^d$, for which neither the RDF nor an optimal test channel is known in closed form. It can be sandwiched between the genie-aided conditional RDF $R_{\mathbf{X} | T}(D)$, which can be characterized in closed-form for a GMM, and $R_{\mathbf{X} | T}(D)+I(\mathbf{X};T)$, where $T$ denotes the latent component label. We show that the upper bound can be achieved operationally by the proposed Gibbs-relabelling method (GRM), which conveys a label from the posterior $P_{T|\mathbf{X}}$ through \textit{channel simulation} at rate $I(\mathbf{X};T)$, followed by vector quantization of the resulting exactly Gaussian conditional sources by reverse water-filling. Using the Shannon lower bound (SLB), we prove that GRM attains the SLB, and hence the RDF, of a general finite mixture if and only if every component attains its own SLB. For a GMM this holds throughout the fully active interval $D/d<\min_{k,m}λ_{k,m}$, where $λ_{k,m}$ are the eigenvalues of the component covariances, and for scalar GMMs the condition is also necessary. Since GRM cannot operate below the label cost $I(\mathbf{X};T)$, we propose a complementary stochastic scalar quantization (SSQ) scheme for low rates, which simulates an $M$-ary reconstruction index. We show that at low rates SSQ with $M\geq 2$ matches the Shannon RDF to first order: $R(D_{\max}-δ)=δ/(2τ^2)+o(δ)$, where $τ^2$ is a directional sub-Gaussian proxy of the mixture, and quantify the price of a finite codebook through a strict rate gap at high rates and a distortion floor whose joint scaling in $M$ and number of mixture components is characterized. Numerical results illustrate both regimes and the finite-blocklength cost of channel simulation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Weichen Wang, Deniz Gündüz. 2026-10-11. Rate-Distortion Theory of Gaussian Mixtures via Posterior Label Sampling. https://arxiv.org/abs/2610.15549

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

KEEP EXPLORING

Related papers

Quasi-twisted codes and their connection with additive constacyclic codes over finite fields

In this paper, we study quasi-twisted codes and their relationship with additive constacyclic codes through a polynomial-based approach. We first present a polynomial characterization of quasi-twisted codes over finite fields analogous to quasi-cyclic codes and determine Euclidean, Hermitian, and symplectic duals of quasi-twisted codes with index $2$. Additionally, we provide necessary and sufficient conditions for the self-orthogonality of appropriate quasi-twisted codes. Next, we explore a one-to-one correspondence between quasi-twisted codes of length $lm$ with index $l$ over $\mathbb{F}_q$ and additive constacyclic codes of length $m$ over $\mathbb{F}_{q^l}$. We establish relationships between trace inner products in the additive setting and Euclidean, symplectic inner products in the quasi-twisted setting. Using these relations and the correspondence, we determine the dual of additive constacyclic codes with respect to the trace inner products. As a consequence, we conclude that determining the trace Euclidean dual and trace Hermitian dual of an additive constacyclic code is equivalent to determining the Euclidean and symplectic dual of the corresponding quasi-twisted code.

cs.IT↗

Performance Analysis of Pinching Antenna Systems Enabled NOMA Communications

Pinching antenna systems (PASS) have the advantages in the perspective of flexible antenna reconfiguration, line-of-sight (LoS) creation, and scalability features. To highlight the ascendancy of PASS, we survey the integration of PASS into non-orthogonal multiple access (NOMA) networks. The locations of nodes are randomly distributed within a circular coverage region. The influencing factors of line-of-sight (LoS) and non-line-of-sight (NLoS) propagation links from PASS to non-orthogonal nodes are taken into considered. To characterize performance of PASS-NOMA, we deduce the blockage probability and ergodic data rates expressions of two nodes over LoS/NLoS fading channels. In light of these theoretical results, the infinite diversity gain are also analyzed with near node n under non-ideal successive interference cancellation (NISIC) and far node f over LoS links. The slopes of ergodic data rate for node n with NISIC and node f were equal to zeros. In addition, the PASS-NOMA system throughput are evaluated in different transmission modes. It is shown from the numerical results that: 1) The blockage outage behaviors of PASS-NOMA networks with LoS/NLoS conditions outperform that of PASS aided traditional orthogonal multiple access (OMA); 2)The employment of PASS enables the larger ergodic data rates relative to PASS-OMA networks; and 3) As the quantity of pinching antennas rises, the performance of PASS-NOMA networks are enhanced over LoS/NLoS propagation links.

cs.IT↗

Deriving Approximate Message Passing from the Convex Gaussian Min-Max Theorem

Approximate message passing (AMP) provides fast iterative algorithms for high-dimensional signal recovery with Gaussian design matrices, while the Convex Gaussian Min--max Theorem (CGMT) gives a static optimization framework for obtaining sharp asymptotic characterizations of convex estimators. Although these two frameworks often lead to the same scalar state-evolution equations, their connection is usually indirect. In this paper, we establish a direct connection between the two for regularized linear regression in the proportional high-dimensional regime. When the CGMT Auxiliary Optimization (AO) and Primary Optimization (PO) give the same primal-dual solution, we show that the CGMT framework recovers the AMP fixed-point equations, including the Onsager correction. We further identify the AO Gaussian vectors with the Gaussian perturbations in the primal and residual AMP channels. For regularized $M$-estimation, the same viewpoint recovers the fixed point of scalar-variance max-sum Generalized AMP (GAMP). These results show that the AMP (and GAMP) fixed-point equations can be recovered from the CGMT framework and may suggest AMP-like algorithms in settings where standard derivations are unavailable.

cs.IT↗