English
Related papers

Related papers: On Approximating Total Variation Distance

200 papers

Models of discrete-valued outcomes are easily misspecified if the data exhibit zero-inflation, overdispersion or contamination. Without additional knowledge about the existence and nature of this misspecification, model inference and…

Methodology · Statistics 2020-10-27 Jeremias Knoblauch , Lara Vomfell

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

We design efficient distance approximation algorithms for several classes of structured high-dimensional distributions. Specifically, we show algorithms for the following problems: - Given sample access to two Bayesian networks $P_1$ and…

Data Structures and Algorithms · Computer Science 2020-02-17 Arnab Bhattacharyya , Sutanu Gayen , Kuldeep S. Meel , N. V. Vinodchandran

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved…

Image and Video Processing · Electrical Eng. & Systems 2025-08-26 Edward P. Chandler , Shirin Shoushtari , Brendt Wohlberg , Ulugbek S. Kamilov

We study the weighted total variation distance between probability measures. Using Fourier-analytic tools, we present estimates in terms of Wasserstein distances between the respective probabilities, under appropriate smoothness and moment…

Probability · Mathematics 2025-06-23 Iván Ivkovic , Miklós Rásonyi

We study the problem of designing mechanisms when agents' valuation functions are drawn from unknown and correlated prior distributions. In particular, we are given a prior distribution $\D$, and we are interested in designing a (truthful)…

Computer Science and Game Theory · Computer Science 2023-10-13 Anuran Makur , Marios Mertzanidis , Alexandros Psomas , Athina Terzoglou

We study the problem of learning a tree Ising model from samples such that subsequent predictions made using the model are accurate. The prediction task considered in this paper is that of predicting the values of a subset of variables…

Statistics Theory · Mathematics 2018-06-15 Guy Bresler , Mina Karzand

The topic of this paper is the asymptotic distribution of random orthogonal matrices distributed according to Haar measure. We examine the total variation distance between the joint distribution of the entries of $W_n$, the $p_n \times q_n$…

Probability · Mathematics 2019-02-01 Kathryn Stewart

We propose a fundamental metric for measuring the distance between two distributions. This metric, referred to as the decision-focused (DF) divergence, is tailored to stochastic linear optimization problems in which the objective…

Statistics Theory · Mathematics 2026-02-04 Suhan Liu , Mo Liu

Total Variation (TV) is a popular regularization strategy that promotes piece-wise constant signals by constraining the $\ell_1$-norm of the first order derivative of the estimated signal. The resulting optimization problem is usually…

Optimization and Control · Mathematics 2020-10-20 Hamza Cherkaoui , Jeremias Sulam , Thomas Moreau

This work considers the use of Total variation (TV) minimization in the recovery of a given gradient sparse vector from Gaussian linear measurements. It has been shown in recent studies that there exist a sharp phase transition behavior in…

Information Theory · Computer Science 2019-02-11 Sajad Daei , Farzan Haddadi , Arash Amini

We study the problems of identity and closeness testing of $n$-dimensional product distributions. Prior works by Canonne, Diakonikolas, Kane and Stewart (COLT 2017) and Daskalakis and Pan (COLT 2017) have established tight sample complexity…

Data Structures and Algorithms · Computer Science 2021-05-27 Arnab Bhattacharyya , Sutanu Gayen , Saravanan Kandasamy , N. V. Vinodchandran

A fundamental notion of distance between train and test distributions from the field of domain adaptation is discrepancy distance. While in general hard to compute, here we provide the first set of provably efficient algorithms for testing…

Data Structures and Algorithms · Computer Science 2024-06-14 Gautam Chandrasekaran , Adam R. Klivans , Vasilis Kontonis , Konstantinos Stavropoulos , Arsen Vasilyan

The paper provides an estimate of the total variation distance between distributions of polynomials defined on a space equipped with a logarithmically concave measure in terms of the $L^2$-distance between these polynomials.

Probability · Mathematics 2018-12-07 Egor Kosov

The quantale of distance distributions is of fundamental importance for understanding probabilistic metric spaces as enriched categories. Motivated by the categorical interpretation of partial metric spaces, we are led to investigate the…

General Topology · Mathematics 2020-01-30 Jialiang He , Hongliang Lai , Lili Shen

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

Total variation (TV) is a powerful regularization method that has been widely applied in different imaging applications, but is difficult to apply to diffuse optical tomography (DOT) image reconstruction (inverse problem) due to complex and…

Computer Vision and Pattern Recognition · Computer Science 2019-04-08 Wenqi Lu , Jinming Duan , David Orive-Miguel , Lionel Herve , Iain B Styles

The total variation (TV)-seminorm is considered for piecewise polynomial, globally discontinuous (DG) and continuous (CG) finite element functions on simplicial meshes. A novel, discrete variant (DTV) based on a nodal quadrature formula is…

Numerical Analysis · Mathematics 2018-08-17 Marc Herrmann , Roland Herzog , Stephan Schmidt , José Vidal-Núñez , Gerd Wachsmuth

We provide an implementation to compute the flat metric in any dimension. The flat metric, also called dual bounded Lipschitz distance, generalizes the well-known Wasserstein distance $W_1$ to the case that the distributions are of unequal…

Machine Learning · Computer Science 2025-06-17 Henri Schmidt , Christian Düll

We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a…

Probability · Mathematics 2013-03-21 Erol A. Peköz , Adrian Röllin , Nathan Ross