English
Related papers

Related papers: Asymptotics for Optimal Empirical Quantization of …

200 papers

Monte Carlo approximations for random linear elliptic PDE constrained optimization problems are studied. We use empirical process theory to obtain best possible mean convergence rates $O(n^{-\frac{1}{2}})$ for optimal values and solutions,…

Optimization and Control · Mathematics 2021-06-14 Werner Römisch , Thomas M. Surowiec

A common way to quantify the ,,distance'' between measures is via their discrepancy, also known as maximum mean discrepancy (MMD). Discrepancies are related to Sinkhorn divergences $S_\varepsilon$ with appropriate cost functions as…

Optimization and Control · Mathematics 2020-08-25 Sebastian Neumayer , Gabriele Steidl

We consider a Markov chain on $\mathbb{R}^d$ with invariant measure $\mu$. We are interested in the rate of convergence of the empirical measures towards the invariant measure with respect to various dual distances, including in particular…

Probability · Mathematics 2022-10-13 Adrian Riekert

We propose a variational approach to approximate measures with measures uniformly distributed over a 1 dimentional set. The problem consists in minimizing a Wasserstein distance as a data term with a regularization given by the length of…

Analysis of PDEs · Mathematics 2024-10-17 Antonin Chambolle , Vincent Duval , Joao Miguel Machado

We study the problem of generalized uniformity testing \cite{BC17} of a discrete probability distribution: Given samples from a probability distribution $p$ over an {\em unknown} discrete domain $\mathbf{\Omega}$, we want to distinguish,…

Data Structures and Algorithms · Computer Science 2017-09-08 Ilias Diakonikolas , Daniel M. Kane , Alistair Stewart

We provide an algorithm to approximate a finitely supported discrete measure $\mu$ by a measure $\nu_{N}$ corresponding to a set of $N$ points so that the total variation between $\mu$ and $\nu_N$ has an upper bound. As a consequence if…

Number Theory · Mathematics 2022-07-11 Samantha Fairchild , Max Goering , Christian Weiß

The small sample universal hypothesis testing problem is investigated in this paper, in which the number of samples $n$ is smaller than the number of possible outcomes $m$. The goal of this work is to find an appropriate criterion to…

Statistics Theory · Mathematics 2014-12-30 Dayu Huang , Sean Meyn

We obtain new bounds for the optimal matching cost for empirical measures with unbounded support. For a large class of radially symmetric and rapidly decaying probability laws, we prove for the first time the asymptotic rate of convergence…

Probability · Mathematics 2024-07-10 Emanuele Caglioti , Michael Goldman , Francesca Pieroni , Dario Trevisan

We derive a lower bound on the smallest output entropy that can be achieved via vector quantization of a $d$-dimensional source with given expected $r$th-power distortion. Specialized to the one-dimensional case, and in the limit of…

Information Theory · Computer Science 2017-03-27 Tobias Koch , Gonzalo Vazquez-Vilar

We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…

Probability · Mathematics 2023-01-03 Tiefeng Jiang , Ke Wang

In statistical inference, confidence set procedures are typically evaluated based on their validity and width properties. Even when procedures achieve rate-optimal widths, confidence sets can still be excessively wide in practice due to…

Statistics Theory · Mathematics 2025-03-20 Kenta Takatsu

For a probability measure $\mu$ on $[0,1]$ without discrete component, the best possible order of approximation by a finite point set in terms of the star-discrepancy is $\frac{1}{2N}$ as has been proven relatively recently. However, if…

Number Theory · Mathematics 2022-02-04 Christian Weiß

This paper deals with the problem of quantifying the approximation a probability measure by means of an empirical (in a wide sense) random probability measure, depending on the first n terms of a sequence of random elements. In Section 2,…

Probability · Mathematics 2018-08-23 Emanuele Dolera , Eugenio Regazzini

Fix $p\in[1,\infty)$, $K\in(0,\infty)$ and a probability measure $\mu$. We prove that for every $n\in\mathbb{N}$, $\varepsilon\in(0,1)$ and $x_1,\ldots,x_n\in L_p(\mu)$ with $\big\| \max_{i\in\{1,\ldots,n\}} |x_i| \big\|_{L_p(\mu)} \leq K$,…

Metric Geometry · Mathematics 2022-03-10 Alexandros Eskenazis

For a fixed, compactly supported probability measure $\mu$ on the $d$-dimensional space $\mathbb{R}^d$, we consider the problem of minimizing the $p^{\mathrm{th}}$-power average distance functional over all compact, connected $\Sigma…

Optimization and Control · Mathematics 2025-08-12 Lucas O'Brien , Forest Kobayashi , Young-Heon Kim

We consider the problem of detecting the true quantum state among $r$ possible ones, based of measurements performed on $n$ copies of a finite-dimensional quantum system. A special case is the problem of discriminating between $r$…

Quantum Physics · Physics 2012-05-14 Michael Nussbaum , Arleta Szkoła

In this paper, for $\mu$ and $\nu$ two probability measures on $\mathbb{R}^d$ with finite moments of order $\rho\ge 1$, we define the respective projections for the $W_\rho$-Wasserstein distance of $\mu$ and $\nu$ on the sets of probability…

Probability · Mathematics 2019-02-11 Aurélien Alfonsi , Jacopo Corbetta , Benjamin Jourdain

Let $X_t$ be the (reflecting) diffusion process generated by $L:=\Delta+\nabla V$ on a complete connected Riemannian manifold $M$ possibly with a boundary $\partial M$, where $V\in C^1(M)$ such that $\mu(d x):= e^{V(x)}d x$ is a probability…

Probability · Mathematics 2021-07-06 Feng-Yu Wang

We propose of an improved version of the ubiquitous symmetrization inequality making use of the Wasserstein distance between a measure and its reflection in order to quantify the symmetry of the given measure. An empirical bound on this…

Statistics Theory · Mathematics 2020-01-07 Adam B Kashlak

Random probabilities are a key component to many nonparametric methods in Statistics and Machine Learning. To quantify comparisons between different laws of random probabilities several works are starting to use the elegant Wasserstein over…

Statistics Theory · Mathematics 2024-05-27 Marta Catalano , Hugo Lavenant