Learning capacity and function of stochastic reaction networks

IF 2.6 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Journal of Physics Complexity Pub Date : 2023-08-21 DOI:10.1088/2632-072X/acf264
A. Ramezanpour, A. Mashaghi
{"title":"Learning capacity and function of stochastic reaction networks","authors":"A. Ramezanpour, A. Mashaghi","doi":"10.1088/2632-072X/acf264","DOIUrl":null,"url":null,"abstract":"Biochemical reaction networks are expected to encode an efficient representation of the function of cells in a variable environment. It is thus important to see how these networks do learn and implement such representations. The first step in this direction is to characterize the function and learning capabilities of basic artificial reaction networks. In this study, we consider multilayer networks of reversible reactions that connect two layers of signal and response species through an intermediate layer of hidden species. We introduce a stochastic learning algorithm that updates the reaction rates based on the correlation values between reaction products and responses. Our findings indicate that the function of networks with random reaction rates, as well as their learning capacity for random signal-response activities, are critically determined by the number of reactants and reaction products. Moreover, the stored patterns exhibit different levels of robustness and qualities as the reaction rates deviate from their optimal values in a stochastic model of defect evolution. These findings can help suggest network modules that are better suited to specific functions, such as amplifiers or dampeners, or to the learning of biologically relevant signal-response activities.","PeriodicalId":53211,"journal":{"name":"Journal of Physics Complexity","volume":" ","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2023-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Physics Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/2632-072X/acf264","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Biochemical reaction networks are expected to encode an efficient representation of the function of cells in a variable environment. It is thus important to see how these networks do learn and implement such representations. The first step in this direction is to characterize the function and learning capabilities of basic artificial reaction networks. In this study, we consider multilayer networks of reversible reactions that connect two layers of signal and response species through an intermediate layer of hidden species. We introduce a stochastic learning algorithm that updates the reaction rates based on the correlation values between reaction products and responses. Our findings indicate that the function of networks with random reaction rates, as well as their learning capacity for random signal-response activities, are critically determined by the number of reactants and reaction products. Moreover, the stored patterns exhibit different levels of robustness and qualities as the reaction rates deviate from their optimal values in a stochastic model of defect evolution. These findings can help suggest network modules that are better suited to specific functions, such as amplifiers or dampeners, or to the learning of biologically relevant signal-response activities.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
随机反应网络的学习能力与功能
生化反应网络有望编码在可变环境中细胞功能的有效表示。因此,重要的是要了解这些网络是如何学习和实现这种表示的。这个方向的第一步是表征基本人工反应网络的功能和学习能力。在这项研究中,我们考虑了可逆反应的多层网络,该网络通过隐藏物种的中间层连接两层信号和响应物种。我们引入了一种随机学习算法,该算法基于反应产物和反应之间的相关值来更新反应速率。我们的研究结果表明,具有随机反应速率的网络的功能,以及它们对随机信号响应活动的学习能力,主要由反应物和反应产物的数量决定。此外,在缺陷演化的随机模型中,当反应速率偏离其最优值时,存储的模式表现出不同水平的鲁棒性和质量。这些发现有助于提出更适合特定功能(如放大器或阻尼器)或学习生物相关信号反应活动的网络模块。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Physics Complexity
Journal of Physics Complexity Computer Science-Information Systems
CiteScore
4.30
自引率
11.10%
发文量
45
审稿时长
14 weeks
期刊最新文献
Persistent Mayer Dirac. Fitness-based growth of directed networks with hierarchy The ultrametric backbone is the union of all minimum spanning forests. Exploring the space of graphs with fixed discrete curvatures Augmentations of Forman’s Ricci curvature and their applications in community detection
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1