Cayley–Hamilton-Guided Krylov Regularization for Machine Learning: Theory, Computational Architecture, and Empirical Evidence
This study develops and evaluates a Cayley–Hamilton-based framework for regularised machine learning. Its objective is to formulate a practical Krylov-subspace architecture for classification that replaces repeated dense inversion with stable operator iteration. The formulation draws on the theorem’s finite polynomial...