Robust Digital Molecular Design of Binarized Neural Networks

IF 4.7 2区 生物学 Q1 GENETICS & HEREDITY
Mobile DNA Pub Date : 2021-01-01 DOI:10.4230/LIPIcs.DNA.27.1
Johannes Linder, Yuan-Jyue Chen, David Wong, Georg Seelig, L. Ceze, K. Strauss
{"title":"Robust Digital Molecular Design of Binarized Neural Networks","authors":"Johannes Linder, Yuan-Jyue Chen, David Wong, Georg Seelig, L. Ceze, K. Strauss","doi":"10.4230/LIPIcs.DNA.27.1","DOIUrl":null,"url":null,"abstract":"Molecular programming – a paradigm wherein molecules are engineered to perform computation – shows great potential for applications in nanotechnology, disease diagnostics and smart therapeutics. A key challenge is to identify systematic approaches for compiling abstract models of computation to molecules. Due to their wide applicability, one of the most useful abstractions to realize is neural networks. In prior work, real-valued weights were achieved by individually controlling the concentrations of the corresponding “weight” molecules. However, large-scale preparation of reactants with precise concentrations quickly becomes intractable. Here, we propose to bypass this fundamental problem using Binarized Neural Networks (BNNs), a model that is highly scalable in a molecular setting due to the small number of distinct weight values. We devise a noise-tolerant digital molecular circuit that compactly implements a majority voting operation on binary-valued inputs to compute the neuron output. The network is also rate-independent, meaning the speed at which individual reactions occur does not affect the computation, further increasing robustness to noise. We first demonstrate our design on the MNIST classification task by simulating the system as idealized chemical reactions. Next, we map the reactions to DNA strand displacement cascades, providing simulation results that demonstrate the practical feasibility of our approach. We perform extensive noise tolerance simulations, showing that digital molecular neurons are notably more robust to noise in the concentrations of chemical reactants compared to their analog counterparts. Finally, we provide initial experimental results of a single binarized neuron. Our work suggests a solid framework for building even more complex neural network computation. 2012 ACM Subject Classification Theory of computation → Models of computation; Applied computing","PeriodicalId":18854,"journal":{"name":"Mobile DNA","volume":"14 1","pages":"1:1-1:20"},"PeriodicalIF":4.7000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mobile DNA","FirstCategoryId":"99","ListUrlMain":"https://doi.org/10.4230/LIPIcs.DNA.27.1","RegionNum":2,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"GENETICS & HEREDITY","Score":null,"Total":0}
引用次数: 2

Abstract

Molecular programming – a paradigm wherein molecules are engineered to perform computation – shows great potential for applications in nanotechnology, disease diagnostics and smart therapeutics. A key challenge is to identify systematic approaches for compiling abstract models of computation to molecules. Due to their wide applicability, one of the most useful abstractions to realize is neural networks. In prior work, real-valued weights were achieved by individually controlling the concentrations of the corresponding “weight” molecules. However, large-scale preparation of reactants with precise concentrations quickly becomes intractable. Here, we propose to bypass this fundamental problem using Binarized Neural Networks (BNNs), a model that is highly scalable in a molecular setting due to the small number of distinct weight values. We devise a noise-tolerant digital molecular circuit that compactly implements a majority voting operation on binary-valued inputs to compute the neuron output. The network is also rate-independent, meaning the speed at which individual reactions occur does not affect the computation, further increasing robustness to noise. We first demonstrate our design on the MNIST classification task by simulating the system as idealized chemical reactions. Next, we map the reactions to DNA strand displacement cascades, providing simulation results that demonstrate the practical feasibility of our approach. We perform extensive noise tolerance simulations, showing that digital molecular neurons are notably more robust to noise in the concentrations of chemical reactants compared to their analog counterparts. Finally, we provide initial experimental results of a single binarized neuron. Our work suggests a solid framework for building even more complex neural network computation. 2012 ACM Subject Classification Theory of computation → Models of computation; Applied computing
二值化神经网络的鲁棒数字分子设计
分子编程——其中分子被设计来执行计算的一种范例——在纳米技术、疾病诊断和智能治疗方面显示出巨大的应用潜力。一个关键的挑战是找出系统的方法来编译分子的抽象计算模型。由于其广泛的适用性,最有用的抽象实现之一是神经网络。在以前的工作中,实值的重量是通过单独控制相应“重量”分子的浓度来实现的。然而,大规模制备具有精确浓度的反应物很快变得棘手。在这里,我们建议使用二值化神经网络(bnn)来绕过这个基本问题,由于不同权重值的数量较少,该模型在分子设置中具有高度可扩展性。我们设计了一个耐噪的数字分子电路,该电路紧凑地实现了对二值输入的多数投票操作,以计算神经元的输出。该网络也是速率无关的,这意味着单个反应发生的速度不会影响计算,从而进一步增强了对噪声的鲁棒性。我们首先通过将系统模拟为理想化学反应来在MNIST分类任务上演示我们的设计。接下来,我们将反应映射到DNA链位移级联,提供模拟结果,证明我们的方法的实际可行性。我们进行了广泛的噪声容忍模拟,表明数字分子神经元对化学反应物浓度下的噪声的鲁棒性明显高于模拟神经元。最后,我们提供了单个二值化神经元的初步实验结果。我们的工作为构建更复杂的神经网络计算提供了一个坚实的框架。2012 ACM学科分类:计算理论→计算模型;应用计算
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Mobile DNA
Mobile DNA GENETICS & HEREDITY-
CiteScore
8.20
自引率
6.10%
发文量
26
审稿时长
11 weeks
期刊介绍: Mobile DNA is an online, peer-reviewed, open access journal that publishes articles providing novel insights into DNA rearrangements in all organisms, ranging from transposition and other types of recombination mechanisms to patterns and processes of mobile element and host genome evolution. In addition, the journal will consider articles on the utility of mobile genetic elements in biotechnological methods and protocols.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信