2020
DOI: 10.2139/ssrn.3593126
|View full text |Cite
|
Sign up to set email alerts
|

Information Weighting Under Least Squares Learning

Abstract: This paper evaluates how adaptive learning agents weight different pieces of information when forming expectations with a recursive least squares algorithm. The analysis is based on a renewed and more general non-recursive representation of the learning algorithm, namely, a penalized weighted least squares estimator, where a penalty term accounts for the effects of the learning initials. The paper then draws behavioral implications of alternative specifications of the learning mechanism, such as the cases with… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 27 publications
(33 reference statements)
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?