Saved in:
Bibliographic Details
Main Author: Bakhvalov, Yuriy N.
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2512.12731
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915674856620032
author Bakhvalov, Yuriy N.
author_facet Bakhvalov, Yuriy N.
contents This paper studies a machine learning regression problem as a multivariate approximation problem using the framework of the theory of random functions. An ab initio derivation of a regression method is proposed, starting from postulates of indifference. It is shown that if a probability measure on an infinite-dimensional function space possesses natural symmetries (invariance under translation, rotation, scaling, and Gaussianity), then the entire solution scheme, including the kernel form, the type of regularization, and the noise parameterization, follows analytically from these postulates. The resulting kernel coincides with a generalized polyharmonic spline; however, unlike existing approaches, it is not chosen empirically but arises as a consequence of the indifference principle. This result provides a theoretical foundation for a broad class of smoothing and interpolation methods, demonstrating their optimality in the absence of a priori information.
format Preprint
id arxiv_https___arxiv_org_abs_2512_12731
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Solving a Machine Learning Regression Problem Based on the Theory of Random Functions
Bakhvalov, Yuriy N.
Machine Learning
Numerical Analysis
68T05, 41A15, 60G15, 41A63
This paper studies a machine learning regression problem as a multivariate approximation problem using the framework of the theory of random functions. An ab initio derivation of a regression method is proposed, starting from postulates of indifference. It is shown that if a probability measure on an infinite-dimensional function space possesses natural symmetries (invariance under translation, rotation, scaling, and Gaussianity), then the entire solution scheme, including the kernel form, the type of regularization, and the noise parameterization, follows analytically from these postulates. The resulting kernel coincides with a generalized polyharmonic spline; however, unlike existing approaches, it is not chosen empirically but arises as a consequence of the indifference principle. This result provides a theoretical foundation for a broad class of smoothing and interpolation methods, demonstrating their optimality in the absence of a priori information.
title Solving a Machine Learning Regression Problem Based on the Theory of Random Functions
topic Machine Learning
Numerical Analysis
68T05, 41A15, 60G15, 41A63
url https://arxiv.org/abs/2512.12731