Biologically plausible learning in neural networks: a lesson from bacterial chemotaxis

被引:0
|
作者
Yury P. Shimansky
机构
[1] Arizona State University,Harrington Department of Bioengineering
来源
Biological Cybernetics | 2009年 / 101卷
关键词
Learning; Neural networks; Biological optimization; Bacterial chemotaxis; Modification probability;
D O I
暂无
中图分类号
学科分类号
摘要
Learning processes in the brain are usually associated with plastic changes made to optimize the strength of connections between neurons. Although many details related to biophysical mechanisms of synaptic plasticity have been discovered, it is unclear how the concurrent performance of adaptive modifications in a huge number of spatial locations is organized to minimize a given objective function. Since direct experimental observation of even a relatively small subset of such changes is not feasible, computational modeling is an indispensable investigation tool for solving this problem. However, the conventional method of error back-propagation (EBP) employed for optimizing synaptic weights in artificial neural networks is not biologically plausible. This study based on computational experiments demonstrated that such optimization can be performed rather efficiently using the same general method that bacteria employ for moving closer to an attractant or away from a repellent. With regard to neural network optimization, this method consists of regulating the probability of an abrupt change in the direction of synaptic weight modification according to the temporal gradient of the objective function. Neural networks utilizing this method (regulation of modification probability, RMP) can be viewed as analogous to swimming in the multidimensional space of their parameters in the flow of biochemical agents carrying information about the optimality criterion. The efficiency of RMP is comparable to that of EBP, while RMP has several important advantages. Since the biological plausibility of RMP is beyond a reasonable doubt, the RMP concept provides a constructive framework for the experimental analysis of learning in natural neural networks.
引用
收藏
页码:379 / 385
页数:6
相关论文
共 50 条
  • [11] Temporal sequence learning via adaptation in biologically plausible spiking neural networks
    Renato Duarte
    Peggy Seriès
    Abigail Morrison
    BMC Neuroscience, 15 (Suppl 1)
  • [12] Are Rule-based Neural Networks Biologically Plausible?
    De, Callatay, A.
    Connection Science, 8 (01):
  • [13] Towards More Biologically Plausible Error-Driven Learning for Artificial Neural Networks
    Malinovska, Kristina
    Malinovsky, Ludovit
    Farkas, Igor
    ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING - ICANN 2018, PT III, 2018, 11141 : 228 - 231
  • [14] Biologically plausible gated recurrent neural networks for working memory and learning-to-learn
    van den Berg, Alexandra R.
    Roelfsema, Pieter R.
    Bohte, Sander M.
    PLOS ONE, 2024, 19 (12):
  • [15] Symmetric Predictive Estimator for Biologically Plausible Neural Learning
    Xu, David
    Clappison, Andrew
    Seth, Cameron
    Orchard, Jeff
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2018, 29 (09) : 4140 - 4151
  • [16] Biologically plausible learning in recurrent neural networks reproduces neural dynamics observed during cognitive tasks
    Miconi, Thomas
    ELIFE, 2017, 6
  • [17] Artificial Development of Biologically Plausible Neural-Symbolic Networks
    Joe Townsend
    Ed Keedwell
    Antony Galton
    Cognitive Computation, 2014, 6 : 18 - 34
  • [18] INTERNEURAL DELAY MODIFICATION SYNCHRONIZES BIOLOGICALLY PLAUSIBLE NEURAL NETWORKS
    VIBERT, JF
    PAKDAMAN, K
    AZMY, N
    NEURAL NETWORKS, 1994, 7 (04) : 589 - 607
  • [19] Artificial Development of Biologically Plausible Neural-Symbolic Networks
    Townsend, Joe
    Keedwell, Ed
    Galton, Antony
    COGNITIVE COMPUTATION, 2014, 6 (01) : 18 - 34
  • [20] An evolutionary strategy for supervised training of biologically plausible neural networks
    Belatreche, A
    Maguire, LP
    McGinnity, M
    Wu, QX
    PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2003, : 1524 - 1527