Strategies for autonomous adaptation and learning in dynamical networks

The complexity of dynamical networks', which compute with diverse attractors, renders them inaccessible, at present anyway, to entirely analytical treatment. Therefore, exploration and development of a learning algorithm for such nets, would need to rely mostly on numerical simulations. Here, we discuss strategies for the development of autonomous adaptation and learning algorithms for dynamical networks that are driven by entropy related information theoretic measures. A net of parametrically coupled logistic processing elements, an instance of a dynamical network, is used to illustrate the rationale, detail, and features of the strategies developed.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
1997
Language
ENG
Citation

BIOLOGICAL AND ARTIFICIAL COMPUTATION: FROM NEUROSCIENCE TO TECHNOLOGY BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.1240, pp.417 - 426

ISSN
0302-9743
URI
http://hdl.handle.net/10203/75012
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 108
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0