English
Related papers

Related papers: Approximating $L_p$ unit balls via random sampling

200 papers

This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the $L^r$-Kantorovich (or transport) distance, where either the locations or the weights of the approximations' atoms are…

Probability · Mathematics 2019-03-06 Chuang Xu , Arno Berger

We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even).…

Machine Learning · Computer Science 2012-03-19 Ping Li , Michael W. Mahoney , Yiyuan She

We establish deterministic hardness of approximation results for the Shortest Vector Problem in $\ell_p$ norm ($\mathsf{SVP}_p$) and for Unique-SVP ($\mathsf{uSVP}_p$) for all $p > 2$. Previously, no deterministic hardness results were…

Computational Complexity · Computer Science 2025-10-21 Yahli Hecht , Muli Safra

This paper considers the problem of estimating probabilities of the form $\mathbb{P}(Y \leq w)$, for a given value of $w$, in the situation that a sample of i.i.d.\ observations $X_1, \ldots, X_n$ of $X$ is available, and where we…

Methodology · Statistics 2016-02-01 Arnoud V. den Boer , Michel Mandjes

Let $K$ be an isotropic convex body in $\R^n$. Given $\eps>0$, how many independent points $X_i$ uniformly distributed on $K$ are needed for the empirical covariance matrix to approximate the identity up to $\eps$ with overwhelming…

Probability · Mathematics 2015-05-13 Radosław Adamczak , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

We aim at estimating a function $\lambda:[0,1]\to \mathbb {R}$, subject to the constraint that it is decreasing (or increasing). We provide a unified approach for studying the $\mathbb {L}_p$-loss of an estimator defined as the slope of a…

Statistics Theory · Mathematics 2009-09-29 Cécile Durot

Iteratively Re-weighted Least Squares (IRLS) were used to simulate the $L_p$-norm approximation of the ballistic trajectory in absolute gravimeters. Two iterations of the IRLS delivered sufficient accuracy of the approximation without a…

Instrumentation and Detectors · Physics 2016-02-17 V. D. Nagornyi , S. Svitlov , A. Araya

One of the main differences between the central limit theorem and the Poisson law of small numbers is that the former possesses the large sample property (LSP), i.e., the error of normal approximation to the sum of $n$ independent…

Probability · Mathematics 2019-06-25 Tianshu Cong , Aihua Xia , Fuxi Zhang

In this paper, we show that the $L_p$-error of asymmetric linear approximation of the quadratic function $Q({\mathbf x})=\sum_{j=1}^{d}x_j^2$ on simplices in $\RR^d$ of fixed volume is minimized on regular simplices.

Numerical Analysis · Mathematics 2011-01-14 Vladislav Babenko , Yuliya Babenko , Nataliya Parfinovych , Dmytro Skorokhodov

Let $X$ be a $d$-dimensional random vector and $X_\theta$ its projection onto the span of a set of orthonormal vectors $\{\theta_1,...,\theta_k\}$. Conditions on the distribution of $X$ are given such that if $\theta$ is chosen according to…

Probability · Mathematics 2011-02-16 Elizabeth Meckes

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

Numerical Analysis · Mathematics 2012-01-18 Massimo Fornasier , Karin Schnass , Jan Vybiral

Random simplices and more general random convex bodies of dimension $p$ in $\mathbb{R}^n$ with $p\leq n$ are considered, which are generated by random vectors having an elliptical distribution. In the high-dimensional regime, that is, if…

Probability · Mathematics 2023-08-17 Anna Gusakova , Johannes Heiny , Christoph Thäle

Consider a dataset of n(d) points generated independently from R^d according to a common p.d.f. f_d with support(f_d) = [0,1]^d and sup{f_d([0,1]^d)} growing sub-exponentially in d. We prove that: (i) if n(d) grows sub-exponentially in d,…

Databases · Computer Science 2009-09-01 Chris Giannella

Let $p$ be an unknown and arbitrary probability distribution over $[0,1)$. We consider the problem of {\em density estimation}, in which a learning algorithm is given i.i.d. draws from $p$ and must (with high probability) output a…

Machine Learning · Computer Science 2014-11-04 Siu-On Chan , Ilias Diakonikolas , Rocco A. Servedio , Xiaorui Sun

Let $m,n\in\mathbb{N}$ and $p\in(0,\infty)$. For a finite dimensional quasi-normed space $X=(\mathbb{R}^m, \|\cdot\|_X)$, let $$B_p^n(X) = \Big\{ (x_1,\ldots,x_n)\in\big(\mathbb{R}^{m}\big)^n: \ \sum_{i=1}^n \|x_i\|_X^p \leq 1\Big\}.$$ We…

Metric Geometry · Mathematics 2019-09-10 Alexandros Eskenazis

For arbitrary Borel probability measures on the real line, necessary and sufficient conditions are presented that characterize best purely atomic approximations relative to the classical Levy probability metric, given any number of atoms,…

Probability · Mathematics 2018-09-24 Arno Berger , Chuang Xu

The symmetric convex hull of random points that are independent and distributed according to the cone probability measure on the $\ell_p$-unit sphere of $\mathbb R^n$ for some $1\leq p < \infty$ is considered. We prove that these random…

Functional Analysis · Mathematics 2017-03-14 Julia Hörrmann , Joscha Prochno , Christoph Thaele

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

We consider the problem of subset selection for $\ell_{p}$ subspace approximation, that is, to efficiently find a \emph{small} subset of data points such that solving the problem optimally for this subset gives a good approximation to…

Machine Learning · Computer Science 2022-04-27 Amit Deshpande , Rameshwar Pratap

This paper derives central limit and bootstrap theorems for probabilities that sums of centered high-dimensional random vectors hit hyperrectangles and sparsely convex sets. Specifically, we derive Gaussian and bootstrap approximations for…

Statistics Theory · Mathematics 2016-03-09 Victor Chernozhukov , Denis Chetverikov , Kengo Kato
‹ Prev 1 4 5 6 7 8 10 Next ›