Related papers: Metric duality between positive definite kernels a…
Gaussian processes (GP) are widely used as a metamodel for emulating time-consuming computer codes. We focus on problems involving categorical inputs, with a potentially large number L of levels (typically several tens), partitioned in G <<…
This article gives a new insight of kernel-based (approximation) methods to solve the high-dimensional stochastic partial differential equations. We will combine the techniques of meshfree approximation and kriging interpolation to extend…
We study duality relations for zeta and M\"{o}bius matrices and monotone conditions on the kernels. We focus on the cases of family of sets and partitions. The conditions for positivity of the dual kernels are stated in terms of the…
We consider weakly positive semidefinite kernels valued in ordered $*$-spaces with or without certain topological properties, and investigate their linearisations (Kolmogorov decompositions) as well as their reproducing kernel spaces. The…
There exists a plethora of parametric models for positive definite kernels, and their use is ubiquitous in disciplines as diverse as statistics, machine learning, numerical analysis, and approximation theory. Usually, the kernel parameters…
We extend the classical Mercer theorem to reproducing kernel Hilbert spaces whose elements are functions from a measurable space $X$into $\mathbb C^n$. Given a finite measure $\mu$ on $X$, we represent the reproducing kernel $K$ as…
The kernel mean embedding of probability distributions is commonly used in machine learning as an injective mapping from distributions to functions in an infinite dimensional Hilbert space. It allows us, for example, to define a distance…
A number of years ago, Kumar Murty pointed out to me that the computation of the fundamental group of a Hilbert modular surface ([7],IV,${\S}$6), and the computation of the congruence subgroup kernel of SL(2) ([6]) were surprisingly…
An important feature of kernel mean embeddings (KME) is that the rate of convergence of the empirical KME to the true distribution KME can be bounded independently of the dimension of the space, properties of the distribution and smoothness…
Let $X$ be a Banach space, let $(\Omega,\mu)$ be a $\sigma$-finite measure space and let $A,B\colon\Omega\to B(X)$ be strongly measurable $\gamma$-bounded functions. We show that for all $x\in X$ and all $x^*\in X^*$, there exist a Hilbert…
Kernel methods in machine learning use a kernel function that takes two data points as input and returns their inner product after mapping them to a Hilbert space, implicitly and without actually computing the mapping. For many kernel…
In the paper we investigate a method of quantization based on the concept of positive definite kernel on a principal $G$-bundle with compact structural group G. For G=U(1) our approach leads to Kostant-Souriau geometric quantization as well…
We prove that the optimal assignment kernel, proposed recently as an attempt to embed labeled graphs and more generally tuples of basic data to a Hilbert space, is in fact not always positive definite.
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…
Starting with a similarity function between objects, it is possible to define a distance metric on pairs of objects, and more generally on probability distributions over them. These distance metrics have a deep basis in functional analysis,…
We focus on kernel methods for set-valued inputs and their application to Bayesian set optimization, notably combinatorial optimization. We investigate two classes of set kernels that both rely on Reproducing Kernel Hilbert Space…
In this paper, we describe families of those bounded linear operators on a separable Hilbert space that are simultaneously unitarily equivalent to integral operators on $L_2(R)$ with bounded and arbitrarily smooth Carleman kernels. The main…
With the advent of kernel methods, automating the task of specifying a suitable kernel has become increasingly important. In this context, the Multiple Kernel Learning (MKL) problem of finding a combination of pre-specified base kernels…
Let X be a strictly pseudoconcave domain in a closed polarized complex manifold (Y,L) where L is a (semi-)positive line bundle over Y. Any given Hermitian metric on L, together with a volume form, induces by restriction to X a Hilbert space…
We tackle the problem of optimizing over all possible positive definite radial kernels on Riemannian manifolds for classification. Kernel methods on Riemannian manifolds have recently become increasingly popular in computer vision. However,…