arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2111.12166cs.ITcs.LGmath.ITstat.ML
收藏

率失真函数的经验夹层界

Towards Empirical Sandwich Bounds on the Rate-Distortion Function

UC Irvine(加州大学欧文分校)

Yibo Yang, Stephan Mandt

摘要:

率失真(R-D)函数是信息论中的一个重要量,它描述了在满足保真度要求的前提下,任何压缩算法对数据源的压缩程度的基本极限。随着研究人员不断提高压缩性能,建立给定数据源的R-D函数不仅具有科学意义,而且还揭示了改进压缩算法的可能空间。以前关于这个问题的工作依赖于对数据源的分布假设(Gibson,2017)或仅适用于离散数据(Blahut,1972; Arimoto,1972)。相比之下,本文首次尝试了一种算法,用于计算一般(不一定是离散的)源的R-D函数,只需要i.i.d.。数据样本。我们在远远超出任何已知方法的可行性的设置中估计了各种人工和真实世界数据源的R-D三明治界限,并阐明了神经数据压缩的最优性(Ballé等人,2021年; Yang等人,2022年)。我们对自然图像的R-D上限表明,在各种比特率下,最先进的图像压缩方法的PSNR至少有一个dB的理论空间。我们的数据和代码可以在https://github.com/mandt-lab/empirical-RD-sandwich上找到。

英文摘要:

Rate-distortion (R-D) function, a key quantity in information theory, characterizes the fundamental limit of how much a data source can be compressed subject to a fidelity criterion, by any compression algorithm. As researchers push for ever-improving compression performance, establishing the R-D function of a given data source is not only of scientific interest, but also sheds light on the possible room for improving compression algorithms. Previous work on this problem relied on distributional assumptions on the data source (Gibson, 2017) or only applied to discrete data (Blahut, 1972; Arimoto, 1972). By contrast, this paper makes the first attempt at an algorithm for sandwiching the R-D function of a general (not necessarily discrete) source requiring only i.i.d. data samples. We estimate R-D sandwich bounds for a variety of artificial and real-world data sources, in settings far beyond the feasibility of any known method, and shed light on the optimality of neural data compression (Ballé et al., 2021; Yang et al., 2022). Our R-D upper bound on natural images indicates theoretical room for improving state-of-the-art image compression methods by at least one dB in PSNR at various bitrates. Our data and code can be found at https://github.com/mandt-lab/empirical-RD-sandwich.

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

↑