Infoscience

Journal article

A Kalman filtering algorithm for regularization networks

Regularization networks are nonparametric estimators obtained from the application of Tychonov regularization or Bayes estimation to the hypersurface reconstruction problem. With the usual algorithm, 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. The procedure applies also to smoothing splines and, in a multidimensional context, to additive regularization networks.

    Note:

    Chicago, Illinois, US, 28-30 June.

    Reference

    • EPFL-ARTICLE-224294

    Record created on 2017-01-10, modified on 2017-05-10

Fulltext

  • There is no available fulltext. Please contact the lab or the authors.

Related material