Abstract
AbstractThe study of finite approximations of probability measures has a long history. In Xu and Berger (2017), the authors focused on constrained finite approximations and, in particular, uniform ones in dimensiond=1. In the present paper we give an elementary construction of a uniform decomposition of probability measures in dimensiond≥1. We then use this decomposition to obtain upper bounds on the rate of convergence of the optimal uniform approximation error. These bounds appear to be the generalization of the ones obtained by Xu and Berger (2017) and to be sharp for generic probability measures.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference19 articles.
1. Zador P. (1963). Development and evaluation of procedures for quantizing multivariate distributions. Tech. Rep. Stanford University.
2. Chen Y. , Welling M. and Smola A. (2012). Super-samples from kernel herding. Preprint. Available at http://arxiv.org/abs/1203.3472.
3. Quantitative Concentration Inequalities for Empirical Measures on Non-compact Spaces
4. Asymptotic quantization error of continuous signals and the quantization dimension
5. Random Bit Quadrature and Approximation of Distributions on Hilbert Spaces
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献