arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.10248math.NAcs.NA
收藏

低秩近似Rippa方法用于径向基函数插值

Low-rank approximation of Rippa method for RBF interpolation

The Ohio State University(俄亥俄州立大学)

Jiawen Lyu, Maria Han Veiga

AI总结:

本文提出通过低秩近似改进Rippa方法,以高效实现RBF插值中的形状参数选择,提升计算效率并保持方法稳定性。

摘要:

我们研究了使用留一法交叉验证(LOOCV)选择径向基函数(RBF)插值中的形状参数的问题。由于经典的LOOCV公式需要反复求解一个N×N的密集核矩阵,我们结合Nyström近似与Woodbury恒等式,得到一个高效的替代目标函数,以避免大规模矩阵求逆。基于此简化形式,我们比较了基于网格的搜索与梯度下降策略,并在不同维度上检验它们的行为。通过在1D、2D和3D中使用逆多二次RBF进行数值实验,展示了近似的计算优势以及它可能引入额外敏感性的场景。这些结果表明,所提出的加速方法使基于LOOCV的参数调节在更大数据集上变得可行,同时保持了完整方法的定性行为。

英文摘要:

We study the problem of selecting the shape parameter in Radial Basis function (RBF) interpolation using leave-one-out-cross-validation (LOOCV). Since the classical LOOCV formula requires repeated solves with a dense $N \times N$ kernel matrix, we combine a Nyström approximation with the Woodbury identity to obtain an efficient surrogate objective that avoids large matrix inversions. Based on this reduced form, we compare a grid-based search with a gradient descent strategy and examine their behavior across different dimensions. Numerical experiments are performed in 1D, 2D, and 3D using the Inverse Multiquadratic RBF to illustrate the computational advantages of the approximation as well as the situations in which it may introduce additional sensitivity. These results show that the proposed acceleration makes LOOCV-based parameter tuning practical for larger datasets while preserving the qualitative behavior of the full method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑