A note on exact correspondences between adaptive learning algorithms and the Kalman filter

Michele Berardi, Jaqueson K. Galimberti

Research output: Contribution to journalArticlepeer-review

Abstract

We extend the correspondences between adaptive learning algorithms and the Kalman filter to formulations with time-varying gains. Our correspondences hold exactly, in a computational implementation sense, and we discuss how they relate to previous approximate correspondences found in the literature. © 2012 Elsevier B.V.
Original languageEnglish
Pages (from-to)139-142
Number of pages3
JournalEconomics Letters
Volume118
Issue number1
DOIs
Publication statusPublished - Jan 2013

Keywords

  • Adaptive learning
  • Kalman filter
  • Least squares
  • Stochastic gradient

Fingerprint

Dive into the research topics of 'A note on exact correspondences between adaptive learning algorithms and the Kalman filter'. Together they form a unique fingerprint.

Cite this