论文标题

关于信息瓶颈问题:模型,连接,应用和信息理论观点

On the Information Bottleneck Problems: Models, Connections, Applications and Information Theoretic Views

论文作者

Zaidi, Abdellatif, Aguerri, Inaki Estella, Shamai, Shlomo

论文摘要

本教程论文重点介绍了瓶颈问题的变体,以了解信息理论观点,并讨论了解决该信息的实用方法,以及它与编码和学习方面的联系。在对数损耗扭曲度量,信息组合,共同重建,Wyner-Ahlswede-Korner问题,投资信息的效率以及概括,变异推理,表示,自动编码器等下,这种设置与对数损耗扭曲度量,信息组合,常见重建,通用重建,通用重建,通用重建,wyner-ahlswede-korner问题的紧密连接的密切联系。我们讨论了它扩展到分布式信息瓶颈问题,重点是高斯模型,并突出了与上行链接云无线电访问网络(CRAN)的基本连接,并通过遗忘的处理。对于此模型,确定了离散和矢量高斯框架中相关性(即信息)和复杂性(即汇率)之间的最佳权衡。在总结的前景中,提到了一些有趣的问题,例如在功率限制下的最佳输入(“功能”)分布的表征,从而最大程度地提高了高斯信息瓶颈的“相关性”,并在“复杂性”约束下。

This tutorial paper focuses on the variants of the bottleneck problem taking an information theoretic perspective and discusses practical methods to solve it, as well as its connection to coding and learning aspects. The intimate connections of this setting to remote source-coding under logarithmic loss distortion measure, information combining, common reconstruction, the Wyner-Ahlswede-Korner problem, the efficiency of investment information, as well as, generalization, variational inference, representation learning, autoencoders, and others are highlighted. We discuss its extension to the distributed information bottleneck problem with emphasis on the Gaussian model and highlight the basic connections to the uplink Cloud Radio Access Networks (CRAN) with oblivious processing. For this model, the optimal trade-offs between relevance (i.e., information) and complexity (i.e., rates) in the discrete and vector Gaussian frameworks is determined. In the concluding outlook, some interesting problems are mentioned such as the characterization of the optimal inputs ("features") distributions under power limitations maximizing the "relevance" for the Gaussian information bottleneck, under "complexity" constraints.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源