Related papers: Average best $m$-term approximation
In compressed sensing, in order to recover a sparse or nearly sparse vector from possibly noisy measurements, the most popular approach is $\ell_1$-norm minimization. Upper bounds for the $\ell_2$- norm of the error between the true and…
We develop a analytical and quantitative theory of the tube model concept for entangled networks of semiflexible polymers. The absolute value of the tube diameter L_perp is derived as a function of the polymers' persistence length l_p and…
We study approximation properties of sequences of centered random elements $X_d$, $d\in\mathbb N$, with values in separable Hilbert spaces. We focus on sequences of tensor product-type and, in particular, degree-type random elements, which…
We study the de la Vallee Poussin mean for exponential weights and give a polynomial approximation on real line. H. N. Mhasker proved the corresponding result for Freud-type weights. Our proof is valid for Erdos-type weights.
We present a general approach to the study of the local distribution of measures on Euclidean spaces, based on local entropy averages. As concrete applications, we unify, generalize, and simplify a number of recent results on local…
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distances rather than their actual values. Lower and upper bounds for…
Monte Carlo methods are used to approximate the means, $\mu$, of random variables $Y$, whose distributions are not known explicitly. The key idea is that the average of a random sample, $Y_1, ..., Y_n$, tends to $\mu$ as $n$ tends to…
In this paper, we prove a multivariate central limit theorem for $\ell_q$-norms of high-dimensional random vectors that are chosen uniformly at random in an $\ell_p^n$-ball. As a consequence, we provide several applications on the…
We considered the problem of obtaining upper bounds for the mathematical expectation of the $q$-norm ($2\leqslant q \leqslant \infty$) of the vector which is uniformly distributed on the unit Euclidean sphere. We finish the paper with…
We study the Teichm\"uller metric on the Teichm\"uller space of a surface of finite type, in regions where the injectivity radius of the surface is small. The main result is that in such regions the Teichm\"uller metric is approximated up…
We provide finite sample bounds on the Normal approximation to the law of the least squares estimator of the projection parameters normalized by the sandwich-based standard errors. Our results hold in the increasing dimension setting and…
We give a general unified method that can be used for $L_1$ {\em closeness testing} of a wide range of univariate structured distribution families. More specifically, we design a sample optimal and computationally efficient algorithm for…
The aim of this work is to introduced the concept of the best one-sided approximation of unbounded functions in weighted space by using algebraic operators in terms the average modulus of smoothness. We also show an estimate of the degree…
In this paper, we develop a computational approach for estimating the mean value of a quantity in the presence of uncertainty. We demonstrate that, under some mild assumptions, the upper and lower bounds of the mean value are efficiently…
We study a general smallest intersecting ball problem and its soft-margin variant in high-dimensional Euclidean spaces for input objects that are compact and convex. These two problems link and unify a series of fundamental problems in…
In a metric space $(X,d)$ we reconstruct an approximation of a Borel measure $\mu$ starting from a premeasure $q$ defined on the collection of closed balls, and such that $q$ approximates the values of $\mu$ on these balls. More precisely,…
Let $(X,\mathcal{B},m,\tau)$ be a dynamical system with $\ds (X,\mathcal{B},m)$ a probability space and $\ds \tau$ an invertible, measure preserving transformation. The present paper deals with the almost everywhere convergence in…
An important question in the theory of approximate integration is to study the conditions on the nodes $x_{k,n}$ and weights $w_{k,n}$ that allow an estimate of the form $$ \sup_{f\in \mathcal{B}_\gamma}|\sum_k…
In the past few years powerful generalizations to the Euclidean k-means problem have been made, such as Bregman clustering [7], co-clustering (i.e., simultaneous clustering of rows and columns of an input matrix) [9,18], and tensor…
For a given convex body K in $R^d$, a random polytope $K^{(n)}$ is defined (essentially) as the intersection of $n$ independent closed halfspaces containing $K$ and having an isotropic and (in a specified sense) uniform distribution. We…