Related papers: The Mercer-Young Theorem for Matrix-Valued Kernels…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
We establish two versions of a central theorem, the Family Colimit Theorem, for the coarse coherence property of metric spaces. This is a coarse geometric property and so is well-defined for finitely generated groups with word metrics. It…
The use of kernels for nonlinear prediction is widespread in machine learning. They have been popularized in support vector machines and used in kernel ridge regression, amongst others. Kernel methods share three aspects. First, instead of…
A kernelization is an efficient algorithm that given an instance of a parameterized problem returns an equivalent instance of size bounded by some function of the input parameter value. It is quite well understood which problems do or…
In data science, individual observations are often assumed to come independently from an underlying probability space. Kernel matrices formed from large sets of such observations arise frequently, for example during classification tasks. It…
A matrix A is image partition regular over Q provided that whenever Q - {0} is finitely coloured, there is a vector x with entries in Q - {0} such that the entries of Ax are monochromatic. It is kernel partition regular over Q provided that…
For a given positive integer $m$, the concept of hyperdeterminantal total positivity is defined for a kernel $K\colon {\mathbb R}^{2m} \to {\mathbb R}$, thereby generalizing the classical concept of total positivity. Extending the…
We introduce and study a class $\mathcal{M}$ of generalized positive definite kernels of the form $K\colon X\times X\to L(\mathfrak{A},L(H))$, where $\mathfrak{A}$ is a unital $C^{*}$-algebra and $H$ a Hilbert space. These kernels encode…
We study the positive-definiteness of a family of $L^2(\mathbf{R})$ integral operators with kernel $K_{t, a}(x, y) = (1 + (x - y)^2 + a(x^2 + y^2)^t)^{-1}$, with $t > 0$ and $a > 0$. When $0 < t \le 1$, the known theory of positive-definite…
Symmetry arises often when learning from high dimensional data. For example, data sets consisting of point clouds, graphs, and unordered sets appear routinely in contemporary applications, and exhibit rich underlying symmetries.…
Mirsky proved that, for the existence of a complex matrix with given eigenvalues and diagonal entries, the obvious necessary condition is also sufficient. We generalize this theorem to matrices over any field and provide a short proof.…
Let $(A,\mathfrak{m})$ be a Noetherian local ring, $M$ a finite $A$-module and $x_1,...,x_n\in \m$ such that $\lambda (M/\x M)$ is finite. Serre proved that all partial Euler characteristics of $M$ with respect to $\x$ is non-negative. This…
We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree…
Positive definite kernels and their associated Reproducing Kernel Hilbert Spaces provide a mathematically compelling and practically competitive framework for learning from data. In this paper we take the approximation theory point of view…
We prove general kernel theorems for operators acting between coorbit spaces. These are Banach spaces associated to an integrable representation of a locally compact group and contain most of the usual function spaces (Besov spaces,…
The present work develops certain analytical tools required to construct and compute invariant kernels on the space of complex covariance matrices. The main result is the $\mathrm{L}^1$--Godement theorem, which states that any invariant…
We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers.…
We introduce a natural concept of positive definiteness for bundle maps between Fell bundles over (possibly different) discrete groups and describe several examples. Such maps induce completely positive maps between the associated full…
This paper introduces a new kernel-based classifier by viewing kernel matrices as generalized graphs and leveraging recent progress in graph embedding techniques. The proposed method facilitates fast and scalable kernel matrix embedding,…
We analyze the Nystr\"om approximation of a positive definite kernel associated with a probability measure. We first prove an improved error bound for the conventional Nystr\"om approximation with i.i.d. sampling and singular-value…