English
Related papers

Related papers: On lower bounds for the L_2-discrepancy

200 papers

We derive a consistency result, in the $L_1$-sense, for incomplete U-statistics in the non-standard case where the kernel at hand has infinite second-order moments. Assuming that the kernel has finite moments of order $p(\geq 1)$, we obtain…

Statistics Theory · Mathematics 2021-12-30 Alexander Dürre , Davy Paindaveine

A second-order regularity theory is developed for solutions to a class of quasilinear elliptic equations in divergence form, including the $p$-Laplace equation, with merely square-integrable right-hand side. Our results amount to the…

Analysis of PDEs · Mathematics 2018-05-23 Andrea Cianchi , Vladimir Maz'ya

We study the expected $ L_2-$discrepancy under two classes of partitions, explicit and exact formulas are derived respectively. These results attain better expected $L_2-$discrepancy formulas than jittered sampling.

Computation · Statistics 2023-03-13 Jun Xian , Xiaoda Xu

Points in the unit cube with low discrepancy can be constructed using algebra or, more recently, by direct computational optimization of a criterion. The usual $L_\infty$ star discrepancy is a poor criterion for this because it is…

Numerical Analysis · Mathematics 2025-08-08 François Clément , Nathan Kirk , Art B. Owen , T. Konstantin Rusch

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

The $l_2$ flattening lemma of Johnson and Lindenstrauss [JL84] is a powerful tool for dimension reduction. It has been conjectured that the target dimension bounds can be refined and bounded in terms of the intrinsic dimensionality of the…

Computational Geometry · Computer Science 2015-06-09 Lee-Ad Gottlieb , Robert Krauthgamer

In the current paper we present a new proof of the small ball inequality in two dimensions. More importantly, this new argument, based on an approach inspired by lacunary Fourier series, reveals the first formal connection between this…

Classical Analysis and ODEs · Mathematics 2015-11-24 Dmitriy Bilyk , Naomi Feldheim

Optimal lower bounds for discrepancy in Besov spaces with dominating mixed smoothness are known from the work of Triebel. Hinrichs proved upper bounds in the plane. In this work we systematically analyse the problem, starting with a survey…

Numerical Analysis · Mathematics 2014-02-19 Lev Markhasin

Lie symmetries of systems of second-order linear ordinary differential equations with constant coefficients are exhaustively described over both the complex and real fields. The exact lower and upper bounds for the dimensions of the maximal…

Classical Analysis and ODEs · Mathematics 2014-03-25 Vyacheslav M. Boyko , Roman O. Popovych , Nataliya M. Shapoval

It is shown that the discrepancy function for point distributions on a torus is expressed by an explicit formula in terms of its mean values on sub-tori. As an application of this formula, a simple proof of a theorem of Lev on the…

Classical Analysis and ODEs · Mathematics 2023-09-06 M. M. Skriganov

We introduce a class of convex equivolume partitions. Expected $L_2-$discrepancy are discussed under these partitions. There are two main results. First, under this kind of partitions, we generate random point sets with smaller expected…

Statistics Theory · Mathematics 2022-04-20 Jun Xian , Xiaoda Xu

We prove a sampling discretization theorem for the square norm of functions from a finite dimensional subspace satisfying Nikol'skii's inequality with an upper bound on the number of sampling points of the order of the dimension of the…

Functional Analysis · Mathematics 2021-04-23 Irina Limonova , Vladimir Temlyakov

Geometric discrepancies are standard measures to quantify the irregularity of distributions. They are an important notion in numerical integration. One of the most important discrepancy notions is the so-called \emph{star discrepancy}.…

Neural and Evolutionary Computing · Computer Science 2013-10-08 Carola Doerr , Francois-Michel De Rainville

We study the $L_p$ discrepancy of digital NUT sequences which are an important sub-class of digital $(0,1)$-sequences in the sense of Niederreiter. The main result is a lower bound for certain sub-classes of digital NUT sequences.

Number Theory · Mathematics 2020-05-28 Ralph Kritzinger , Friedrich Pillichshammer

We study the problem of discrete distribution estimation in KL divergence and provide concentration bounds for the Laplace estimator. We show that the deviation from mean scales as $\sqrt{k}/n$ when $n \ge k$, improving upon the best prior…

Machine Learning · Statistics 2023-06-14 Clément L. Canonne , Ziteng Sun , Ananda Theertha Suresh

The $L_p$-discrepancy is a quantitative measure for the irregularity of distribution of an $N$-element point set in the $d$-dimensional unit cube, which is closely related to the worst-case error of quasi-Monte Carlo algorithms for…

Numerical Analysis · Mathematics 2023-06-13 Erich Novak , Friedrich Pillichshammer

This document offers a concise introduction to the mathematical theory and practical application of the Hausdorff Measure and Dimension. The primary objective is to clarify and rigorously detail the two most common methods used for…

History and Overview · Mathematics 2025-11-20 Umberto Michelucci

We consider the problem of distinguishing between two arbitrary black-box distributions defined over the domain [n], given access to $s$ samples from both. It is known that in the worst case O(n^{2/3}) samples is both necessary and…

Data Structures and Algorithms · Computer Science 2011-10-17 Eyal Even Dar , Mark Sandler

This paper studies minimax rates of convergence for nonparametric location-scale models, which include mean, quantile and expectile regression settings. Under Hellinger differentiability on the error distribution and other mild conditions,…

Statistics Theory · Mathematics 2023-07-06 Bingxin Zhao , Yuhong Yang

The discrepancy of the $n \times n$ greater-than matrix is shown to be $\frac{\pi}{2 \ln n}$ up to lower order terms.

Computational Complexity · Computer Science 2023-09-19 Srikanth Srinivasan , Amir Yehudayoff