
arXiv: 2405.08255
We show that computing the total variation distance between two product distributions is $\#\mathsf{P}$-complete. This is in stark contrast with other distance measures such as Kullback-Leibler, Chi-square, and Hellinger, which tensorize over the marginals leading to efficient algorithms.
5 pages. An extended version of this paper appeared in the proceedings of IJCAI 2023, under the title "On approximating total variation distance" (see https://www.ijcai.org/proceedings/2023/387 and arXiv:2206.07209)
FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Probability distributions: general theory, Computational Complexity (cs.CC), Approximations to statistical distributions (nonasymptotic)
FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Probability distributions: general theory, Computational Complexity (cs.CC), Approximations to statistical distributions (nonasymptotic)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
