Papers › A fast surrogate cross validation algorithm for meshfree RBF collocation approaches
A fast surrogate cross validation algorithm for meshfree RBF collocation approaches
Francesco Marchetti
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Cross validation is an important tool in the RBF collocation setting, especially for the crucial tuning of the shape parameter related to the radial basis function. In this paper, we define a new efficient surrogate cross validation algorithm, which computes an accurate approximation of the true validation error with much less computational effort with respect to a standard implementation. The proposed scheme is first analyzed and described in details, and then tested in various numerical experiments that confirm its efficiency and effectiveness.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections