Convergence of learning algorithms without a projection facility (Q1300379): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q127662989 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-4068(97)00023-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067535039 / rank
 
Normal rank

Latest revision as of 11:22, 30 July 2024

scientific article
Language Label Description Also known as
English
Convergence of learning algorithms without a projection facility
scientific article

    Statements

    Convergence of learning algorithms without a projection facility (English)
    0 references
    0 references
    0 references
    20 December 2000
    0 references
    This paper addresses convergence of learning algorithms without the use of a projection facility. In earlier research direct proofs of convergence in simple models was employed, but new research has showed that those same results an be obtained using the stochastic approximation technique of \textit{L. Ljung} [IEEE Trans. Autom. Control 22, 551-575 (1977; Zbl 0362.93031)]. This method is used to analyze local stability in stochastic dynamic economic models in the presence of multiple equilibria. The analysis is conducted under the assumption of Markovian state variable dynamics. Finally, we present two economic applications of the convergence result.
    0 references
    stochastic approximation
    0 references
    rational expectations
    0 references
    noisy sunspot equilibria
    0 references

    Identifiers