Search from over 60,000 research works

Advanced Search

The relative order and inverses of recurrent networks

Full text not archived in this repository.
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email

Kambhampati, C., Manchanda, S., Delgado, A., Green, G. R. R., Warwick, K. and Tham, M. (1996) The relative order and inverses of recurrent networks. Automatica, 32 (1). pp. 117-123. ISSN 0005-1098 doi: 10.1016/0005-1098(95)00098-4

Abstract/Summary

Differential geometry is used to investigate the structure of neural-network-based control systems. The key aspect is relative order—an invariant property of dynamic systems. Finite relative order allows the specification of a minimal architecture for a recurrent network. Any system with finite relative order has a left inverse. It is shown that a recurrent network with finite relative order has a local inverse that is also a recurrent network with the same weights. The results have implications for the use of recurrent networks in the inverse-model-based control of nonlinear systems.

Altmetric Badge

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/17865
Item Type Article
Refereed Yes
Divisions Science
Uncontrolled Keywords architectures, differential geometric methods, relative order, neural networks
Publisher Elsevier
Download/View statistics View download statistics for this item

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar