Distributed Uncertainty Quantification of Kernel Interpolation on Spheres
Not on the map. Why?
Abstract (arXiv)
For radial basis function (RBF) kernel interpolation of scattered data, Schaback in 1995 proved that the attainable approximation error and the condition number of the underlying interpolation matrix cannot be made small simultaneously. He referred to this finding as an "uncertainty relation", an undesirable consequence of which is that RBF kernel interpolation is susceptible to noisy data. In this paper, we propose and study a distributed interpolation method to manage and quantify the uncertainty brought on by interpolating noisy spherical data of non-negligible magnitude. We also present numerical simulation results showing that our method is practical and robust in terms of handling noisy data from challenging computing environments.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 34 references that are in the map. First posted on arXiv 25 Oct 2023.
Builds on
5 of 34 references.
References · 5
- 2013Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Ratescited by 64
- 2016Distributed learning with regularized least squarescited by 42
- 2019Distributed filtered hyperinterpolation for noisy data on the spherecited by 7
- 2020Kernel Interpolation of High Dimensional Scattered Datacited by 6
- 2021Radial Basis Function Approximation with Distributively Stored Data on Spherescited by 6
Built on by
Citing papers per year: 2024: 2.
2 papers.