Related papers: Weighted sampling recovery of functions with mixed…

Let $\mathbb{T}^d$ denote the $d$-dimensional torus. We consider the problem of optimally recovering a target function $f^*:\mathbb{T}^d\rightarrow \mathbb{C}$ from samples of its Fourier coefficients. We make classical smoothness…

In this paper we study the sampling recovery problem for certain relevant multivariate function classes which are not compactly embedded into $L_\infty$. Recent tools relating the sampling numbers to the Kolmogorov widths in the uniform…

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…

We give a row sampling algorithm for the quantile loss function with sample complexity nearly linear in the dimensionality of the data, improving upon the previous best algorithm whose sampling complexity has at least cubic dependence on…

We consider the problem of reconstructing an unknown function $u\in L^2(D,\mu)$ from its evaluations at given sampling points $x^1,\dots,x^m\in D$, where $D\subset \mathbb R^d$ is a general domain and $\mu$ a probability measure. The…

Least-squares approximation is one of the most important methods for recovering an unknown function from data. While in many applications the data is fixed, in many others there is substantial freedom to choose where to sample. In this…

Let $\xi = \{x^j\}_{j=1}^n$ be a grid of $n$ points in the $d$-cube ${\II}^d:=[0,1]^d$, and $\Phi = \{\phi_j\}_{j =1}^n$ a family of $n$ functions on ${\II}^d$. We define the linear sampling algorithm $L_n(\Phi,\xi,\cdot)$ for an…

We introduce a sampling theoretic framework for the recovery of smooth surfaces and functions living on smooth surfaces from few samples. The proposed approach can be thought of as a nonlinear generalization of union of subspace models…

We proved direct and inverse theorems on B-spline quasi-interpolation sampling representation with a Littlewood-Paley-type norm equivalence in Sobolev spaces $W^r_p$ of mixed smoothness $r$, established estimates of the approximation error…

We introduce a probability distribution, combined with an efficient sampling algorithm, for weights and biases of fully-connected neural networks. In a supervised learning context, no iterative optimization or gradient computations of…

We construct a least squares approximation method for the recovery of complex-valued functions from a reproducing kernel Hilbert space on $D \subset \mathbb{R}^d$. The nodes are drawn at random for the whole class of functions and the error…

We consider the task of recovering a Sobolev function on a connected compact Riemannian manifold $M$ when given a sample on a finite point set. We prove that the quality of the sample is given by the $L_\gamma(M)$-average of the geodesic…

We study the matrix completion problem when the observation pattern is deterministic and possibly non-uniform. We propose a simple and efficient debiased projection scheme for recovery from noisy observations and analyze the error under a…

It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we…

We consider $L^2$-approximation on weighted reproducing kernel Hilbert spaces of functions depending on infinitely many variables. We focus on unrestricted linear information, admitting evaluations of arbitrary continuous linear…

We investigate the approximation of generalized Laguerre- or Laplace-weighted integrals over $\mathbb{R}^d_+$ or $\mathbb{R}^d$ of functions from generalized Laguerre- or Laplace-weighted Sobolev spaces of mixed smoothness, respectively. We…

Compressed sensing deals with the recovery of sparse signals from linear measurements. Without any additional information, it is possible to recover an $s$-sparse signal using $m \gtrsim s \log(d/s)$ measurements in a robust and stable way.…

Given any domain $X\subseteq \mathbb{R}^d$ and a probability measure $\rho$ on $X$, we study the problem of approximating in $L^2(X,\rho)$ a given function $u:X\to\mathbb{R}$, using its noiseless pointwise evaluations at random samples. For…

This paper is a direct followup of the recent author's paper. In this paper we continue to analyze approximation and recovery properties with respect to systems satisfying universal sampling discretization property and a special…

This paper concerns with iterative schemes for the perfect reconstruction of functions belonging to multiresolution spaces on bounded manifolds from nonuniform sampling. The schemes have optimal complexity in the sense that the…