arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.12924math.PRmath.OC
收藏

测度的最优经验量化的渐近性

Asymptotics for Optimal Empirical Quantization of Measures

Filippo Quattrocchi

AI总结:

本文研究在 $p$-Wasserstein 距离下用有限均匀测度逼近一般概率测度的最小误差,建立了 $1\le p<d$ 时的渐近上下界与极限存在性,确定了紧支撑测度的收敛速度,并给出了新的 Pierce 型非渐近上界估计。

摘要:

我们研究在具有给定基数 $n$ 的有限集上,用均匀测度逼近 $\mathbb{R}^d$ 上的一般概率测度 $μ$ 的最小误差。该误差以 $p$-Wasserstein 距离来衡量。特别地,当 $1\le p<d$ 时,我们建立了重标度最小误差在 $n \to \infty$ 时的渐近上下界,二者对 $μ$ 具有相同的显式依赖关系。在某些情形下,我们证明了重标度最小误差存在极限。这些情形包括 $d = 2$ 且 $1 \le p < 2$ 时的一般测度,以及任意维度 $d$ 且 $1 \le p < d$ 时的均匀测度。对于某些均匀测度,我们还证明了 $p \ge d$ 时极限的存在性。对于一类具有 Hölder 密度的紧支撑测度,我们确定了所有 $p \ge 1$ 时最小误差的收敛速度。此外,当 $1 \le p < d$ 时,我们建立了一个新的 Pierce 型(即非渐近的)最小误差上界估计。在开头几节中,我们综述了当前的研究现状,并将其与经典量化和随机量化等类似问题进行了联系。

英文摘要:

We investigate the minimal error in approximating a general probability measure $μ$ on $\mathbb{R}^d$ by the uniform measure on a finite set with prescribed cardinality $n$. The error is measured in the $p$-Wasserstein distance. In particular, when $1\le p<d$, we establish asymptotic upper and lower bounds as $n \to \infty$ on the rescaled minimal error that have the same, explicit dependency on $μ$. In some instances, we prove that the rescaled minimal error has a limit. These include general measures in dimension $d = 2$ with $1 \le p < 2$, and uniform measures in arbitrary dimension with $1 \le p < d$. For some uniform measures, we prove the limit existence for $p \ge d$ as well. For a class of compactly supported measures with Hölder densities, we determine the convergence speed of the minimal error for every $p \ge 1$. Furthermore, we establish a new Pierce-type (i.e., nonasymptotic) upper estimate of the minimal error when $1 \le p < d$. In the initial sections, we survey the state of the art and draw connections with similar problems, such as classical and random quantization.

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

↑