Fast Samplet Transform

• Fast Samplet Transform is a multiresolution change-of-basis for scattered data that uses samplets with q+1 polynomial vanishing moments to annihilate low-order polynomials.
• It leverages hierarchical binary cluster trees to perform fast forward and inverse transforms with a computational cost of O(N) through local two-scale relations.
• The method supports efficient data and kernel matrix compression via hard thresholding, enabling rapid interpolation and sparse approximations in high-dimensional settings.

Searching arXiv for the specified paper to ground the response and verify metadata. arXiv search query: (Harbrecht et al., 20 Mar 2025) Samplets Fast Samplet Transform Harbrecht Multerer The Fast Samplet Transform (FST) is the change of basis associated with samplets, a wavelet-type system for scattered data introduced by Harbrecht and Multerer. Samplets are signed measures defined on sets of arbitrarily distributed data sites in possibly high dimension, and they transfer familiar wavelet concepts—fast basis transforms, data compression, operator compression, operator arithmetics, and sparse approximation—to non-grid data. In the same framework, samplet matrix compression facilitates rapid solution of scattered data interpolation problems, including kernels with nonlocal support, and sparsity constraints become meaningful in samplet coordinates (Harbrecht et al., 20 Mar 2025).

1. Functional setting and definition

Let $$X=\{x_1,\dots,x_N\}\subset \Omega\subset \mathbb{R}^d$$ be an arbitrary set of data sites. The construction is formulated in the space

$$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$

that is, the space of finitely supported signed measures. The inner product is prescribed by

$\langle \delta_{x_i},\delta_{x_j}\rangle_X=m_{ij},$

with the usual choice $m_{ij}=\delta_{ij}$, so $(X,\langle\cdot,\cdot\rangle_X)\cong \mathbb{R}^N$ is a Hilbert space.

A multiresolution analysis in $X$ is a nested sequence

$X_0\subset X_1\subset \cdots \subset X_J=X,$

with levelwise splittings

$X_{j+1}=X_j\oplus \mathcal{S}_j.$

Here $X_j$ is the scaling space and $\mathcal{S}_j$ is the detail space. A samplet basis consists of scaling distributions $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$0 spanning $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$1 together with samplets $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$2 spanning each $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$3, for $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$4.

The defining wavelet-type condition is polynomial cancellation. Each samplet satisfies $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$5 polynomial vanishing moments,

$$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$6

where $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$7 denotes the polynomials of total degree at most $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$8, with

$$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$9

This distinguishes samplets from arbitrary local signed measures: they are designed to annihilate low-order polynomial content while remaining localized on scattered point sets.

2. Multiresolution construction on cluster trees

The construction uses a balanced binary cluster tree $\langle \delta_{x_i},\delta_{x_j}\rangle_X=m_{ij},$0 of the data sites, for example by median cut. Each node $\langle \delta_{x_i},\delta_{x_j}\rangle_X=m_{ij},$1 has two children, and refinement continues until the leaf size is $\langle \delta_{x_i},\delta_{x_j}\rangle_X=m_{ij},$2. If $\langle \delta_{x_i},\delta_{x_j}\rangle_X=m_{ij},$3, then the node carries scaling distributions $\langle \delta_{x_i},\delta_{x_j}\rangle_X=m_{ij},$4 and samplets $\langle \delta_{x_i},\delta_{x_j}\rangle_X=m_{ij},$5.

On each cluster $\langle \delta_{x_i},\delta_{x_j}\rangle_X=m_{ij},$6 at level $\langle \delta_{x_i},\delta_{x_j}\rangle_X=m_{ij},$7, the local two-scale relation is

$\langle \delta_{x_i},\delta_{x_j}\rangle_X=m_{ij},$8

with

$\langle \delta_{x_i},\delta_{x_j}\rangle_X=m_{ij},$9

The role of $m_{ij}=\delta_{ij}$0 is to separate scaling and detail components while enforcing orthonormality and vanishing moments.

The local moment matrix is

$m_{ij}=\delta_{ij}$1

In practice one computes

$m_{ij}=\delta_{ij}$2

by Gram–Schmidt or Householder QR. The first $m_{ij}=\delta_{ij}$3 columns of $m_{ij}=\delta_{ij}$4 define the scaling part, and the remaining $m_{ij}=\delta_{ij}$5 columns of $m_{ij}=\delta_{ij}$6 define the samplets.

Several structural properties follow directly from this construction. The family $m_{ij}=\delta_{ij}$7 is an orthonormal basis of $m_{ij}=\delta_{ij}$8. The number of samplets at level $m_{ij}=\delta_{ij}$9 is $(X,\langle\cdot,\cdot\rangle_X)\cong \mathbb{R}^N$0, with total cardinality $(X,\langle\cdot,\cdot\rangle_X)\cong \mathbb{R}^N$1. Each $(X,\langle\cdot,\cdot\rangle_X)\cong \mathbb{R}^N$2 is supported in one cluster $(X,\langle\cdot,\cdot\rangle_X)\cong \mathbb{R}^N$3 and has $(X,\langle\cdot,\cdot\rangle_X)\cong \mathbb{R}^N$4 vanishing moments. A common misconception is to treat samplets as ordinary wavelet functions on a regular mesh; in this framework they are signed measures supported on clustered scattered data sites.

3. Forward and inverse Fast Samplet Transform

The FST is the matrix $(X,\langle\cdot,\cdot\rangle_X)\cong \mathbb{R}^N$5 defined by

$(X,\langle\cdot,\cdot\rangle_X)\cong \mathbb{R}^N$6

where

$(X,\langle\cdot,\cdot\rangle_X)\cong \mathbb{R}^N$7

The transform matrix is block-sparse, with a “fish-bone” structure, and is applied through local two-scale relations rather than dense matrix multiplication.

At cluster $(X,\langle\cdot,\cdot\rangle_X)\cong \mathbb{R}^N$8 and level $(X,\langle\cdot,\cdot\rangle_X)\cong \mathbb{R}^N$9, the decomposition identity is

$X$0

The forward transform starts from the finest-scale values

$X$1

and processes levels $X$2. On each cluster $X$3, the restricted vector $X$4 is multiplied by

$X$5

to produce a new scaling part $X$6 and a detail part $X$7. The detail coefficients are collected into $X$8, and the remaining $X$9 is stored as the coarsest-scale component.

Reconstruction reverses the process. At each level, the coarse scaling data and detail data on a cluster are combined using

$X_0\subset X_1\subset \cdots \subset X_J=X,$0

to recover the next finer-scale vector, culminating in $X_0\subset X_1\subset \cdots \subset X_J=X,$1.

In block form, the levelwise analysis and synthesis filters are

$X_0\subset X_1\subset \cdots \subset X_J=X,$2

Hence

$X_0\subset X_1\subset \cdots \subset X_J=X,$3

This formulation makes explicit that the FST is a hierarchical exact basis change before any compression is applied.

4. Computational complexity and coefficient compression

The cluster tree can be built in $X_0\subset X_1\subset \cdots \subset X_J=X,$4 time by median-split on bounding boxes (Harbrecht et al., 20 Mar 2025). For the transform itself, the depth satisfies $X_0\subset X_1\subset \cdots \subset X_J=X,$5. At each cluster $X_0\subset X_1\subset \cdots \subset X_J=X,$6, the local work involves a small block of size governed by $X_0\subset X_1\subset \cdots \subset X_J=X,$7, and summing over all levels yields

$X_0\subset X_1\subset \cdots \subset X_J=X,$8

Since

$X_0\subset X_1\subset \cdots \subset X_J=X,$9

both analysis and synthesis are $X_{j+1}=X_j\oplus \mathcal{S}_j.$0 for fixed $X_{j+1}=X_j\oplus \mathcal{S}_j.$1 and $X_{j+1}=X_j\oplus \mathcal{S}_j.$2. The same linear bound applies to coefficient thresholding, and if only nonzero coefficients are processed after thresholding, the cost reduces proportionally to the number of nonzeros.

Coefficient compression is implemented by hard thresholding. For a threshold $X_{j+1}=X_j\oplus \mathcal{S}_j.$3,

$X_{j+1}=X_j\oplus \mathcal{S}_j.$4

Compression is therefore obtained by replacing $X_{j+1}=X_j\oplus \mathcal{S}_j.$5 with $X_{j+1}=X_j\oplus \mathcal{S}_j.$6 before synthesis. This separation between exact multiresolution analysis and optional nonlinear truncation parallels standard wavelet workflows, but here it is realized on arbitrarily distributed sites rather than on a structured grid.

5. Tuning parameters and operational tradeoffs

The principal tuning parameter is $X_{j+1}=X_j\oplus \mathcal{S}_j.$7, the number of vanishing moments. Larger $X_{j+1}=X_j\oplus \mathcal{S}_j.$8 yields faster decay of $X_{j+1}=X_j\oplus \mathcal{S}_j.$9 for smooth $X_j$0, but also enlarges the local block size $X_j$1. Typical values are $X_j$2. This is the main approximation-versus-local-cost tradeoff built into the construction.

Leaf size should satisfy $X_j$3; examples given are $X_j$4 or a constant in the range $X_j$5. Thresholding uses the parameter $X_j$6, and a common practical choice is

$X_j$7

with $X_j$8. For kernel-matrix compression, an admissibility parameter $X_j$9 is introduced. Tree balance need not be exact: the cost bounds continue to hold for approximately balanced trees.

These parameters control distinct aspects of the method. The moment order controls cancellation and coefficient decay, leaf size controls the local algebra, the threshold controls nonlinear compression in samplet coordinates, and $\mathcal{S}_j$0 controls admissibility in kernel-matrix compression. Within the stated ranges, the chapter reports effective behavior on data sets from $\mathcal{S}_j$1 up to $\mathcal{S}_j$2 million.

6. Reported numerical behavior

The numerical experiments span coefficient compression, kernel-matrix compression, scattered-data interpolation, and sparse basis pursuit (Harbrecht et al., 20 Mar 2025).

Problem	Setup	Reported outcome
Hard-thresholding of global temperature (ERA5)	Monthly data, $\mathcal{S}_j$3 per month, $\mathcal{S}_j$4, $\mathcal{S}_j$5, $\mathcal{S}_j$6	Nonzeros $\mathcal{S}_j$7; space saving $\mathcal{S}_j$8; relative $\mathcal{S}_j$9-errors $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$00
Kernel-matrix compression	Exponential kernel $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$01 on unit square, $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$02, $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$03, $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$04	$$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$05 with $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$06 nonzeros; after nested-dissection reordering, an extremely sparse Cholesky factor with near-linear fill
Surface reconstruction (“Laokoon” signed-distance)	$$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$07 points, $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$08, $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$09, $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$10 Tikhonov	Build and compress $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$11 in $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$12; solve via CG in $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$13; evaluate on $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$14 million grid points via FMM in $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$15
Sparse basis pursuit on space–time temperature	Two kernels $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$16 and $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$17, $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$18 million adaptively subsampled points, $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$19, $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$20 uniform penalty	Semi-smooth Newton in compressed format; $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$21, $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$22, in-sample $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$23, max pointwise relative error $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$24

For the ERA5 thresholding experiment, the reported pointwise maximum error is up to $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$25 for the coarsest threshold and $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$26 for the finest. For the surface-reconstruction experiment, the reported outcome is visually high-quality, smooth level-sets together with interactive run-times on large $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$27. Across the examples, the recurring pattern is that sparsity in samplet coordinates is operationally useful for both vectors and kernel matrices.

7. Conceptual position within scattered-data analysis

The chapter places samplets within wavelet analysis for scattered data rather than within classical grid-based wavelet theory. The essential shift is from basis functions tied to regular meshes to signed measures supported on local clusters of arbitrary data sites. This permits multiresolution structure, vanishing moments, fast transforms, and threshold-based compression without requiring geometric regularity of the sampling set.

The reported uses are correspondingly broad: fast basis transform, data compression, operator compression, operator arithmetics, rapid interpolation for kernels with nonlocal support, and sparse approximation under explicit sparsity constraints in samplet coordinates. The further-reading list associated with the chapter includes work by Beylkin, Coifman, and Rokhlin; Tausch and White; and later work by Harbrecht, Multerer, Schenk, and Schwab. This suggests a lineage connecting classical wavelet compression, multiresolution methods on unstructured data, and kernel-algebra techniques.

Two points delimit the scope of the method clearly. First, samplets are not merely compressed point values; they are basis elements with prescribed $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$28 polynomial vanishing moments and cluster support. Second, the FST is not only a compression heuristic; it is an $$X=\operatorname{span}\{\delta_{x_i}: i=1,\dots,N\}\subset [C(\Omega)]',$$29 analysis/synthesis mechanism for an orthonormal basis, with hard thresholding added as a separate nonlinear step. In that sense, the Fast Samplet Transform is best understood as the multiresolution computational core of the samplet framework for scattered data.