Asymptotic local uniformity of the quantization error for Ahlfors-David probability measures
Sanguo Zhu

TL;DR
This paper studies the asymptotic behavior of quantization errors for Ahlfors-David measures, showing that certain error-related quantities decay at a rate proportional to n^{-(1+r/s_0)} as the number of quantization points increases.
Contribution
It establishes the asymptotic uniformity of the quantization error distribution for Ahlfors-David measures, extending prior results to a broader class of measures.
Findings
Quantization error decreases at rate n^{-(1+r/s_0)}.
Error difference between successive quantizations is of the same order as the minimal quantization error.
Uniformity of local quantization errors is proven for Ahlfors-David measures.
Abstract
Let be an Ahlfors-David probability measure on , namely, there exist some constants and such that \[ C_1\epsilon^{s_0}\leq\mu(B(x,\epsilon))\leq C_2\epsilon^{s_0},\;\epsilon\in(0,\epsilon_0),\;x\in{\rm supp}(\mu). \] For , let be an -optimal set for of order and an arbitrary Voronoi partition with respect to . The th quantization error for of order is given by . Write \[ I_a(\alpha,\mu):=\int_{P_a(\alpha_n)}d(x,\alpha_n)^rd\mu(x),\;a\in\alpha_n. \] We prove that, , and the error difference are of the same order as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Compression Techniques · Stochastic processes and financial applications · Mathematical Analysis and Transform Methods
