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 language | English |
---|---|
Pages (from-to) | 139-142 |
Number of pages | 3 |
Journal | Economics Letters |
Volume | 118 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 2013 |
Keywords
- Adaptive learning
- Kalman filter
- Least squares
- Stochastic gradient