Regularization networks are nonparametric estimators obtained from the application of Tychonov regularization or Bayes estimation to the hypersurface reconstruction problem. Their main drawback is that the computation of the weights scales as O(n^3) where n is the number of data. In this paper we show that for a class of monodimensional problems, the complexity can be reduced to O(n) by a suitable algorithm based on spectral factorization and Kalman filtering. Moreover, the procedure applies also to smoothing splines.
Regularization networks: Fast weight calculation via Kalman filtering
DE NICOLAO, GIUSEPPE;FERRARI TRECATE, GIANCARLO
2001-01-01
Abstract
Regularization networks are nonparametric estimators obtained from the application of Tychonov regularization or Bayes estimation to the hypersurface reconstruction problem. Their main drawback is that the computation of the weights scales as O(n^3) where n is the number of data. In this paper we show that for a class of monodimensional problems, the complexity can be reduced to O(n) by a suitable algorithm based on spectral factorization and Kalman filtering. Moreover, the procedure applies also to smoothing splines.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
