English
Related papers

Related papers: Universal sampling discretization

200 papers

The new ingredient of this paper is that we consider infinitely dimensional classes of functions and instead of the relative error setting, which was used in previous papers on norm discretization, we consider the absolute error setting. We…

Numerical Analysis · Mathematics 2018-12-20 Vladimir Temlyakov

We show that independent and uniformly distributed sampling points are as good as optimal sampling points for the approximation of functions from the Sobolev space $W_p^s(\Omega)$ on bounded convex domains $\Omega\subset \mathbb{R}^d$ in…

Numerical Analysis · Mathematics 2023-02-02 David Krieg , Mathias Sonnleitner

Recently, it has been discovered that results on universal sampling discretization of the square norm are useful in sparse sampling recovery with error being measured in the square norm. It was established that a simple greedy type…

Numerical Analysis · Mathematics 2023-07-11 F. Dai , V. Temlyakov

For a class $F$ of complex-valued functions on a set $D$, we denote by $g_n(F)$ its sampling numbers, i.e., the minimal worst-case error on $F$, measured in $L_2$, that can be achieved with a recovery algorithm based on $n$ function…

Numerical Analysis · Mathematics 2023-05-15 Matthieu Dolbeault , David Krieg , Mario Ullrich

Given an open subset $\Omega$ of a Banach space and a Lipschitz function $u_0: \overline{\Omega} \to \mathbb{R},$ we study whether it is possible to approximate $u_0$ uniformly on $\Omega$ by $C^k$-smooth Lipschitz functions which coincide…

Functional Analysis · Mathematics 2019-02-22 Robert Deville , Carlos Mudarra

In this paper we study $L_2$-norm sampling discretization and sampling recovery of complex-valued functions in RKHS on $D \subset \R^d$ based on random function samples. We only assume the finite trace of the kernel (Hilbert-Schmidt…

Numerical Analysis · Mathematics 2021-05-03 Moritz Moeller , Tino Ullrich

We obtain new sampling discretization results in Orlicz norms on finite dimensional spaces. As applications, we study sampling recovery problems, where the error of the recovery process is calculated with respect to different Orlicz norms.…

Functional Analysis · Mathematics 2024-08-27 Egor Kosov , Sergey Tikhonov

Error bounds are derived for sampling and estimation using a discretization of an intrinsically defined Langevin diffusion with invariant measure $\text{d}\mu_\phi \propto e^{-\phi} \mathrm{dvol}_g $ on a compact Riemannian manifold. Two…

Statistics Theory · Mathematics 2025-12-10 Karthik Bharath , Alexander Lewis , Akash Sharma , Michael V Tretyakov

We consider in this paper the problem of sampling a high-dimensional probability distribution $\pi$ having a density with respect to the Lebesgue measure on $\mathbb{R}^d$, known up to a normalization constant $x \mapsto \pi(x)=…

Statistics Theory · Mathematics 2018-07-17 Alain Durmus , Eric Moulines

We provide a new upper bound for sampling numbers $(g_n)_{n\in \mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants…

Numerical Analysis · Mathematics 2021-02-11 Nicolas Nagel , Martin Schäfer , Tino Ullrich

Let $S\subset\R^d$ be a bounded subset with positive Lebesgue measure. The Paley-Wiener space associated to $S$, $PW_S$, is defined to be the set of all square-integrable functions on $\R^d$ whose Fourier transforms vanish outside $S$. A…

Classical Analysis and ODEs · Mathematics 2010-01-25 A. Bailey , Th. Schlumprecht , N. Sivakumar

Discretization of continuous-time diffusion processes is a widely recognized method for sampling. However, it seems to be a considerable restriction when the potentials are often required to be smooth (gradient Lipschitz). This paper…

Computation · Statistics 2022-02-23 Dao Nguyen

We derive fundamental sampling bounds for smooth signals in continuous settings without sparsity assumptions. By introducing the Fourier ratio as a measure of spectral compressibility induced by smoothness, we obtain explicit, deterministic…

Classical Analysis and ODEs · Mathematics 2026-01-27 A. Iosevich , E. Palsson , A. Yavicoli

We study the recovery of multivariate functions from reproducing kernel Hilbert spaces in the uniform norm. Our main interest is to obtain preasymptotic estimates for the corresponding sampling numbers. We obtain results in terms of the…

Numerical Analysis · Mathematics 2024-10-29 Kateryna Pozharska , Tino Ullrich

We present novel bounds for estimating discrete probability distributions under the $\ell_\infty$ norm. These are nearly optimal in various precise senses, including a kind of instance-optimality. Our data-dependent convergence guarantees…

Statistics Theory · Mathematics 2024-02-14 Aryeh Kontorovich , Amichai Painsky

Let $\mu$ be a Borel probability measure on a compact path-connected metric space $(X, \rho)$ for which there exist constants $c,\beta>1$ such that $\mu(B) \geq c r^{\beta}$ for every open ball $B\subset X$ of radius $r>0$. For a class of…

Numerical Analysis · Mathematics 2021-05-07 Martin Buhmann , Feng Dai , Yeli Niu

Let $\xi_0,\xi_1,...$ be independent identically distributed (i.i.d.) random variables such that $\E \log (1+|\xi_0|)<\infty$. We consider random analytic functions of the form $$ G_n(z)=\sum_{k=0}^{\infty} \xi_k f_{k,n} z^k, $$ where…

Probability · Mathematics 2012-10-02 Zakhar Kabluchko , Dmitry Zaporozhets

The problem of replacing an integral norm with respect to a given probability measure by the corresponding integral norm with respect to a discrete measure is discussed in the paper. The above problem is studied for elements of finite…

Numerical Analysis · Mathematics 2019-11-01 F. Dai , A. Prymak , V. N. Temlyakov , S. Tikhonov

We consider best approximation problems in a nonlinear subset $\mathcal{M}$ of a Banach space of functions $(\mathcal{V},\|\bullet\|)$. The norm is assumed to be a generalization of the $L^2$-norm for which only a weighted Monte Carlo…

Numerical Analysis · Mathematics 2021-05-13 Martin Eigel , Reinhold Schneider , Philipp Trunschke

Universal hash functions map the output of a source to random strings over a finite alphabet, aiming to approximate the uniform distribution on the set of strings. A classic result on these functions, called the Leftover Hash Lemma, gives…

Information Theory · Computer Science 2026-01-05 Madhura Pathegama , Alexander Barg