Regularization networks: Fast weight calculation via Kalman filtering

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.


    • EPFL-REPORT-224297

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


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

Related material