Search arXivSearch

arXiv · 2604.21271

Non-Asymptotic Performance Guarantees for MLE under a Gumbel-Softmax Index Model with Phaseless Measurements

Abstract

This paper studies the recovery of a complex-valued signal from index-only observations generated by a phaseless Gumbel-Softmax model. The model is motivated by limited-feedback frequency-division duplex massive MIMO systems, where it provides a smooth probabilistic surrogate for the deterministic hard-PMI selection rule. We consider a constrained maximum likelihood estimator and establish non-asymptotic statistical guarantees for its recovery performance. Under a bounded-design condition, we first derive a global excess-risk bound of order $\sqrt{d/T}$, which does not explicitly depend on the number of candidate indices. A quantitative local identifiability condition is then introduced to characterize the regime in which sharper local guarantees are available. Under this condition, the excess risk and squared parameter error both scale as $d/T$. The condition is further verified with high probability for a Haar--Stiefel random design, and a local minimax lower bound is established that matches the upper bound in its dependence on the sample size, signal dimension, temperature parameter, and signal norm, up to design-dependent factors. Numerical experiments on FDD downlink channel estimation demonstrate that the proposed likelihood-based approach can overall achieve superior reconstruction performance, supporting the effectiveness of the Gumbel-Softmax model as a surrogate for hard PMI feedback.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jinchi Chen, Mingxi Hu, Peigang Jiang, Xin Meng, Ke Wei, Xianyin Zhang. 2026-09-11. Non-Asymptotic Performance Guarantees for MLE under a Gumbel-Softmax Index Model with Phaseless Measurements. https://arxiv.org/abs/2604.21271

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