IDENTIFIABILITY OF RECURRENT NEURAL NETWORKS

A.A. Al-Falou and D. Trummer

Econometric Theory, 2003, vol. 19, issue 5, 812-828

Abstract: We examine the identifiability of a nonlinear state space system under general assumptions. The discrete time evolution of the state is generated by a recurrent Elman network. For a large set of Elman networks we determine the class of observationally equivalent minimal systems, i.e., minimal systems that exhibit the same input-output behavior.The authors are grateful for discussions with M. Deistler and D. Bauer. A.A. Al-Falou was funded by the ERNSI network within the European Union program Training and Mobility of Researchers (TMR). D. Trummer was funded by the FWF (Austrian Science Fund). We thank an anonymous referee for helpful comments and suggestions.

Date: 2003
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.cambridge.org/core/product/identifier/ ... type/journal_article link to article abstract page (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cup:etheor:v:19:y:2003:i:05:p:812-828_19

Access Statistics for this article

More articles in Econometric Theory from Cambridge University Press Cambridge University Press, UPH, Shaftesbury Road, Cambridge CB2 8BS UK.
Bibliographic data for series maintained by Kirk Stebbing ().