PRITLGSTDec 12, 2022

Lower Bounds for the Total Variation Distance Given Means and Variances of Distributions

arXiv:2212.05820v24 citationsh-index: 6
Originality Incremental advance
AI Analysis

This work addresses a fundamental statistical problem for researchers in probability theory and machine learning, offering incremental theoretical advances in bounding distribution distances.

The paper tackles the problem of bounding the total variation distance between probability distributions when only means and variances are known, providing lower bounds for arbitrary measures in d-dimensional space and a tight bound in the one-dimensional case.

For arbitrary two probability measures on real d-space with given means and variances (covariance matrices), we provide lower bounds for their total variation distance. In the one-dimensional case, a tight bound is given.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes