Polyharmonic Spline Packages: Composition, Efficient Procedures for Computation and Differentiation
Abstract
In a previous paper it was shown that a machine learning regression problem can be solved within the framework of random function theory, with the optimal kernel analytically derived from symmetry and indifference principles and coinciding with a polyharmonic spline. However, a direct application of that solution is limited by O(N^3) computational cost and by a breakdown of the original theoretical assumptions when the input space has excessive dimensionality. This paper proposes a cascade architecture built from packages of polyharmonic splines that simultaneously addresses scalability and is theoretically justified for problems with unknown intrinsic low dimensionality. Efficient matrix procedures are presented for forward computation and end-to-end differentiation through the cascade.
Cite
@article{arxiv.2512.16718,
title = {Polyharmonic Spline Packages: Composition, Efficient Procedures for Computation and Differentiation},
author = {Yuriy N. Bakhvalov},
journal= {arXiv preprint arXiv:2512.16718},
year = {2025}
}
Comments
Part 2 of 4 in the "Polyharmonic Cascade" cycle. Continues the theory from arXiv.2512.12731. Source code is available at: https://github.com/xolod7/polyharmonic-cascade