A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang

TL;DR
This paper presents a straightforward polynomial-time algorithm to approximate the total variation distance between two product distributions, addressing a fundamental problem in probability and statistics.
Contribution
The paper introduces a novel, simple polynomial-time algorithm for approximating total variation distance between product distributions, improving computational efficiency.
Findings
Algorithm runs in polynomial time
Achieves accurate approximation of total variation distance
Simplifies previous approaches to the problem
Abstract
We give a simple polynomial-time approximation algorithm for the total variation distance between two product distributions.
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
TopicsBayesian Methods and Mixture Models · Algorithms and Data Compression · Machine Learning and Algorithms
