




























Abstract:We present a new paradigm for creating random features to approximate bi-variate functions (in particular, kernels) defined on general manifolds. This new mechanism of Manifold Random Features (MRFs) leverages discretization of the manifold and the recently introduced technique of Graph Random Features (GRFs) to learn continuous fields on manifolds. Those fields are used to find continuous approximation mechanisms that otherwise, in general scenarios, cannot be derived analytically. MRFs provide positive and bounded features, a key property for accurate, low-variance approximation. We show deep asymptotic connection between GRFs, defined on discrete graph objects, and continuous random features used for regular kernels. As a by-product of our method, we re-discover recently introduced mechanism of Gaussian kernel approximation applied in particular to improve linear-attention Transformers, considering simple random walks on graphs and by-passing original complex mathematical computations. We complement our algorithm with a rigorous theoretical analysis and verify in thorough experimental studies.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2602.03797 [cs.LG] |
| (or arXiv:2602.03797v2 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2602.03797 arXiv-issued DOI via DataCite |
From: Derek Long [view email]
[v1]
Tue, 3 Feb 2026 18:00:01 UTC (17,285 KB)
[v2]
Fri, 8 May 2026 05:28:16 UTC (17,290 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。