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

大字母表概率分布的高效表示

Efficient Representation of Large-Alphabet Probability Distributions

Aviv Adler, Jennifer Tang, Yury Polyanskiy

AI总结:

本文提出在量化前应用非线性压扩器f(x)来高效表示大字母表概率分布,理论证明基于ArcSinh的压扩器在KL散度下达到近极小极大最优,显著优于均匀量化和浮点表示。

摘要:

许多工程和科学问题需要表示和操作大字母表上的概率分布,我们可以将其视为和为1的长实数向量。在某些情况下,需要用每项仅b比特来表示这样的向量。一种自然的选择是将区间[0,1]划分为2^b个均匀区间,并将每项独立量化到各个区间。我们证明了对该过程进行微小修改——在量化前应用逐项非线性函数(压扩器)f(x)——能产生一种极其有效的量化方法。例如,对于b=8(16)和10^5大小的字母表,表示质量从0.5(0.1)比特/项的损失(在KL散度下)提升至10^-4(10^-9)比特/项。与浮点表示相比,我们的压扩器方法将损失从10^-1(10^-6)提升至10^-4(10^-9)比特/项。这些数值适用于真实世界数据(书籍中的词频和DNA k-mer计数)以及合成随机生成的分布。在理论上,我们建立了极小极大最优性准则,并证明压扩器f(x) ∝ ArcSinh(√((1/2)(K log K)x))实现了近最优性能,对于K字母表和b→∞,达到了asymp 2^-2b log^2 K的KL量化损失。有趣的是,针对超立方体上二次损失的类似极小极大准则表明了标准均匀量化器的最优性。这表明ArcSinh量化器对于KL失真而言,如同均匀量化器对于二次失真一样基础。

英文摘要:

A number of engineering and scientific problems require representing and manipulating probability distributions over large alphabets, which we may think of as long vectors of reals summing to $1$. In some cases it is required to represent such a vector with only $b$ bits per entry. A natural choice is to partition the interval $[0,1]$ into $2^b$ uniform bins and quantize entries to each bin independently. We show that a minor modification of this procedure -- applying an entrywise non-linear function (compander) $f(x)$ prior to quantization -- yields an extremely effective quantization method. For example, for $b=8 (16)$ and $10^5$-sized alphabets, the quality of representation improves from a loss (under KL divergence) of $0.5 (0.1)$ bits/entry to $10^{-4} (10^{-9})$ bits/entry. Compared to floating point representations, our compander method improves the loss from $10^{-1}(10^{-6})$ to $10^{-4}(10^{-9})$ bits/entry. These numbers hold for both real-world data (word frequencies in books and DNA $k$-mer counts) and for synthetic randomly generated distributions. Theoretically, we set up a minimax optimality criterion and show that the compander $f(x) ~\propto~ \mathrm{ArcSinh}(\sqrt{(1/2) (K \log K) x})$ achieves near-optimal performance, attaining a KL-quantization loss of $\asymp 2^{-2b} \log^2 K$ for a $K$-letter alphabet and $b\to \infty$. Interestingly, a similar minimax criterion for the quadratic loss on the hypercube shows optimality of the standard uniform quantizer. This suggests that the $\mathrm{ArcSinh}$ quantizer is as fundamental for KL-distortion as the uniform quantizer for quadratic distortion.

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

↑