arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2111.08253cs.ITmath.IT
收藏

加性噪声信道下通信学习的广义界和算法

Generalization Bounds and Algorithms for Learning to Communicate over Additive Noise Channels

Nir Weinberger

摘要:

考虑了一个加性噪声信道,其中噪声的分布是非参数的和未知的。考虑了基于噪声样本的编码器和解码器的学习问题。对于未编码的通信系统,选择一个码本,也可能是一个广义的最小距离解码器(这是参数化的协方差矩阵)的问题得到解决。提供了误差概率损失函数以及铰链型替代损失函数的高概率泛化界。对后一种损失函数提出了一种基于随机梯度的交替极小化算法。此外,提出了一种基于Gibbs准则的码书压缩算法,该算法从码字中逐步剔除初始码书,以获得具有更高错误概率的较小码书,并给出了该算法的平均经验误差和泛化误差的界以及高概率泛化界.各种实验证明了所提出的算法的性能。对于编码系统,最大化的输入和输出之间的互信息相对于输入分布的问题得到解决,并获得了两个不同类别的输入分布的一致收敛界。

英文摘要:

An additive noise channel is considered, in which the distribution of the noise is nonparametric and unknown. The problem of learning encoders and decoders based on noise samples is considered. For uncoded communication systems, the problem of choosing a codebook and possibly also a generalized minimal distance decoder (which is parameterized by a covariance matrix) is addressed. High probability generalization bounds for the error probability loss function, as well as for a hinge-type surrogate loss function are provided. A stochastic-gradient based alternating-minimization algorithm for the latter loss function is proposed. In addition, a Gibbs-based algorithm that gradually expurgates an initial codebook from codewords in order to obtain a smaller codebook with improved error probability is proposed, and bounds on its average empirical error and generalization error, as well as a high probability generalization bound, are stated. Various experiments demonstrate the performance of the proposed algorithms. For coded systems, the problem of maximizing the mutual information between the input and the output with respect to the input distribution is addressed, and uniform convergence bounds for two different classes of input distributions are obtained.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑