A note on exact correspondences between adaptive learning algorithms and the Kalman filter
Michele Berardi () and
Jaqueson Galimberti ()
Centre for Growth and Business Cycle Research Discussion Paper Series from Economics, The Univeristy of Manchester
Digressing into the origins of the two main algorithms considered in the literature of adaptive learning, namely Least Squares (LS) and Stochastic Gradient (SG), we found a connection between their non-recursive forms and their interpretation within a state-space unifying framework. Based on such connection, we extend the correspondence between the LS and the Kalman filter recursions to a formulation with time-varying gains of the former, and also present a similar correspondence for the case of the SG. Our correspondences hold exactly, in a computational implementation sense, and we discuss how they relate to previous approximate correspondences found in the literature.
Pages: 18 pages
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4) Track citations by RSS feed
Downloads: (external link)
http://hummedia.manchester.ac.uk/schools/soss/cgbc ... apers/dpcgbcr170.pdf (application/pdf)
Journal Article: A note on exact correspondences between adaptive learning algorithms and the Kalman filter (2013)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:man:cgbcrp:170
Access Statistics for this paper
More papers in Centre for Growth and Business Cycle Research Discussion Paper Series from Economics, The Univeristy of Manchester Contact information at EDIRC.
Bibliographic data for series maintained by Marianne Sensier ().