Related papers: Interpolation with uncoupled separable matrix-valu…
We consider the theory of bond discounts, defined as the difference between the terminal payoff of the contract and its current price. Working in the setting of finite-dimensional realizations in the HJM framework, under suitable notions of…
Multi-kernel learning (MKL) has been widely used in function approximation tasks. The key problem of MKL is to combine kernels in a prescribed dictionary. Inclusion of irrelevant kernels in the dictionary can deteriorate accuracy of MKL,…
We show that polynomials do not belong to the reproducing kernel Hilbert space of infinitely differentiable translation-invariant kernels whose spectral measures have moments corresponding to a determinate moment problem. Our proof is based…
Hilbertian kernel methods and their positive semidefinite kernels have been extensively used in various fields of applied mathematics and machine learning, owing to their several equivalent characterizations. We here unveil an analogy with…
We describe those reproducing kernel Hilbert spaces of holomorphic functions on domains in ${\Bbb C}^d$ for which an analogue of the Nevanlinna-Pick theorem holds, in other words when the existence of a (possibly matrix-valued) function in…
The role of kernels is central to machine learning. Motivated by the importance of power-law distributions in statistical modeling, in this paper, we propose the notion of power-law kernels to investigate power-laws in learning problem. We…
Kernel approximation methods create explicit, low-dimensional kernel feature maps to deal with the high computational and memory complexity of standard techniques. This work studies a supervised kernel learning methodology to optimize such…
A multilevel kernel-based interpolation method, suitable for moderately high-dimensional function interpolation problems, is proposed. The method, termed multilevel sparse kernel-based interpolation (MLSKI, for short), uses both level-wise…
Quantum kernel methods leverage a kernel function computed by embedding input information into the Hilbert space of a quantum system. However, large Hilbert spaces can hinder generalization capability, and the scalability of quantum kernels…
Panel-based, kernel-split quadrature is currently one of the most efficient methods available for accurate evaluation of singular and nearly singular layer potentials in two dimensions. However, it can fail completely for the layer…
We present eigenvalue decay estimates of integral operators associated with compositional dot-product kernels. The estimates improve on previous ones established for power series kernels on spheres. This allows us to obtain the volumes of…
In recent years, various kernels have been proposed in the context of persistent homology to deal with persistence diagrams in supervised learning approaches. In this paper, we consider the idea of variably scaled kernels, for approximating…
Despite the increasing importance of stochastic processes on linear networks and graphs, current literature on multivariate (vector-valued) Gaussian random fields on metric graphs is elusive. This paper challenges several aspects related to…
We find probability error bounds for approximations of functions $f$ in a separable reproducing kernel Hilbert space $\mathcal{H}$ with reproducing kernel $K$ on a base space $X$, firstly in terms of finite linear combinations of functions…
In this paper, we study random sampling on reproducing kernel space $V$, which is a range of an idempotent integral operator. Under certain decay condition on the integral kernel, we show that any element in $V$ can be approximated by an…
We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…
In this paper we present a new algorithm for multivariate interpolation of scattered data sets lying in convex domains $\Omega \subseteq \RR^N$, for any $N \geq 2$. To organize the points in a multidimensional space, we build a $kd$-tree…
Learning representations of nodes in a low dimensional space is a crucial task with numerous interesting applications in network analysis, including link prediction, node classification, and visualization. Two popular approaches for this…
We consider quasi-interpolation with a main application in radial basis function approximations and compression in this article. Constructing and using these quasi-interpolants, we consider wavelet and compression-type approximations from…
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…