Related papers: Random Sampling in reproducing kernel subspaces of…

Kernel methods are powerful learning methodologies that allow to perform non-linear data analysis. Despite their popularity, they suffer from poor scalability in big data scenarios. Various approximation methods, including random feature…

This paper discusses an abstract Kramer sampling theorem for functions within a reproducing kernel Hilbert space (RKHS) of vector valued holomorphic functions. Additionally, we extend the concept of quasi Lagrange-type interpolation for…

In this note we study the problem of sampling and reconstructing signals which are assumed to lie on or close to one of several subspaces of a Hilbert space. Importantly, we here consider a very general setting in which we allow infinitely…

We extend the recent results concerning boundedness of the maximal regularity operator on tent spaces. This leads us to develop a singular integral operator theory on tent spaces. Such operators have operator-valued kernels. A seemingly…

Random features are a powerful technique for rewriting positive-definite kernels as linear products. They bring linear tools to bear in important nonlinear domains like KNNs and attention. Unfortunately, practical implementations require…

In recent years, various kernels have been proposed in the context of persistent homology to deal with persistence diagrams in supervised learning approaches. In this paper, we consider the idea of variably scaled kernels, for approximating…

In our recent work, the sampling and reconstruction of non-decaying signals, modeled as members of weighted-$L_p$ spaces, were shown to be stable with an appropriate choice of the generating kernel for the shift-invariant reconstruction…

Invariance to nuisance transformations is one of the desirable properties of effective representations. We consider transformations that form a \emph{group} and propose an approach based on kernel methods to derive local group invariant…

Let $P$ be a Markov kernel on a measurable space $\X$ and let $V:\X\r[1,+\infty)$. We provide various assumptions, based on drift conditions, under which $P$ is quasi-compact on the weighted-supremum Banach space $(\cB_V,\|\cdot\|_V)$ of…

Generalizing the bounded kernel results of Borgs, Chayes, Lov\'asz, S\'os and Vesztergombi (2008), we prove two Sampling Lemmas for unbounded kernels with respect to the cut norm. On the one hand, we show that given a (symmetric) kernel…

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.…

We consider the problem of approximating an unknown function $u\in L^2(D,\rho)$ from its evaluations at given sampling points $x^1,\dots,x^n\in D$, where $D\subset \mathbb{R}^d$ is a general domain and $\rho$ is a probability measure. The…

We establish a domination principle for positive operators, which provides an upper bound on the essential spectral radius and yields quasi-compactness criteria on weighted supremum spaces with Lyapunov type functions and local domination.…

Kernel-based methods in Numerical Analysis have the advantage of yielding optimal recovery processes in the "native" Hilbert space $\calh$ in which they are reproducing. Continuous kernels on compact domains have an expansion into…

Let $G$ be a locally compact abelian group with a Haar measure, and $Y$ be a measure space. Suppose that $H$ is a reproducing kernel Hilbert space of functions on $G\times Y$, such that $H$ is naturally embedded into $L^2(G\times Y)$ and is…

Given a reproducing kernel Hilbert space H of real-valued functions and a suitable measure mu over the source space D (subset of R), we decompose H as the sum of a subspace of centered functions for mu and its orthogonal in H. This…

The randomized singular value decomposition proposed in [27] has certainly become one of the most well-established randomization-based algorithms in numerical linear algebra. The key ingredient of the entire procedure is the computation of…

This paper introduces a quasi-interpolation operator for scalar- and vector-valued finite element spaces constructed on affine, shape-regular meshes with some continuity across mesh interfaces.This operator gives optimal estimates of the…

We extend the classical Mercer theorem to reproducing kernel Hilbert spaces whose elements are functions from a measurable space $X$into $\mathbb C^n$. Given a finite measure $\mu$ on $X$, we represent the reproducing kernel $K$ as…

Similarity plays a fundamental role in many areas, including data mining, machine learning, statistics and various applied domains. Inspired by the success of ensemble methods and the flexibility of trees, we propose to learn a similarity…