English
Related papers

Related papers: Symmetric KL-divergence by Stein's Method

200 papers

We present a simple algorithm that estimates the cardinality $n$ of a set $V$ when allowed to sample elements of $V$ uniformly and independently at random. Our algorithm with probability $(1-\delta)$ returns a $(1\pm\epsilon)-$approximation…

Discrete Mathematics · Computer Science 2018-04-13 Marco Bressan , Enoch Peserico , Luca Pretto

We present a direct analytic method towards an estimate for the rate of convergence (to the Euclidean Ball) of Steiner symmetrizations. To this end we present a modified version of a known stability property of the Steiner symmetrization.

Metric Geometry · Mathematics 2015-05-15 D. I. Florentin , A. Segal

Let $M_n$ be a random element of the unitary, special orthogonal, or unitary symplectic groups, distributed according to Haar measure. By a classical result of Diaconis and Shahshahani, for large matrix size $n$, the vector $ (\on{Tr}(M_n),…

Probability · Mathematics 2011-08-30 Christian Döbler , Michael Stolz

We present a straightforward formulation of Stein's method for the semicircular distribution, specifically designed for the analysis of non-commutative random variables. Our approach employs a non-commutative version of Stein's heuristic,…

Probability · Mathematics 2024-12-03 Mario Díaz , Arturo Jaramillo

The Central Limit Theorem (CLT) is one of the most fundamental results in statistics. It states that the standardized sample mean of a sequence of $n$ mutually independent and identically distributed random variables with finite first and…

We calculate the p-the moment of the sum of n independent random variables with respect to symmetric norm in R^n. The order of growth for upper bound p/ln p obtained in ths estimate is optimal. The result extends to generalized Lorentz…

Probability · Mathematics 2007-05-23 Marius Junge

Let $M$ be a random matrix in the orthogonal group $\O_n$, distributed according to Haar measure, and let $A$ be a fixed $n\times n$ matrix over $\R$ such that $\tr(AA^t)=n$. Then the total variation distance of the random variable…

Probability · Mathematics 2010-05-18 Elizabeth Meckes

We study the accuracy of a scaled Poisson approximation to the weighted sum of independent Poisson random variables, focusing on in particular the relative error of the tail distribution. A bound on the relative approximation error is…

Probability · Mathematics 2024-03-18 Yue Tan , Yingdong Lu , Cathy Xia

We derive a deterministic, non-asymptotic upper bound on the Kullback-Leibler (KL) divergence of the flow-matching distribution approximation. In particular, if the $L_2$ flow-matching loss is bounded by $\epsilon^2 > 0$, then the KL…

Machine Learning · Computer Science 2025-11-10 Maojiang Su , Jerry Yao-Chieh Hu , Sophia Pi , Han Liu

We establish bounds on the KL divergence between two multivariate Gaussian distributions in terms of the Hamming distance between the edge sets of the corresponding graphical models. We show that the KL divergence is bounded below by a…

Information Theory · Computer Science 2015-04-06 Varun Jog , Po-Ling Loh

Let $\mathbf {x}_1,\ldots,\mathbf {x}_n$ be a random sample from a $p$-dimensional population distribution, where $p=p_n\to\infty$ and $\log p=o(n^{\beta})$ for some $0<\beta\leq1$, and let $L_n$ be the coherence of the sample correlation…

Probability · Mathematics 2014-02-26 Qi-Man Shao , Wen-Xin Zhou

The central limit theorem (CLT) is one of the most fundamental results in probability; and establishing its rate of convergence has been a key question since the 1940s. For independent random variables, a series of recent works established…

Probability · Mathematics 2023-09-12 Tianle Liu , Morgane Austern

We propose a communication and computation efficient second-order method for distributed optimization. For each iteration, our method only requires $\mathcal{O}(d)$ communication complexity, where $d$ is the problem dimension. We also…

Optimization and Control · Mathematics 2023-05-30 Chengchang Liu , Lesi Chen , Luo Luo , John C. S. Lui

We propose a novel method for measuring the discrepancy between a set of samples and a desired posterior distribution for Bayesian inference. Classical methods for assessing sample quality like the effective sample size are not appropriate…

Machine Learning · Statistics 2026-05-01 Narayan Srinivasan , Matthew Sutton , Christopher Drovandi , Leah F South

We interpret likelihood-based test functions from a geometric perspective where the Kullback-Leibler (KL) divergence is adopted to quantify the distance from a distribution to another. Such a test function can be seen as a sub-Gaussian…

Information Theory · Computer Science 2021-01-05 Yan Wang

Lie symmetry analysis is one of the powerful tools to analyze nonlinear ordinary differential equations. We review the effectiveness of this method in terms of various symmetries. We present the method of deriving Lie point symmetries,…

Exactly Solvable and Integrable Systems · Physics 2023-07-19 M. Senthilvelan , V. K. Chandrasekar , R. Mohanasubha

Stein's method allows to prove distributional convergence of a sequence of random variables and to quantify it with respect to a given metric such as Kolmogorov's (a Berry-Ess\'een type theorem). Mod-* convergence quantifies the convergence…

Probability · Mathematics 2017-01-12 Yacine Barhoumi-Andréani

This paper studies convergence of empirical measures smoothed by a Gaussian kernel. Specifically, consider approximating $P\ast\mathcal{N}_\sigma$, for $\mathcal{N}_\sigma\triangleq\mathcal{N}(0,\sigma^2 \mathrm{I}_d)$, by…

Statistics Theory · Mathematics 2020-05-04 Ziv Goldfeld , Kristjan Greenewald , Yury Polyanskiy , Jonathan Weed

For any integer $m<n$, where $m$ can depend on $n$, we study the rate of convergence of $\frac{1}{\sqrt{m}}\mathrm{Tr} \mathbf{U}^m$ to its limiting Gaussian as $n\to\infty$ for orthogonal, unitary and symplectic Haar distributed random…

Probability · Mathematics 2022-04-08 Klara Courteaut , Kurt Johansson , Gaultier Lambert

We derive Stein approximation bounds for functionals of uniform random variables, using chaos expansions and the Clark-Ocone representation formula combined with derivation and finite difference operators. This approach covers sums and…

Probability · Mathematics 2018-02-28 Nicolas Privault , Grzegorz Serafin
‹ Prev 1 3 4 5 6 7 10 Next ›