Related papers: Metric duality between positive definite kernels a…
Stochastic processes are random variables with values in some space of paths. However, reducing a stochastic process to a path-valued random variable ignores its filtration, i.e. the flow of information carried by the process through time.…
Kernel methods, being supported by a well-developed theory and coming with efficient algorithms, are among the most popular and successful machine learning techniques. From a mathematical point of view, these methods rest on the concept of…
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…
We show that if a reproducing kernel Hilbert space $H_K,$ consisting of functions defined on ${\bf E},$ enjoys Double Boundary Vanishing Condition (DBVC) and Linear Independent Condition (LIC), then for any preset natural number $n,$ and…
In this work a linearly constrained minimization of a positive semidefinite quadratic functional is examined. Our results are concerning infinite dimensional real Hilbert spaces, with a singular positive operator related to the functional,…
3D action recognition was shown to benefit from a covariance representation of the input data (joint 3D positions). A kernel machine feed with such feature is an effective paradigm for 3D action recognition, yielding state-of-the-art…
We study positive definiteness of kernels $K(x,y)$ on two-point homogeneous spaces. As opposed to the classical case, which has been developed and studied in the existing literature, we allow the kernel to have an (integrable) singularity…
This paper presents a framework for computing random operator-valued feature maps for operator-valued positive definite kernels. This is a generalization of the random Fourier features for scalar-valued kernels to the operator-valued case.…
Kernelization studies polynomial-time preprocessing algorithms. Over the last 20 years, the most celebrated positive results of the field have been linear kernels for classical NP-hard graph problems on sparse graph classes. In this paper,…
In this short letter we present the construction of a bi-stochastic kernel p for an arbitrary data set X that is derived from an asymmetric affinity function {\alpha}. The affinity function {\alpha} measures the similarity between points in…
Any applied mathematical model contains parameters. The paper proposes to use kernel learning for the parametric analysis of the model. The approach consists in setting a distribution on the parameter space, obtaining a finite training…
We propose and investigate bounds on quantum process fidelity of quantum filters, i.e. probabilistic quantum operations represented by a single Kraus operator K. These bounds generalize the Hofmann bounds on quantum process fidelity of…
The paper introduces a new characterisation of strictly positive definiteness for kernels on the 2-sphere without assuming the kernel to be radially (isotropic) or axially symmetric. The results use the series expansion of the kernel in…
Matrix approximations are a key element in large-scale algebraic machine learning approaches. The recently proposed method MEKA (Si et al., 2014) effectively employs two common assumptions in Hilbert spaces: the low-rank property of an…
In this paper we analyze the covariance kernel of the Gaussian process that arises as the limit of fluctuations of linear spectral statistics for Wigner matrices with a few moments. More precisely, the process we study here corresponds to…
We introduce a method to construct general multivariate positive definite kernels on a nonempty set $X$ that employs a prescribed bounded completely monotone function and special multivariate functions on $X$.\ The method is consistent with…
Boundary element methods for elliptic partial differential equations typically lead to boundary integral operators with translation-invariant kernel functions. Taking advantage of this property is fairly simple for particle methods, e.g.,…
Various methods in statistical learning build on kernels considered in reproducing kernel Hilbert spaces. In applications, the kernel is often selected based on characteristics of the problem and the data. This kernel is then employed to…
In a parameterized problem, every instance I comes with a positive integer k. The problem is said to admit a polynomial kernel if, in polynomial time, one can reduce the size of the instance I to a polynomial in k, while preserving the…
We study two extension problems, and their interconnections: (i) extension of positive definite (p.d.) continuous functions defined on subsets in locally compact groups $G$; and (ii) (in case of Lie groups $G$) representations of the…