Rippa’s algorithm is a well-known Leave-One-Out Cross Validation (LOOCV) scheme that is adopted in Radial Basis Function (RBF) interpolation for the tuning of the shape parameter. Indeed, it provides remarkable advantages concerning the computational cost with respect to a standard implementation. In this paper, we extend such algorithm to work in a more general $k$-fold CV setting. After providing a theoretical formulation and proving that the proposed scheme computes an exact $k$-fold CV, we compare it to a standard $k$-fold CV implementation. Especially when $k$ gets large, the saving in computational cost is evident.

中文翻译：

---

Rippa算法的扩展超出了LOOCV

Rippa的算法是一种著名的“留一法”交叉验证（LOOCV）方案，该方案在径向基函数（RBF）插值中采用，用于调整形状参数。实际上，相对于标准实现，它在计算成本方面提供了显着的优势。在本文中，我们将这种算法扩展为在更通用的条件下工作$ķ$折CV设置。提供理论公式并证明所提出的方案可以计算出精确的$ķ$折式简历，我们将其与标准 $ķ$简历的实现。特别是当$ķ$变大，计算成本的节省是显而易见的。