English
Related papers

Related papers: Approximating the total variation distance between…

200 papers

We are interested in the estimation of the distance in total variation $$ \Delta := \|P_{f(X)} - P_{g(X)}\|_{\mathrm var} $$ between distributions of random variables $f(X)$ and $g(X)$ in terms of proximity of $f$ and $g.$ We propose a…

Probability · Mathematics 2017-06-21 Youri Davydov

In this paper, we propose a novel symmetric alternating minimization algorithm to solve a broad class of total variation (TV) regularization problems. Unlike the usual $z^k\to x^k$ Gauss-Seidel cycle, the proposed algorithm performs the…

Data Structures and Algorithms · Computer Science 2020-06-08 Yuan Lei , Jiaxin Xie

Spin-glasses are Gibbs distributions that have been studied in CS for many decades. Recently, they have gained renewed attention as they emerge naturally in learning, inference, optimisation etc. We consider the Edwards-Anderson (EA)…

Discrete Mathematics · Computer Science 2024-03-15 Charilaos Efthymiou , Kostas Zampetakis

In this note, we propose a method to under-approximate finite-time reachable sets and tubes for a class of continuous-time linear uncertain systems. The class under consideration is the linear time-varying (LTV) class with integrable…

Systems and Control · Electrical Eng. & Systems 2020-02-12 Mohamed Serry

We establish tight results for rapid mixing of Gibbs samplers for the Ferromagnetic Ising model on general graphs. We show that if \[(d-1)\tanh\beta<1,\] then there exists a constant C such that the discrete time mixing time of Gibbs…

Probability · Mathematics 2013-02-06 Elchanan Mossel , Allan Sly

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

In this article, we obtain, for the total variance distance, the error bounds between Poisson and convolution of power series distributions via Stein's method. This provides a unified approach to many known discrete distributions. Several…

Probability · Mathematics 2020-06-26 A. N. Kumar , P. Vellaisamy , F. Viens

Thin, metallic magnetic films can support nonreciprocal spin waves due to the interfacial Dzyaloshinskii-Moriya interaction (iDMI). However, these films typically have high damping, making spin wave propagation distances short (less than…

Materials Science · Physics 2025-12-11 Cameron A McEleney , Karen L Livesey , Robert E Camley , Rair Macêdo

Total variation (TV) is a widely used regularizer for stabilizing the solution of ill-posed inverse problems. In this paper, we propose a novel proximal-gradient algorithm for minimizing TV regularized least-squares cost functional. Our…

Information Theory · Computer Science 2016-01-05 Ulugbek S. Kamilov

Local samplers are algorithms that generate random samples based on local queries to high-dimensional distributions, ensuring the samples follow the correct induced distributions while maintaining time complexity that scales locally with…

Data Structures and Algorithms · Computer Science 2025-10-14 Hongyang Liu , Chunyang Wang , Yitong Yin

We investigate many-body spin squeezing dynamics in an XXZ model with interactions that fall off with distance $r$ as $1/r^\alpha$ in $D=2$ and $3$ spatial dimensions. In stark contrast to the Ising model, we find a broad parameter regime…

Quantum Physics · Physics 2020-12-30 Michael A. Perlin , Chunlei Qu , Ana Maria Rey

This paper introduces the \emph{$d$-distance $b$-matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges, an integer $d\in\mathbb{Z}_+$ and a degree bound function…

Discrete Mathematics · Computer Science 2023-11-29 Péter Madarasi

The dynamic time warping (dtw) distance fails to satisfy the triangle inequality and the identity of indiscernibles. As a consequence, the dtw-distance is not warping-invariant, which in turn results in peculiarities in data mining…

Machine Learning · Computer Science 2018-09-05 Brijnesh J. Jain

We show that, in the weak field limit, at large separations, in sharp contrast to General Relativity (GR), all massive gravity theories predict distance-dependent spin alignments for spinning objects. For all separations GR requires…

General Relativity and Quantum Cosmology · Physics 2014-01-17 Ibrahim Gullu , Bayram Tekin

Metric data plays an important role in various settings such as metric-based indexing, clustering, classification, and approximation algorithms in general. Due to measurement error, noise, or an inability to completely gather all the data,…

Computational Geometry · Computer Science 2018-07-24 Chenglin Fan , Benjamin Raichel , Gregory Van Buskirk

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

Temporal graphs represent networks in which connections change over time, with edges available only at specific moments. Motivated by applications in logistics, multi-agent information spreading, and wireless networks, we introduce the…

Data Structures and Algorithms · Computer Science 2026-02-13 Daniele Carnevale , Gianlorenzo D'Angelo

The corrections to finite-size scaling in the critical two-point correlation function G(r) of 2D Ising model on a square lattice have been studied numerically by means of exact transfer-matrix algorithms. The systems have been considered,…

Statistical Mechanics · Physics 2007-05-23 J. Kaupuzs

For two multisets $S$ and $T$ of points in $[\Delta]^2$, such that $|S| = |T|= n$, the earth-mover distance (EMD) between $S$ and $T$ is the minimum cost of a perfect bipartite matching with edges between points in $S$ and $T$, i.e.,…

Data Structures and Algorithms · Computer Science 2014-04-28 Arman Yousefi , Rafail Ostrovsky

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

Computational Complexity · Computer Science 2021-03-16 Christopher Williamson
‹ Prev 1 3 4 5 6 7 10 Next ›