English
Related papers

Related papers: On the optimization of discrepancy measures

200 papers

This paper studies the expected $L_p$-discrepancy ($2 \leq p < \infty$) for stratified sampling schemes under importance sampling. We introduce a parametric family of equivolume partitions $\Omega_{\theta,\sim}$ and leverage recent exact…

Numerical Analysis · Mathematics 2026-01-09 Xiaoda Xu

The maximum mean discrepancy (MMD) is a kernel-based distance between probability distributions useful in many applications (Gretton et al. 2012), bearing a simple estimator with pleasing computational and statistical properties. Being able…

Machine Learning · Statistics 2022-11-16 Danica J. Sutherland , Namrata Deka

We consider the local discrepancy of a symmetrized version of Hammersley type point sets in the unit square. As a measure for the irregularity of distribution we study the norm of the local discrepancy in Besov spaces with dominating mixed…

Number Theory · Mathematics 2020-05-28 Ralph Kritzinger

By a profound result of Heinrich, Novak, Wasilkowski, and Wo{\'z}niakowski the inverse of the star-discrepancy $n^*(s,\ve)$ satisfies the upper bound $n^*(s,\ve) \leq c_{\mathrm{abs}} s \ve^{-2}$. This is equivalent to the fact that for any…

Numerical Analysis · Mathematics 2012-11-07 Christoph Aistleitner , Markus Hofer

In this paper, we study bounds of expected $L_2-$discrepancy to give mean square error of uniform integration approximation for functions in Sobolev space $\mathcal{H}^{\mathbf{1}}(K)$, where $\mathcal{H}$ is a reproducing Hilbert space…

Numerical Analysis · Mathematics 2021-10-05 Jun Xian , Xiaoda Xu

According to Aistleitner and Weimar, there exist two-dimensional (double) infinite matrices whose star-discrepancy $D_N^{*s}$ of the first $N$ rows and $s$ columns, interpreted as $N$ points in $[0,1]^s$, satisfies an inequality of the form…

Number Theory · Mathematics 2026-01-13 Jasmin Fiedler , Michael Gnewuch , Christian Weiß

Let A_N be an N-point distribution in the unit square in the Euclidean plane. We consider the Discrepancy function D_N(x) in two dimensions with respect to rectangles with lower left corner anchored at the origin and upper right corner at…

Number Theory · Mathematics 2013-10-14 Dmitriy Bilyk , Michael T. Lacey , Ioannis Parissis , Armen Vagharshakyan

We study the matrix discrepancy problem in the average-case setting. Given a sequence of $m \times m$ symmetric matrices $A_1,\ldots,A_n$, its discrepancy is defined as the minimal spectral norm over all signed sums $\sum_{i=1}^n x_iA_i$…

Probability · Mathematics 2025-10-07 Dmitriy Kunisky , Timm Oertel , Nicola Wengiel , Peiyuan Zhang

The midpoint method or technique is a measurement and as each measurement it has a tolerance, but worst of all it can be invalid, called Out-of-Control or OoC. The core of all midpoint methods is the accurate measurement of the difference…

Graphics · Computer Science 2015-02-23 Valere Huypens

We show that the $\mathcal{L}_2$ discrepancy of the explicitly constructed infinite sequences of points $(\boldsymbol{x}_0,\boldsymbol{x}_1, \boldsymbol{x}_2,...)$ in $[0,1)^s$ over $\mathbb{F}_2$ introduced in [J. Dick, Walsh spaces…

Number Theory · Mathematics 2013-06-04 Josef Dick , Friedrich Pillichshammer

For all $s \geq 1$ and $N \geq 1$ there exist sequences $(z_1,\ldots,z_N)$ in $[0,1]^s$ such that the star-discrepancy of these points can be bounded by $$D_N^*(z_1,\ldots,z_N) \leq c \frac{\sqrt{s}}{\sqrt{N}}.$$ The best known value for…

Number Theory · Mathematics 2018-10-29 Hendrik Pasing , Christian Weiß

This paper is devoted to the study of a discrepancy-type characteristic -- the fixed volume discrepancy -- of the Fibonacci point set in the unit square. It was observed recently that this new characteristic allows us to obtain optimal rate…

Numerical Analysis · Mathematics 2019-08-14 Vladimir Temlyakov , Mario Ullrich

The classical Stolarsky invariance principle connects the spherical cap $L^2$ discrepancy of a finite point set on the sphere to the pairwise sum of Euclidean distances between the points. In this paper we further explore and extend this…

Classical Analysis and ODEs · Mathematics 2016-11-15 Dmitriy Bilyk , Feng Dai , Ryan Matzke

The maximum mean discrepancy (MMD) is a recently proposed test statistic for two-sample test. Its quadratic time complexity, however, greatly hampers its availability to large-scale applications. To accelerate the MMD calculation, in this…

Artificial Intelligence · Computer Science 2015-06-19 Ji Zhao , Deyu Meng

We examine the integrated squared difference, also known as the L2 distance (L2D), between two probability densities. Such a distance metric allows for comparison of differences between pairs of distributions or changes in a distribution…

Methodology · Statistics 2019-06-03 George Shan , Mark J. van der Laan

We consider the problem of finding, for a given quadratic measure of non-uniformity of a set of $N$ points (such as $L_2$ star-discrepancy or diaphony), the asymptotic distribution of this discrepancy for truly random points in the limit…

Computational Physics · Physics 2009-10-30 Andre van Hameren , Ronald Kleiss , Jiri Hoogland

We estimate some mixed $L^{p}\left( L^{2}\right) $ norms of the discrepancy between the volume and the number of integer points in $r\Omega-x$, a dilated by a factor $r$ and translated by a vector $x$ of a convex body $\Omega$ in…

Number Theory · Mathematics 2019-04-08 Leonardo Colzani , Bianca Gariboldi , Giacomo Gigante

We study the $L_p$-discrepancy of random point sets in high dimensions, with emphasis on small values of $p$. Although the classical $L_p$-discrepancy suffers from the curse of dimensionality for all $p \in (1,\infty)$, the gap between…

Numerical Analysis · Mathematics 2025-12-10 Erich Novak , Friedrich Pillichshammer

The recently developed information-theoretic approach to crystallographic symmetry classifications and quantifications in two dimensions (2D) from digital transmission electron and scanning probe microscope images is adapted for the…

Materials Science · Physics 2022-08-10 Peter Moeck , Lukas von Koch

We introduce average-distortion sketching for metric spaces. As in (worst-case) sketching, these algorithms compress points in a metric space while approximately recovering pairwise distances. The novelty is studying average-distortion: for…

Data Structures and Algorithms · Computer Science 2025-04-11 Yiqiao Bao , Anubhav Baweja , Nicolas Menand , Erik Waingarten , Nathan White , Tian Zhang