Metraipolis › archive › dc_2d01a3bea49f

On Deterministically Computing Total Variation Distance via Zonotope Compression — arXiv:2609.24235

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.24235
License (as archived)
CC0-1.0
Archived
2026-10-09T22:40:53.367Z
SHA-256 of the archived text
dc2914797fcfa3cb6d39eb16b36fb86d40cc15749569e158ed5ea3ff5bda9062
Stable URL of this page
https://metraipolis.com/documento/dc_2d01a3bea49f

How to cite

On Deterministically Computing Total Variation Distance via Zonotope Compression — arXiv:2609.24235 — arXiv (en), https://arxiv.org/abs/2609.24235 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2d01a3bea49f (Metraipolis archive dc_2d01a3bea49f, sha256 dc2914797fcfa3cb6d39eb16b36fb86d40cc15749569e158ed5ea3ff5bda9062)
BibTeX
@misc{dc2d01a3bea49f,
  title = {On Deterministically Computing Total Variation Distance via Zonotope Compression — arXiv:2609.24235},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.24235},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2d01a3bea49f; sha256 dc2914797fcfa3cb6d39eb16b36fb86d40cc15749569e158ed5ea3ff5bda9062},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24235. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study deterministic relative approximation of the total variation distance between high-dimensional distributions given by succinct descriptions. We develop an abstract deterministic approximation framework based on representing the total variation distance as a support function of a low-dimensional zonotope. As applications, we obtain FPTASs for several models. Given two mixtures of product distributions over $[q]^n$ with a total of $K$ component distributions, our algorithm approximates their TV-distance within a factor of $1+\varepsilon$ in time $\widetilde O_K(nq(n/\varepsilon)^{2K})$. We also give an FPTAS for mixtures of $n$-step Markov chains over $[q]^n$ with a total of $K$ component distributions, with running time $\widetilde O_K(nq^2(n/\varepsilon)^{2K})$. Finally, for two latent-tree Ising models with the same underlying tree topology, we give an FPTAS for the TV-distance between their leaf marginals in time $O(|V|^{13}\varepsilon^{-12})$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.24235 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T22:24:05.639Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).