Short term memory in input-driven linear dynamical systems

被引:17
|
作者
Tino, Peter [1 ]
Rodan, Ali [2 ]
机构
[1] Univ Birmingham, Sch Comp Sci, Birmingham B15 2TT, W Midlands, England
[2] Univ Jordan, King Abdulla Sch Informat Technol 2, Amman, Jordan
基金
英国生物技术与生命科学研究理事会;
关键词
Short term memory capacity; Fisher memory curve; Recurrent neural network; Echo state network; Reservoir computing;
D O I
10.1016/j.neucom.2012.12.041
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We investigate the relation between two quantitative measures characterizing short term memory in input driven dynamical systems, namely the short term memory capacity (MC) [3] and the Fisher memory curve (FMC) [2]. We show that even though MC and FMC map the memory structure of the system under investigation from two quite different perspectives, for linear input driven dynamical systems they are in fact closely related. In particular, under some assumptions, the two quantities can be interpreted as squared 'Mahalanobis' norms of images of the input vector under the system's dynamics. We also offer a detailed rigorous analysis of the relation between MC and FMC in cases of symmetric and cyclic dynamic couplings. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码:58 / 63
页数:6
相关论文
共 50 条
  • [21] Edit Distance Neighbourhoods of Input-Driven Pushdown Automata
    Okhotin, Alexander
    Salomaa, Kai
    COMPUTER SCIENCE - THEORY AND APPLICATIONS (CSR 2017), 2017, 10304 : 260 - 272
  • [22] Generalizing input-driven languages: Theoretical and practical benefits
    Mandrioli, Dino
    Pradella, Matteo
    COMPUTER SCIENCE REVIEW, 2018, 27 : 61 - 87
  • [23] INPUT-DRIVEN LANGUAGES ARE RECOGNIZED IN LOG N SPACE
    VONBRAUNMUHL, B
    VERBEEK, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1983, 158 : 40 - 51
  • [24] Effects of Input Structure and Topology on Input-Driven Functional Connectivity Stability
    Dominey, Peter Ford
    ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING-ICANN 2024, PT X, 2024, 15025 : 91 - 105
  • [25] Further Closure Properties of Input-Driven Pushdown Automata
    Okhotin, Alexander
    Salomaa, Kai
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 224 - 236
  • [26] Input-Driven Pushdown Automata for Edit Distance Neighborhood
    Geffert, Viliam
    Bednarova, Zuzana
    Szabari, Alexander
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2019, 2019, 11647 : 113 - 126
  • [27] Edit distance neighbourhoods of input-driven pushdown automata
    Okhotin, Alexander
    Salomaa, Kai
    THEORETICAL COMPUTER SCIENCE, 2019, 777 : 417 - 430
  • [28] Input-Driven Double-Head Pushdown Automata
    Holzer, Markus
    Kutrib, Martin
    Malcher, Andreas
    Wendlandt, Matthias
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2022, 33 (03N04) : 285 - 311
  • [29] Descriptional complexity of unambiguous input-driven pushdown automata
    Okhotin, Alexander
    Salomaa, Kai
    THEORETICAL COMPUTER SCIENCE, 2015, 566 : 1 - 11
  • [30] WHEN INPUT-DRIVEN PUSHDOWN AUTOMATA MEET REVERSIBLITY
    Kutrib, Martin
    Malcher, Andreas
    Wendlandt, Matthias
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2016, 50 (04): : 313 - 330