RUS  ENG
Full version
JOURNALS // Matematicheskoe modelirovanie // Archive

Matem. Mod., 2011 Volume 23, Number 9, Pages 33–42 (Mi mm3152)

This article is cited in 1 paper

Bayesian regularization in the problem of point-by-point function approximation using orthogonalized basis

A. S. Nuzhny

Nuclear Safety Institute of Russian Academy of Sciences, Moscow

Abstract: The algorithm of point-by-point approximation of multidimensional scalar function is discussed. The solution is searched as series of basic functions. Regularization of approximation is realized by inclusion of stabilizing functional in the Gaussian form. Regularization parameter is searched using Bayesian method. The proposed algorithm is very inexpensive from a computational point of view. In addition it has a unique analytical solution for regularization parameter in contrast to other Bayesian algorithms.

Keywords: approximation, ill-posed problem, Bayesian regularization, supervised learning.

UDC: 519.651

Received: 25.01.2011


 English version:
Mathematical Models and Computer Simulations, 2012, 4:2, 203–209

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024