Related papers: Function-measure kernels, self-integrability and u…
In the last few years, various types of machine learning algorithms, such as Support Vector Machine (SVM), Support Vector Regression (SVR), and Non-negative Matrix Factorization (NMF) have been introduced. The kernel approach is an…
The Gaussian kernel plays a central role in machine learning, uncertainty quantification and scattered data approximation, but has received relatively little attention from a numerical analysis standpoint. The basic problem of finding an…
We propose a novel kernel-based nonparametric two-sample test, employing the combined use of kernel mean and kernel covariance embedding. Our test builds on recent results showing how such combined embeddings map distinct probability…
We construct and analyze conformally invariant random fields on 4-dimensional Riemannian manifolds $(M,g)$. These centered Gaussian fields $h$, called \emph{co-biharmonic Gaussian fields}, are characterized by their covariance kernels $k$…
Conditionally positive definite (CPD) kernels are defined with respect to a function class $\mathcal{F}$. It is well known that such a kernel $K$ is associated with its native space (defined analogously to an RKHS), which in turn gives rise…
Analyzing the structure of sampled features from an input data distribution is challenging when constrained by limited measurements in both the number of inputs and features. Traditional approaches often rely on the eigenvalue spectrum of…
Every invertible, measure-preserving dynamical system induces a Koopman operator, which is a linear, unitary evolution operator acting on the $L^2$ space of observables associated with the invariant measure. Koopman eigenfunctions represent…
We study embeddings between reproducing kernel Hilbert spaces $H(K)$ of functions of $d \in \mathbb{N} \cup \{\infty\}$ variables. The kernels $K$ are superpositions of weighted finite tensor products of a fixed univariate kernel. The basic…
Kernel density estimation (KDE) is one of the most widely used nonparametric density estimation methods. The fact that it is a memory-based method, i.e., it uses the entire training data set for prediction, makes it unsuitable for most…
K-means defines one of the most employed centroid-based clustering algorithms with performances tied to the data's embedding. Intricate data embeddings have been designed to push $K$-means performances at the cost of reduced theoretical…
This paper examines robust functional data analysis for discretely observed data, where the underlying process encompasses various distributions, such as heavy tail, skewness, or contaminations. We propose a unified robust concept of…
Ordinary differential equation (ODE) is widely used in modeling biological and physical processes in science. In this article, we propose a new reproducing kernel-based approach for estimation and inference of ODE given noisy observations.…
Deep kernel learning combines the non-parametric flexibility of kernel methods with the inductive biases of deep learning architectures. We propose a novel deep kernel learning model and stochastic variational inference procedure which…
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…
We present a kernel-based methodology for constructing Lyapunov functions for nonlinear dynamical systems using approximate Koopman eigenfunctions. Our approach decomposes principal Koopman eigenfunctions into linear and nonlinear…
We consider the classical dynamics given by a one sided shift on the Bernoulli space of $d$ symbols. We study, on the space of H\"older functions, the eigendistributions of the Ruelle operator with a given potential. Our main theorem shows…
In this paper, by mapping datasets to a set of non-linear coherent states, the process of encoding inputs in quantum states as a non-linear feature map is re-interpreted. As a result of this fact that the Radial Basis Function is recovered…
The $k$th projection function $v_k(K,\cdot)$ of a convex body $K\subset {\mathbb R}^d, d\ge 3,$ is a function on the Grassmannian $G(d,k)$ which measures the $k$-dimensional volume of the projection of $K$ onto members of $G(d,k)$. For…
We propose a goodness-of-fit measure for probability densities modeling observations with varying dimensionality, such as text documents of differing lengths or variable-length sequences. The proposed measure is an instance of the kernel…
Kernel mean embeddings are a popular tool that consists in representing probability measures by their infinite-dimensional mean embeddings in a reproducing kernel Hilbert space. When the kernel is characteristic, mean embeddings can be used…