Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-07T04:33:53.039Z Has data issue: false hasContentIssue false

SMOOTHING-BASED INITIALIZATION FOR LEARNING-TO-FORECAST ALGORITHMS

Published online by Cambridge University Press:  23 June 2017

Michele Berardi
Affiliation:
University of Manchester
Jaqueson K. Galimberti*
Affiliation:
ETH Zurich
*
Address correspondence to: Jaqueson K. Galimberti, KOF Swiss Economic Institute, ETH Zurich, LEE G 116, Leonhardstrasse 21, 8092 Zurich, Switzerland; e-mail: galimberti@kof.ethz.ch.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Under adaptive learning, recursive algorithms are proposed to represent how agents update their beliefs over time. For applied purposes, these algorithms require initial estimates of agents perceived law of motion. Obtaining appropriate initial estimates can become prohibitive within the usual data availability restrictions of macroeconomics. To circumvent this issue, we propose a new smoothing-based initialization routine that optimizes the use of a training sample of data to obtain initials consistent with the statistical properties of the learning algorithm. Our method is generically formulated to cover different specifications of the learning mechanism, such as the least-squares and the stochastic gradient algorithms. Using simulations, we show that our method is able to speed up the convergence of initial estimates in exchange for a higher computational cost.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2017