Linear time approximation of the TV distance between product distributions

📅 2026-07-29
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the problem of efficiently approximating the total variation (TV) distance between two product distributions. We propose the first approximation algorithm that runs in linear time, achieving a significant improvement over the computational complexity of existing methods. The algorithm leverages structural properties of product distributions and introduces a novel approximation strategy, with key components designed using advanced AI-assisted tools. Our approach not only establishes the first linear-time method for effectively approximating TV distance but also provides a scalable computational framework for comparing high-dimensional distributions. This advance holds substantial theoretical and practical implications for tasks involving distributional similarity assessment in large-scale settings.
📝 Abstract
We present a linear time approximation algorithm of the total variation distance between two product distributions. The main algorithm was found using ChatGPT 5.6 Sol Ultra.
Problem

Research questions and friction points this paper is trying to address.

total variation distance
product distributions
linear time approximation
approximation algorithm
Innovation

Methods, ideas, or system contributions that make the work stand out.

linear time
total variation distance
product distributions
approximation algorithm
ChatGPT-assisted discovery
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
Konrad Anand
Konrad Anand
PhD Mathematics, Queen Mary, University of London
A
Alistair Benford
School of Informatics, University of Edinburgh, Informatics Forum, Edinburgh, EH8 9AB, United Kingdom
Heng Guo
Heng Guo
University of Edinburgh
Algorithms and complexity