Related papers: Optimizing generalized kernels of polygons
A \emph{rational orthogonal matrix} $Q$ is an orthogonal matrix with rational entries, and $Q$ is called \emph{regular} if each of its row sum equals one, i.e., $Qe = e$ where $e$ is the all-one vector. This paper presents a method for…
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and practical constraints associated with point clouds in computer…
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 Quantum Approximate Optimisation Algorithm is a $p$ layer, time-variable split operator method executed on a quantum processor and driven to convergence by classical outer loop optimisation. The classical co-processor varies individual…
The $p-$Bergman kernel $K_p(\cdot)$ is shown to be of $C^{1,1/2}$ for $1<p<\infty$. An unexpected relation between the off-diagonal $p-$Bergman kernel $K_p(\cdot,z)$ and certain weighted $L^2$ Bergman kernel is given for $1\le p\le 2$. As…
There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees,…
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.…
Orientations of supersingular elliptic curves encode the information of an endomorphism of the curve. Computing the full endomorphism ring is a known hard problem, so one might consider how hard it is to find one such orientation. We prove…
The wide applicability of kernels makes the problem of max-kernel search ubiquitous and more general than the usual similarity search in metric spaces. We focus on solving this problem efficiently. We begin by characterizing the inherent…
We consider the eigenvalue problem of certain kind of non-compact linear operators given as the sum of a multiplication and a kernel operator. A degenerate kernel method is used to approximate isolated eigenvalues. It is shown that entries…
The goal of this note is to explore the Bergman projection on forms. In particular, we show that some of most basic facts used to construct the Bergman kernel on functions, such as pointwise evaluation in…
For $1 \le t < \infty ,$ a compact subset $K$ of the complex plane $\mathbb C,$ and a finite positive measure $\mu$ supported on $K,$ $R^t(K, \mu)$ denotes the closure in $L^t (\mu )$ of rational functions with poles off $K$. Let $\Omega$…
Random feature maps are used to decrease the computational cost of kernel machines in large-scale problems. The Mondrian kernel is one such example of a fast random feature approximation of the Laplace kernel, generated by a computationally…
We present a structural resolution to the exact evaluation of the partition function $p_k(n)$, systematically overcoming the limitations of traditional recursive and asymptotic methods. By framing the partition polytope $\mathcal{P}_{n,k}$…
We study Bergman kernels $K_\Pi$ and projections $P_\Pi$ in unbounded planar domains $\Pi$, which are periodic in one dimension. In the case $\Pi$ is simply connected we write the kernel $K_\Pi$ in terms of a Riemann mapping $\varphi$…
Approximation/interpolation from spaces of positive definite or conditionally positive definite kernels is an increasingly popular tool for the analysis and synthesis of scattered data, and is central to many meshless methods. For a set of…
Greedy algorithms, particularly the orthogonal greedy algorithm (OGA), have proven effective in training shallow neural networks for fitting functions and solving partial differential equations (PDEs). In this paper, we extend the…
Let $P\subset \mathbb R^n$ be a belt polytope, that is a polytope whose normal fan coincides with the fan of some hyperplane arrangement $\mathcal A$. Also, let $G:\mathbb R^n\to\mathbb R^d$ be a linear map of full rank whose kernel is in…
A permutation graph can be defined as an intersection graph of segments whose endpoints lie on two parallel lines $\ell_1$ and $\ell_2$, one on each. A bipartite permutation graph is a permutation graph which is bipartite. In the the…
We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…