Related papers: Random Sampling in reproducing kernel subspaces of…
In this article, we consider the random sampling in the image space $V$ of mixed Lebesgue space $L^{p,q}(\mathbb{R}^{n+1})$ under an idempotent integral operator. We assume some decay and regularity conditions of the kernel and approximate…
In this paper, we consider sampling and reconstruction of signals in a reproducing kernel subspace of $L^p(\Rd), 1\le p\le \infty$, associated with an idempotent integral operator whose kernel has certain off-diagonal decay and regularity.…
In this paper, we mainly study the random sampling stability for signals in a weighted reproducing kernel subspace of $L_\nu^p(\mathbb{R}^d)$ without the additional requirement that the kernel function has symmetry. The sampling set is…
The paper is devoted to studying the stability of random sampling in a localized reproducing kernel space. We show that if the sampling set on $\Omega$ (compact) discretizes the integral norm of simple functions up to a given error, then…
We analyse the convergence of sampling algorithms for functions in reproducing kernel Hilbert spaces (RKHS). To this end, we discuss approximation properties of kernel regression under minimalistic assumptions on both the kernel and the…
We characterize the reproducing kernel Hilbert spaces whose elements are $p$-integrable functions in terms of the boundedness of the integral operator whose kernel is the reproducing kernel. Moreover, for $p=2$ we show that the spectral…
We present sampling theorems for reproducing kernel Banach spaces on Lie groups. Recent approaches to this problem rely on integrability of the kernel and its local oscillations. In this paper we replace the integrability conditions by…
The Mixed Lebesgue space is a suitable tool for modelling and measuring signals living in time-space domains. And sampling in such spaces plays an important role for processing high-dimensional time-varying signals. In this paper, we first…
For the space of functions that can be approximated by linear chirps, we prove a reconstruction theorem by random sampling at arbitrary rates.
The recent developments of basis pursuit and compressed sensing seek to extract information from as few samples as possible. In such applications, since the number of samples is restricted, one should deploy the sampling points wisely. We…
We develop sampling formulas for high-dimensional functions in reproducing kernel Hilbert spaces, where we rely on irregular samples that are taken at determining sequences of data points. We place particular emphasis on sampling formulas…
This paper studies the probabilistic function approximation problem over reproducing kernel Hilbert spaces. We show the existence and uniqueness of the optimizer under mild assumptions. Furthermore, we generalize the celebrated representer…
In this paper, we consider (random) sampling of signals concentrated on a bounded Corkscrew domain $\Omega$ of a metric measure space, and reconstructing concentrated signals approximately from their (un)corrupted sampling data taken on a…
We describe a method to perform functional operations on probability distributions of random variables. The method uses reproducing kernel Hilbert space representations of probability distributions, and it is applicable to all operations…
This paper addresses the problem of approximating an unknown function from point evaluations. When obtaining these point evaluations is costly, minimising the required sample size becomes crucial, and it is unreasonable to reserve a…
We derive necessary density conditions for sampling and for interpolation in general reproducing kernel Hilbert spaces satisfying some natural conditions on the geometry of the space and the reproducing kernel. If the volume of shells is…
We study the approximation of a square-integrable function from a finite number of evaluations on a random set of nodes according to a well-chosen distribution. This is particularly relevant when the function is assumed to belong to a…
We consider the problem of learning a set from random samples. We show how relevant geometric and topological properties of a set can be studied analytically using concepts from the theory of reproducing kernel Hilbert spaces. A new kind of…
We show that kernel-based quadrature rules for computing integrals can be seen as a special case of random feature expansions for positive definite kernels, for a particular decomposition that always exists for such kernels. We provide a…
Random feature maps are used to decrease the computational cost of kernel machines in large-scale problems. The Mondrian kernel is one such example of a fast random feature approximation of the Laplace kernel, generated by a computationally…