Stochastic Gradient Versus Recursive Least Squares Learning

Abstract

In this paper, we perform an in - depth investigation of relative merits of two adaptive learning algorithms with constant gain, Recursive Least Squares (RLS) and Stochastic Gradient (SG), using the Phelps model of monetary policy as a testing ground. The behavior of the two learning algorithms is very different. Under the mean (averaged) RLS dynamics, the Self-Confirming Equilibrium (SCE) is stable for initial conditions in a very small region around the SCE. Large distance movements of perceived model parameters from their SCE values, or "escapes", are observed. On the other hand, the SCE is stable under the SG mean dynamics in a large region. However, actual behavior of the SG learning algorithm is divergent for a wide range of constant gain parameters, including those that could be justified as economically meaningful. We explain the discrepancy by looking into the structure of eigenvalues and eigenvectors of the mean dynamics map under SG learning. Results of our paper hint that caution is needed when constant gain learning algorithms are used. If the mean dynamics map is stable but not contracting in every direction, and most eigenvalues of the map are close to the unit circle, the constant gain learning algorithm might diverge.