Giga-scale Kernel Matrix-Vector Multiplication on GPU
Robert Hu, Siu Lun Chau, Dino Sejdinovic, Joan Glaunès
摘要
Kernel matrix-vector multiplication (KMVM) is a foundational operation in machine learning and scientific computing. However, as KMVM tends to scale quadratically in both memory and time, applications are often limited by these computational constraints. In this paper, we propose a novel approximation procedure coined Faster-Fast and Free Memory Method () to address these scaling issues of KMVM for tall () and skinny () data. Extensive experiments demonstrate that has empirical linear time and memory complexity with a relative error of order and can compute a full KMVM for a billion points in under a minute on a high-end GPU, leading to a significant speed-up in comparison to existing CPU methods. We demonstrate the utility of our procedure by applying it as a drop-in for the state-of-the-art GPU-based linear solver FALKON, improving speed 1.5-5.5 times at the cost of drop in accuracy. We further demonstrate competitive results on Gaussian Process regression coupled with significant speedups on a variety of real-world datasets.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper2
相关 Paper
- KernelMatmul: Scaling Gaussian Processes to Large Time SeriesTilman Hoffbauer, Holger H. Hoos, Jakob BossekAAAI 2025
- Fast kernel methods: Sobolev, physics-informed, and additive modelsNathan Doumèche, Francis Bach, Gérard Biau, Claire BoyerICML 2026 · 被引用 1 次
- Kernel Interpolation with Sparse GridsMohit Yadav, Daniel R. Sheldon, Cameron MuscoNeurIPS 2022 · 被引用 8 次
- Fast Matrix Square Roots with Applications to Gaussian Processes and Bayesian OptimizationGeoff Pleiss, Martin Jankowiak, David Eriksson, Anil Damle 等NeurIPS 2020 · 被引用 49 次
- Fast Kronecker Matrix-Matrix Multiplication on GPUsAbhinav Jangda, Mohit YadavPPoPP 2024 · 被引用 2 次
