English
Related papers

Related papers: TV over Bernoulli products: the small parameter re…

200 papers

If one seeks to estimate the total variation between two product measures $||P^\otimes_{1:n}-Q^\otimes_{1:n}||$ in terms of their marginal TV sequence $\delta=(||P_1-Q_1||,||P_2-Q_2||,\ldots,||P_n-Q_n||)$, then trivial upper and lower…

Probability · Mathematics 2024-10-03 Aryeh Kontorovich

Total variation distance (TV distance) is a fundamental notion of distance between probability distributions. In this work, we introduce and study the problem of computing the TV distance of two product distributions over the domain…

Data Structures and Algorithms · Computer Science 2023-08-21 Arnab Bhattacharyya , Sutanu Gayen , Kuldeep S. Meel , Dimitrios Myrisiotis , A. Pavan , N. V. Vinodchandran

A homogenization principle for total variation We prove an inequality comparing the variational distance between pairs of product probability measures to its homogenized counterpart. If $P_1,\ldots,P_n,Q_1,\ldots,Q_n$ are arbitrary…

Probability · Mathematics 2026-04-07 Aryeh Kontorovich

We study the total variation distance under two information-erasing maps on inhomogeneous Bernoulli product measures: summation and homogenization. While summation is a Markov kernel and hence satisfies the usual data processing inequality,…

Probability · Mathematics 2026-02-26 Aryeh Kontorovich

We study the problem of approximating the total variation distance between two mixtures of product distributions over an $n$-dimensional discrete domain. Given two mixtures $\mathbb{P}$ and $\mathbb{Q}$ with $k_1$ and $k_2$ product…

Data Structures and Algorithms · Computer Science 2026-05-06 Weiming Feng , Yucheng Fu , Minji Yang , Anqi Zhang

Total variation distance (TV distance) is an important measure for the difference between two distributions. Recently, there has been progress in approximating the TV distance between product distributions: a deterministic algorithm for a…

Data Structures and Algorithms · Computer Science 2023-09-27 Weiming Feng , Liqiang Liu , Tianren Liu

We investigate some previously unexplored (or underexplored) computational aspects of total variation (TV) distance. First, we give a simple deterministic polynomial-time algorithm for checking equivalence between mixtures of product…

Data Structures and Algorithms · Computer Science 2024-12-16 Arnab Bhattacharyya , Sutanu Gayen , Kuldeep S. Meel , Dimitrios Myrisiotis , A. Pavan , N. V. Vinodchandran

In this work, we continue the line of research on the complexity of distributions (Viola, Journal of Computing 2012), and study samplers defined by low degree polynomials. An $n$-tuple $P = (P_1,\dots, P_n)$ of functions $P_i \colon…

Computational Complexity · Computer Science 2026-05-05 Mohammad Mahdi Khodabandeh , Igor Shinkar

This work is about the total variation (TV) minimization which is used for recovering gradient-sparse signals from compressed measurements. Recent studies indicate that TV minimization exhibits a phase transition behavior from failure to…

Information Theory · Computer Science 2019-09-17 Sajad Daei , Farzan Haddadi , Arash Amini

We consider a one dimensional interacting particle system which describes the effective interface dynamics of the two dimensional Toom model at low temperature and noise. We prove a number of basic properties of this model. First we…

Mathematical Physics · Physics 2018-01-16 Nick Crawford , Gady Kozma , Wojciech de Roeck

The first part of this work considers the entropy of the sum of (possibly dependent and non-identically distributed) Bernoulli random variables. Upper bounds on the error that follows from an approximation of this entropy by the entropy of…

Information Theory · Computer Science 2013-04-30 Igal Sason

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…

Computational Complexity · Computer Science 2024-05-15 Arnab Bhattacharyya , Sutanu Gayen , Kuldeep S. Meel , Dimitrios Myrisiotis , A. Pavan , N. V. Vinodchandran

The Bernoulli convolution with parameter $\lambda\in(0,1)$ is the measure on $\bf R$ that is the distribution of the random power series $\sum\pm\lambda^n$, where $\pm$ are independent fair coin-tosses. This paper surveys recent progress on…

Classical Analysis and ODEs · Mathematics 2016-08-16 Péter P. Varjú

New lower bounds on the total variation distance between the distribution of a sum of independent Bernoulli random variables and the Poisson random variable (with the same mean) are derived via the Chen-Stein method. The new bounds rely on…

Information Theory · Computer Science 2013-07-17 Igal Sason

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…

Data Structures and Algorithms · Computer Science 2024-07-02 Arnab Bhattacharyya , Sutanu Gayen , Kuldeep S. Meel , Dimitrios Myrisiotis , A. Pavan , N. V. Vinodchandran

It was recently shown that for reasonable notions of approximation of states and functions by quantum circuits, almost all states and functions are exponentially hard to approximate [Knill 1995]. The bounds obtained are asymptotically tight…

Quantum Physics · Physics 2008-02-03 E. Knill

We introduce distance measures between quantum states, measurements, and channels based on their statistical distinguishability in generic experiments. Specifically, we analyze the average Total Variation Distance (TVD) between output…

Quantum Physics · Physics 2023-09-13 Filip B. Maciejewski , Zbigniew Puchała , Michał Oszmaniec

Let P and Q be two probability distributions which differ only for values with non-zero probability. We show that the variational distance between the n-fold product distributions P^n and Q^n cannot grow faster than the square root of n.

Information Theory · Computer Science 2007-07-13 Renato Renner

Pinsker's classical inequality asserts that the total variation $TV(\mu, \nu)$ between two probability measures is bounded by $\sqrt{ 2H(\mu|\nu)}$ where $H$ denotes the relative entropy (or Kullback-Leibler divergence). Considering the…

Probability · Mathematics 2025-06-30 Mathias Beiglböck , Markus Zona

Two-sample testing, where we aim to determine whether two distributions are equal or not equal based on samples from each one, is challenging if we cannot place assumptions on the properties of the two distributions. In particular,…

Machine Learning · Statistics 2026-04-13 Rohan Hore , Rina Foygel Barber
‹ Prev 1 2 3 10 Next ›