메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 371-374

TRTRL: A localized resource-efficient learning algorithm for recurrent neural networks

Author keywords

Constraint optimization; Real time recurrent learning (RTRL); Recurrent neural networks

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; COMPUTER SIMULATION; CONSTRAINT THEORY; NEURAL NETWORKS; NEURONS; OPTIMIZATION; OXYGEN; PARALLEL ALGORITHMS; REAL TIME SYSTEMS; SENSITIVITY ANALYSIS;

EID: 34748822254     PISSN: 15483746     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MWSCAS.2006.382075     Document Type: Conference Paper
Times cited : (10)

References (11)
  • 1
    • 0001609567 scopus 로고
    • An efficient gradient-based algorithm for on-line training of recurrent network trajectories
    • R. J. Williams and J. Peng, An efficient gradient-based algorithm for on-line training of recurrent network trajectories, Neural Computation, vol. 2, pp. 490-501, 1990.
    • (1990) Neural Computation , vol.2 , pp. 490-501
    • Williams, R.J.1    Peng, J.2
  • 2
    • 0025503558 scopus 로고
    • Backpropagation through time: What it does and how to do it
    • October
    • P. Werbos, Backpropagation through time: what it does and how to do it," in Special issue on neural networks, Proceedings of IEEE, vol. 78, pp. 1550-1560, October 1990.
    • (1990) Special issue on neural networks, Proceedings of IEEE , vol.78 , pp. 1550-1560
    • Werbos, P.1
  • 3
    • 0001202594 scopus 로고
    • A learning algorithm for continually naming fully recurrent neural networks
    • R. J. Williams and D. Zipser, A learning algorithm for continually naming fully recurrent neural networks," Neural Computation, no. 1, pp. 270-280, 1989.
    • (1989) Neural Computation , Issue.1 , pp. 270-280
    • Williams, R.J.1    Zipser, D.2
  • 4
    • 0012061123 scopus 로고
    • A subgrouping strategy that reduces complexity and speeds up learning in recurrent networks
    • D. Zipser, A subgrouping strategy that reduces complexity and speeds up learning in recurrent networks," Neural Computation, no. 1, pp. 552-558, 1989.
    • (1989) Neural Computation , Issue.1 , pp. 552-558
    • Zipser, D.1
  • 6
    • 26444565569 scopus 로고
    • Finding structure in time
    • J. L. Elman, Finding structure in time," Cogniti e Science, no. 14, pp. 179-211, 1990.
    • (1990) Cogniti e Science , Issue.14 , pp. 179-211
    • Elman, J.L.1
  • 7
    • 0000053463 scopus 로고
    • A fixed size storage o(n3) time complexity learning algorithm for fully recurrent continually running networks
    • J. Schmidhuber, A fixed size storage o(n3) time complexity learning algorithm for fully recurrent continually running networks," Neural Computation, vol. 4, pp. 243-248, 1992.
    • (1992) Neural Computation , vol.4 , pp. 243-248
    • Schmidhuber, J.1
  • 8
    • 0000651310 scopus 로고
    • Green's function method for fast on-line learning algorithm of recurrent neural networks
    • G.-Z. Sun, H.-H. Chen, and Y.-C. Lee, Green's function method for fast on-line learning algorithm of recurrent neural networks.," in NIPS, pp. 333-340, 1991.
    • (1991) NIPS , pp. 333-340
    • Sun, G.-Z.1    Chen, H.-H.2    Lee, Y.-C.3
  • 9
    • 0017714604 scopus 로고
    • Oscillation and chaos in physiological control systems
    • July
    • M. Mackey and L. Glass, Oscillation and chaos in physiological control systems," Science, vol. 197, pp. 287-289, July 1977.
    • (1977) Science , vol.197 , pp. 287-289
    • Mackey, M.1    Glass, L.2
  • 10
    • 34748901363 scopus 로고    scopus 로고
    • R. C. III, Predicting the mackey-glass timeseries with cascade-correlation learning, in D. Touret k , G. Hinton and T. Sejnowski eds., Connectionist Models Summer School Proceedings, pp. 117-123, 1990. Carnegie Mellon University.
    • R. C. III, Predicting the mackey-glass timeseries with cascade-correlation learning," in D. Touret k , G. Hinton and T. Sejnowski eds., Connectionist Models Summer School Proceedings, pp. 117-123, 1990. Carnegie Mellon University.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.