Fast Summation of Radial Kernels via QMC Slicing

Johannes Hertrich, Tim Jahn, Michael Quellmalz
2/12/2026

No official code found. Best implementation: johertrich/fastsum_QMC_slicing (1 star, MIT, last commit 2025-02-11).

Abstract

The fast computation of large kernel sums is a challenging task, which arises as a subproblem in any kernel method. We approach the problem by slicing, which relies on random projections to one-dimensional subspaces and fast Fourier summation. We prove bounds for the slicing error and propose a quasi-Monte Carlo (QMC) approach for selecting the projections based on spherical quadrature rules. Numerical examples demonstrate that our QMC-slicing approach significantly outperforms existing methods like (QMC-)random Fourier features, orthogonal Fourier features or non-QMC slicing on standard test datasets.

View on arXivView PDF

Code Implementations(1)

MIT

Fast Summation of Radial Kernels via QMC Slicing

10Julia, PythonSep 12, 20241 years agoMIT

Similar Papers

Cite this paper

@article{hertrich2026fast,
  title  = {Fast Summation of Radial Kernels via QMC Slicing},
  author = {Johannes Hertrich and Tim Jahn and Michael Quellmalz},
  year   = {2026},
  eprint = {2410.01316},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2410.01316},
  journal = {ICLR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.01316.svg)](https://codeofpaper.com/paper/2410.01316)

Discussion