English
Related papers

Related papers: Generalized Discrepancy of Random Points

200 papers

It is well known that estimating the expectation of any given bounded random variable with values in $[-B, B]$ has a sample complexity of $\mathrm{O}(B^2/\epsilon^2)$ that is independent of the underlying probability measure. We show that…

Optimization and Control · Mathematics 2026-04-29 Yan Li

This paper demonstrates that when a shallow neural network with a Lipschitz continuous activation function is trained using either empirical or population risk to approximate a target function that is $r$ times continuously differentiable…

Machine Learning · Computer Science 2026-03-06 Sanghoon Na , Haizhao Yang

High-dimensional data sets are commonly collected in many contemporary applications arising in various fields of scientific research. We present two views of finite samples in high dimensions: a probabilistic one and a nonprobabilistic one.…

Statistics Theory · Mathematics 2013-11-13 Jinchi Lv

We study goodness-of-fit of discrete distributions in the distributed setting, where samples are divided between multiple users who can only release a limited amount of information about their samples due to various information constraints.…

Data Structures and Algorithms · Computer Science 2019-07-23 Jayadev Acharya , Clément L. Canonne , Yanjun Han , Ziteng Sun , Himanshu Tyagi

We study the integration and approximation problems for monotone and convex bounded functions that depend on $d$ variables, where $d$ can be arbitrarily large. We consider the worst case error for algorithms that use finitely many function…

Numerical Analysis · Mathematics 2013-12-13 Aicke Hinrichs , Erich Novak , Henryk Woźniakowski

We study the large deviation principle (LDP) for locally damped nonlinear wave equations perturbed by a bounded noise. When the noise is sufficiently non-degenerate, we establish the LDP for empirical distributions with lower bound of a…

Analysis of PDEs · Mathematics 2024-09-19 Yuxuan Chen , Ziyu Liu , Shengquan Xiang , Zhifei Zhang

Many commonly used test statistics are based on a norm measuring the evidence against the null hypothesis. To understand how the choice of a norm affects power properties of tests in high dimensions, we study the consistency sets of…

Statistics Theory · Mathematics 2022-02-01 Anders Bredahl Kock , David Preinerstorfer

The symmetrized Hammersley point set is known to achieve the best possible rate for the $L_2$-norm of the discrepancy function. Also lower bounds for the norm in Besov spaces of dominating mixed smoothness are known. In this paper a large…

Numerical Analysis · Mathematics 2014-02-19 Lev Markhasin

We study the recovery of functions in various norms, including $L_p$ with $1\le p\le\infty$, based on function evaluations. We obtain worst case error bounds for general classes of functions in terms of the best $L_2$-approximation from a…

Numerical Analysis · Mathematics 2025-12-23 David Krieg , Kateryna Pozharska , Mario Ullrich , Tino Ullrich

$ \renewcommand{\subset}{\subseteq} \newcommand{\N}{\mathbb N} $For $p\in [2,\infty)$ the metric $X_p$ inequality with sharp scaling parameter is proven here to hold true in $L_p$. The geometric consequences of this result include the…

Metric Geometry · Mathematics 2016-01-14 Assaf Naor

Curse of Dimensionality is an unavoidable challenge in statistical probability models, yet diffusion models seem to overcome this limitation, achieving impressive results in high-dimensional data generation. Diffusion models assume that…

Machine Learning · Statistics 2025-10-01 Zhenxin Zheng , Zhenjie Zheng

For irrational $\alpha$, $\{n\alpha\}$ is uniformly distributed mod 1 in the Weyl sense, and the asymptotic behavior of its discrepancy is completely known. In contrast, very few precise results exist for the discrepancy of subsequences…

Number Theory · Mathematics 2023-03-15 Istvan Berkes , Bence Borda

Kusner asked if $n+1$ points is the maximum number of points in $\mathbb{R}^n$ such that the $\ell_p$ distance $(1<p<\infty)$ between any two points is $1$. We present an improvement to the best known upper bound when $p$ is large in terms…

Metric Geometry · Mathematics 2021-11-23 Richard Chen , Feng Gui , Jason Tang , Nathan Xiong

We study constrained selection sets of random closed sets defined on a non-atomic probability space. Given a random interval $Y=[y_L,y_U]$ and scalar constraints on the expectation or the median of admissible selections, we characterize the…

Probability · Mathematics 2026-03-20 Arie Beresteanu , Behrooz Moosavi Rameznzadeh

In this paper, we study Bernoulli random sequences, i.e., sequences that are Martin-L\"of random with respect to a Bernoulli measure $\mu_p$ for some $p\in[0,1]$, where we allow for the possibility that $p$ is noncomputable. We focus in…

Logic · Mathematics 2019-03-26 Christopher P. Porter

We investigate $L_2$-discrepancies of what we call weak Latin hypercubes. In this case it turns out that there is a precise equivalence between the extreme and periodic $L_2$-discrepancy which follows from a much broader result about…

Numerical Analysis · Mathematics 2025-03-03 Nicolas Nagel

In 2009, W. D. Banks and I. E. Shparlinski studied the average densities of primes $p \leq x$ for which the reductions of elliptic curves of small height modulo $p$ satisfy certain arithmetic properties, namely cyclicity and divisibility of…

Number Theory · Mathematics 2025-06-23 Sung Min Lee

We prove the curse of dimensionality in the worst case setting for numerical integration for a number of classes of smooth $d$-variate functions. Roughly speaking, we consider different bounds for the derivatives of $f \in C^k(D_d)$ and ask…

Numerical Analysis · Mathematics 2014-04-23 Aicke Hinrichs , Erich Novak , Mario Ullrich , Henryk Wozniakowski

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

We present a general approach to deriving bounds on the generalization error of randomized learning algorithms. Our approach can be used to obtain bounds on the average generalization error as well as bounds on its tail probabilities, both…

Information Theory · Computer Science 2020-09-10 Fredrik Hellström , Giuseppe Durisi
‹ Prev 1 8 9 10 Next ›