Table of Contents
Fetching ...

Irregular Sampling of High-Dimensional Functions in Reproducing Kernel Hilbert Spaces

Armin Iske, Lennart Ohlsen

TL;DR

This work addresses the challenge of reconstructing high-dimensional functions in reproducing kernel Hilbert spaces (RKHS) from irregular samples taken at determining sequences. It develops sampling formulas of the form $f=\sum_{k\in\mathbb{N}} f(x_k) L_k$, with $L_k$ forming a dual Riesz basis to the kernel functions $K_{x_k}$, and uses the infinite Gram matrix $A_{K,X}$ to establish stable representations. The authors extend the framework to tensor-product RKHS, showing that tensor-product kernels yield composing determining samples and dual bases as tensor products, thereby reducing computational complexity for high-dimensional sampling. These results provide a rigorous, scalable method for high-dimensional kernel-based approximation from irregular samples, with potential impact on kernel regression, multivariate approximation, and related numerical analysis tasks. The approach hinges on PD kernels, Riesz theory, and the tensor-product structure to achieve efficient representations in high dimensions.

Abstract

We develop sampling formulas for high-dimensional functions in reproducing kernel Hilbert spaces, where we rely on irregular samples that are taken at determining sequences of data points. We place particular emphasis on sampling formulas for tensor product kernels, where we show that determining irregular samples in lower dimensions can be composed to obtain a tensor of determining irregular samples in higher dimensions. This in turn reduces the computational complexity of sampling formulas for high-dimensional functions quite significantly.

Irregular Sampling of High-Dimensional Functions in Reproducing Kernel Hilbert Spaces

TL;DR

This work addresses the challenge of reconstructing high-dimensional functions in reproducing kernel Hilbert spaces (RKHS) from irregular samples taken at determining sequences. It develops sampling formulas of the form , with forming a dual Riesz basis to the kernel functions , and uses the infinite Gram matrix to establish stable representations. The authors extend the framework to tensor-product RKHS, showing that tensor-product kernels yield composing determining samples and dual bases as tensor products, thereby reducing computational complexity for high-dimensional sampling. These results provide a rigorous, scalable method for high-dimensional kernel-based approximation from irregular samples, with potential impact on kernel regression, multivariate approximation, and related numerical analysis tasks. The approach hinges on PD kernels, Riesz theory, and the tensor-product structure to achieve efficient representations in high dimensions.

Abstract

We develop sampling formulas for high-dimensional functions in reproducing kernel Hilbert spaces, where we rely on irregular samples that are taken at determining sequences of data points. We place particular emphasis on sampling formulas for tensor product kernels, where we show that determining irregular samples in lower dimensions can be composed to obtain a tensor of determining irregular samples in higher dimensions. This in turn reduces the computational complexity of sampling formulas for high-dimensional functions quite significantly.

Paper Structure

This paper contains 6 sections, 8 theorems, 42 equations.

Key Result

Theorem 3.1

For a finite point set $X = \{x_1,\ldots,x_n\}$, $n \in \mathbb N$, the unique dual Riesz basis of $\mathcal{R}_X = \{ K_{x_j} \, | \, x_j \in X \}$ is given by the Lagrange basis of $\mathcal{S}_X$, i.e., $\tilde{\mathcal{R}}_X = \mathcal{L}_X$. In particular,

Theorems & Definitions (17)

  • Definition 2.1
  • Theorem 3.1
  • proof
  • Corollary 3.2
  • Definition 4.1
  • Lemma 4.2
  • proof
  • Lemma 4.3
  • proof
  • Theorem 4.4
  • ...and 7 more