arXiv AI By Pingbing Ming, Hao Yu

Spectral Convergence of Random Feature Method in Multiple Dimensions

Read the original on arXiv AI →

The paper proves spectral convergence of the random feature method (RFM) for multidimensional targets across various function classes, providing high‑probability approximation estimates that hold simultaneously for all admissible error norms. It extends these results to strong‑ and weak‑form RFM discretizations, yielding convergence guarantees for multidimensional second‑order elliptic boundary value and eigenvalue problems. Additionally, it demonstrates super‑exponential singular‑value decay for Fourier features and exponential decay for tanh features, while establishing corresponding condition‑number lower bounds, highlighting a trade‑off between accuracy and ill‑conditioning.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Jun 11

Bernstein-Schur Kernels: Random Features by Sketched Modulation and Radial Randomization

arXiv:2606. 11255v1 Announce Type: new Abstract: Bernstein--Schur kernels are products of a finite-feature kernel (one with an explicit finite-dimensional feature map) and a completely monotone shift-invariant kernel: nonstationary kernels that fall between the shift-invariant and dot-product templates random features usually exploit, so in general neither Bochner sampling nor polynomial sketching applies to the full kernel directly.

By Taha Bouhsine
arXiv Machine Learning
Aug 27

Adaptive Regularization for Random Features: A Neighboring Early-Stopping Rule with Oracle-Rate Guarantees

The paper introduces a neighboring early‑stopping rule for adaptive regularization in kernel ridge regression with random features (KRR‑RF). By using a uniform grid in inverse regularization and comparing only adjacent estimators, the method reduces discrepancy checks and can be computed directly in the random‑feature space without forming the full kernel Gram matrix. Under standard source and capacity assumptions, the selected estimator achieves the oracle polynomial learning rate up to logarithmic factors, enabling regularization selection without prior knowledge of smoothness or capacity exponents.

By Caixing Wang, Zhibo Chen, Yue Wang
arXiv Machine Learning
1d ago

Fast Learning Rates for Physics-Informed Kernel Methods

arXiv:2609.18901v1 Announce Type: cross Abstract: In physics-informed machine learning, a target function $u^*$ is learned from noisy value observations $y_i=u^*(x_i)+ \varepsilon_i$, together with d...

By Luc Brogat-Motte, Joachim Bona-Pellissier, Giacomo Meanti, Lorenzo Rosasco