Related papers: The k-Point Random Matrix Kernels Obtained from On…

The Grassmannian manifold G(k, n) serves as a fundamental tool in signal processing, computer vision, and machine learning, where problems often involve classifying, clustering, or comparing subspaces. In this work, we propose a…

We present a novel scheme to accurately predict atomic forces as vector quantities, rather than sets of scalar components, by Gaussian Process (GP) Regression. This is based on matrix-valued kernel functions, on which we impose the…

Learning with kernels is an important concept in machine learning. Standard approaches for kernel methods often use predefined kernels that require careful selection of hyperparameters. To mitigate this burden, we propose in this paper a…

We consider the problem of computation of the correlation functions for the z-measures with the deformation (Jack) parameters 2 or 1/2. Such measures on partitions are originated from the representation theory of the infinite symmetric…

Selecting optimal kernels for regression in physical systems remains a challenge, often relying on trial-and-error with standard functions. In this work, we establish a mathematical correspondence between support vector machine kernels and…

We present simple, user-friendly bounds for the expected operator norm of a random kernel matrix under general conditions on the kernel function $k(\cdot,\cdot)$. Our approach uses decoupling results for U-statistics and the non-commutative…

We derive the limiting matrix kernels for the the Gaussian Orthogonal and Symplectic ensembles scaled at the edge, with proofs of convergence in the operator norms that assure convergence of the determinants.

Let $G_\Gamma$ be a graph product over a finite simplicial graph $\Gamma$, and let $K_\Gamma$ denote the kernel of the canonical homomorphism from $G_\Gamma$ to the direct product of its vertex groups. It is known that, up to isomorphism,…

Quantum computing algorithms have been shown to produce performant quantum kernels for machine-learning classification problems. Here, we examine the performance of quantum kernels for regression problems of practical interest. For an…

In this article a surprising result is demonstrated using the neural tangent kernel. This kernel is defined as the inner product of the vector of the gradient of an underlying model evaluated at training points. This kernel is used to…

We study quantum neural networks made by parametric one-qubit gates and fixed two-qubit gates in the limit of infinite width, where the generated function is the expectation value of the sum of single-qubit observables over all the qubits.…

We show how two-point correlation functions derived within non-isotropic random wave models are in fact quantum results that are obtained in the appropriate limit in terms of the exact Green function of the quantum system. Since no…

Given only information in the form of similarity triplets "Object A is more similar to object B than to object C" about a data set, we propose two ways of defining a kernel function on the data set. While previous approaches construct a…

Bayesian model updating based on Gaussian Process (GP) models has received attention in recent years, which incorporates kernel-based GPs to provide enhanced fidelity response predictions. Although most kernel functions provide high fitting…

A very elementary model of a single positive hermitian random matrix coupled to an external matrix is defined and studied. Expanding the exact effective action around its classical solution leads to the ``quantum Penner action'', from which…

Analysing and computing with Gaussian processes arising from infinitely wide neural networks has recently seen a resurgence in popularity. Despite this, many explicit covariance functions of networks with activation functions used in modern…

Gaussian Processes (GPs) are known to provide accurate predictions and uncertainty estimates even with small amounts of labeled data by capturing similarity between data points through their kernel function. However traditional GP kernels…

Bleher and Kuijlaars, and Daems and Kuijlaars showed that the correlation functions of the eigenvalues of a random matrix from unitary ensemble with external source can be expressed in terms of the Christoffel-Darboux kernel for multiple…

Additive models play an important role in semiparametric statistics. This paper gives learning rates for regularized kernel based methods for additive models. These learning rates compare favourably in particular in high dimensions to…

A general, {\em rectangular} kernel matrix may be defined as $K_{ij} = \kappa(x_i,y_j)$ where $\kappa(x,y)$ is a kernel function and where $X=\{x_i\}_{i=1}^m$ and $Y=\{y_i\}_{i=1}^n$ are two sets of points. In this paper, we seek a low-rank…