Related papers: Random Sampling in reproducing kernel subspaces of…

We study kernel functions, and associated reproducing kernel Hilbert spaces $\mathscr{H}$ over infinite, discrete and countable sets $V$. Numerical analysis builds discrete models (e.g., finite element) for the purpose of finding…

A fundamental task in kernel methods is to pick nodes and weights, so as to approximate a given function from an RKHS by the weighted sum of kernel translates located at the nodes. This is the crux of kernel density estimation, kernel…

In a general context of positive definite kernels $k$, we develop tools and algorithms for sampling in reproducing kernel Hilbert space $\mathscr{H}$ (RKHS). With reference to these RKHSs, our results allow inference from samples; more…

We provide the first mathematically complete derivation of the Nystr\"om method for low-rank approximation of indefinite kernels and propose an efficient method for finding an approximate eigendecomposition of such kernel matrices. Building…

In this paper, we illustrate the effectiveness of reproducing kernel Hilbert space techniques in the study of composition operators. For weighted Hardy spaces on the unit disk, we characterize the composition operators whose adjoint is…

We show that sampling or interpolation formulas in reproducing kernel Hilbert spaces can be obtained by reproducing kernels whose dual systems form molecules, ensuring that the size profile of a function is fully reflected by the size…

This paper addresses the problem of regression to reconstruct functions, which are observed with superimposed errors at random locations. We address the problem in reproducing kernel Hilbert spaces. It is demonstrated that the estimator,…

This note consists of two largely independent parts. In the first part we give conditions on the kernel $k: \Omega \times \Omega \rightarrow \mathbb{R}$ of a reproducing kernel Hilbert space $H$ continuously embedded via the identity…

Devoted to multi-task learning and structured output learning, operator-valued kernels provide a flexible tool to build vector-valued functions in the context of Reproducing Kernel Hilbert Spaces. To scale up these methods, we extend the…

We consider frames F in a given Hilbert space, and we show that every F may be obtained in a constructive way from a reproducing kernel and an orthonormal basis in an ambient Hilbert space. The construction is operator-theoretic, building…

We study reproducing kernels, and associated reproducing kernel Hilbert spaces (RKHSs) $\mathscr{H}$ over infinite, discrete and countable sets $V$. In this setting we analyze in detail the distributions of the corresponding Dirac…

This paper focuses on the use of the theory of Reproducing Kernel Hilbert Spaces in the statistical analysis of replicated point processes. We show that spatial point processes can be observed as random variables in a Reproducing Kernel…

Random feature approximation is arguably one of the most popular techniques to speed up kernel methods in large scale algorithms and provides a theoretical approach to the analysis of deep neural networks. We analyze generalization…

In the article we study properties of the random integral operator in $L_2(\mathbb{R})$ whose kernel is obtained as a convolution of Gaussian density with a stationary point process.

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 study classes of reproducing kernels $K$ on general domains; these are kernels which arise commonly in machine learning models; models based on certain families of reproducing kernel Hilbert spaces. They are the positive definite kernels…

We study how iterated and composed completely positive maps act on operator-valued kernels. Each kernel is realized inside a single Hilbert space where composition corresponds to applying bounded creation operators to feature vectors. This…

Kernel mean embeddings, a widely used technique in machine learning, map probability distributions to elements of a reproducing kernel Hilbert space (RKHS). For supervised learning problems, where input-output pairs are observed, the…

This paper studies the construction of a refinement kernel for a given operator-valued reproducing kernel such that the vector-valued reproducing kernel Hilbert space of the refinement kernel contains that of the given one as a subspace.…

We introduce a vector differential operator $\mathbf{P}$ and a vector boundary operator $\mathbf{B}$ to derive a reproducing kernel along with its associated Hilbert space which is shown to be embedded in a classical Sobolev space. This…