English

Total Variation Distance Meets Probabilistic Inference

Data Structures and Algorithms 2024-07-02 v2 Computational Complexity Discrete Mathematics Machine Learning

Abstract

In this paper, we establish a novel connection between total variation (TV) distance estimation and probabilistic inference. In particular, we present an efficient, structure-preserving reduction from relative approximation of TV distance to probabilistic inference over directed graphical models. This reduction leads to a fully polynomial randomized approximation scheme (FPRAS) for estimating TV distances between same-structure distributions over any class of Bayes nets for which there is an efficient probabilistic inference algorithm. In particular, it leads to an FPRAS for estimating TV distances between distributions that are defined over a common Bayes net of small treewidth. Prior to this work, such approximation schemes only existed for estimating TV distances between product distributions. Our approach employs a new notion of partialpartial couplings of high-dimensional distributions, which might be of independent interest.

Keywords

Cite

@article{arxiv.2309.09134,
  title  = {Total Variation Distance Meets Probabilistic Inference},
  author = {Arnab Bhattacharyya and Sutanu Gayen and Kuldeep S. Meel and Dimitrios Myrisiotis and A. Pavan and N. V. Vinodchandran},
  journal= {arXiv preprint arXiv:2309.09134},
  year   = {2024}
}

Comments

25 pages. This work has been accepted for presentation at the International Conference on Machine Learning (ICML) 2024

R2 v1 2026-06-28T12:23:48.906Z