English
Related papers

Related papers: On lower bounds for the L_2-discrepancy

200 papers

We study the dispersion of point sets in the unit square; i.e. the size of the largest axes-parallel box amidst such point sets. It is known that $\liminf_{N\to\infty} N\mathrm{disp}(N,2)\in \left[\frac54,2\right],$ where…

Combinatorics · Mathematics 2021-09-14 Ralph Kritzinger , Jaspar Wiart

The analysis of continuously spatially varying processes usually considers two sources of variation, namely, the large-scale variation collected by the trend of the process, and the small-scale variation. Parametric trend models on latitude…

We present some forms of uncertainty principle which involve in a new way localization operators, the concept of $\varepsilon$-concentration and the standard deviation of $L^2$ functions. We show how our results improve the classical…

Functional Analysis · Mathematics 2015-10-12 Paolo Boggiatto , Evanthia Carypis , Alessandro Oliaro

In this paper, we study a class of two sample test statistics based on inter-point distances in the high dimensional and low sample size setting. Our test statistics include the well-known energy distance and maximum mean discrepancy with…

Methodology · Statistics 2020-04-13 Changbo Zhu , Xiaofeng Shao

We consider planar curved strictly convex domains with no or very weak smoothness assumptions and prove sharp bounds for square-functions associated to the lattice point discrepancy.

Classical Analysis and ODEs · Mathematics 2010-04-08 Alexander Iosevich , Eric T. Sawyer , Andreas Seeger

A loss function measures the discrepancy between the true values (observations) and their estimated fits, for a given instance of data. A loss function is said to be proper (unbiased, Fisher consistent) if the fits are defined over a unit…

Information Theory · Computer Science 2018-05-11 Amichai Painsky , Gregory W. Wornell

The $L^2$-orthogonal projection onto a subspace is an important mathematical tool, which has been widely applied in many fields such as linear least squares problems, eigenvalue problems, ill-posed problems, and randomized algorithms. In…

Numerical Analysis · Mathematics 2019-10-29 Xuefeng Xu

We study the extreme $L_p$ discrepancy of infinite sequences in the $d$-dimensional unit cube, which uses arbitrary sub-intervals of the unit cube as test sets. This is in contrast to the classical star $L_p$ discrepancy, which uses…

Number Theory · Mathematics 2021-09-15 Ralph Kritzinger , Friedrich Pillichshammer

Estimates based on 2x2 tables of frequencies are widely used in statistical applications. However, in many cases these tables are incomplete in the sense that the data required to compute the frequencies for a subset of the cells defining…

Statistics Theory · Mathematics 2018-08-31 Li-Chun Zhang , Raymond L. Chambers

We study the diversity of the features learned by a two-layer neural network trained with the least squares loss. We measure the diversity by the average $L_2$-distance between the hidden-layer features and theoretically investigate how…

Machine Learning · Computer Science 2023-06-14 Firas Laakom , Jenni Raitoharju , Alexandros Iosifidis , Moncef Gabbouj

Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according…

Information Theory · Computer Science 2018-12-07 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

The $\gamma_2$ norm of a real $m\times n$ matrix $A$ is the minimum number $t$ such that the column vectors of $A$ are contained in a $0$-centered ellipsoid $E\subseteq\mathbb{R}^m$ which in turn is contained in the hypercube $[-t, t]^m$.…

Combinatorics · Mathematics 2015-04-13 Jiri Matousek , Aleksandar Nikolov , Kunal Talwar

This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued…

Computational Geometry · Computer Science 2008-04-23 M. d'Amico , P. Frosini , C. Landi

A loss function measures the discrepancy between the true values and their estimated fits, for a given instance of data. In classification problems, a loss function is said to be proper if a minimizer of the expected loss is the true…

Information Theory · Computer Science 2020-01-03 Amichai Painsky , Gregory W. Wornell

We noisily observe solutions of an ordinary differential equation $\dot u = f(u)$ at given times, where $u$ lives in a $d$-dimensional state space. The model function $f$ is unknown and belongs to a H\"older-type smoothness class with…

Statistics Theory · Mathematics 2024-07-23 Christof Schötz , Maximilian Siebel

We study the problem of approximation of 2D set of points. Such type of problems always occur in physical experiments, econometrics, data analysis and other areas. The often problems of outliers or spikes usually make researchers to apply…

Optimization and Control · Mathematics 2025-02-13 Majid E. Abbasov , Anna I. Belenok

We construct simple, explicit matrices with columns having unit $\ell^2$ norm and discrepancy approaching $1 + \sqrt{2} \approx 2.414$. This number gives a lower bound, the strongest known as far as we are aware, on the constant appearing…

Combinatorics · Mathematics 2021-11-05 Dmitriy Kunisky

Stability of linear systems with uncertain bounded time-varying delays is studied under assumption that the nominal delay values are not equal to zero. An input-output approach to stability of such systems is known to be based on the bound…

Optimization and Control · Mathematics 2007-05-23 Eugenii Shustin , Emilia Fridman

Second-order two-scale expansions, a unified proof for the regularity of the correctors based on the translation invariant and a lemma for extracting $O(\epsilon)$ from the remainder term are presented for the second order nonlinear…

Mathematical Physics · Physics 2011-09-07 Zhang QiaoFu , Cui JunZhi

Let $ (H_s(n))_{n \geq 1} $ be an $s-$dimensional Halton's sequence. Let $D_N$ be the discrepancy of the sequence $ (H_s(n))_{n = 1}^{N} $. It is known that $ND_N =O(\ln^s N)$ as $N \to \infty $. In this paper we prove that this estimate is…

Number Theory · Mathematics 2014-12-31 Mordechay B. Levin