• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

分子建模与置信传播算法中的因式分解

Factorization in molecular modeling and belief propagation algorithms.

作者信息

Du Bochuan, Tian Pu

机构信息

School of Life Sciences, Jilin University, Changchun 130012, China.

School of Artificial Intelligence, Jilin University, Changchun 130012, China.

出版信息

Math Biosci Eng. 2023 Nov 27;20(12):21147-21162. doi: 10.3934/mbe.2023935.

DOI:10.3934/mbe.2023935
PMID:38124591
Abstract

Factorization reduces computational complexity, and is therefore an important tool in statistical machine learning of high dimensional systems. Conventional molecular modeling, including molecular dynamics and Monte Carlo simulations of molecular systems, is a large research field based on approximate factorization of molecular interactions. Recently, the local distribution theory was proposed to factorize joint distribution of a given molecular system into trainable local distributions. Belief propagation algorithms are a family of exact factorization algorithms for (junction) trees, and are extended to approximate loopy belief propagation algorithms for graphs with loops. Despite the fact that factorization of probability distribution is the common foundation, computational research in molecular systems and machine learning studies utilizing belief propagation algorithms have been carried out independently with respective track of algorithm development. The connection and differences among these factorization algorithms are briefly presented in this perspective, with the hope to intrigue further development of factorization algorithms for physical modeling of complex molecular systems.

摘要

因式分解降低了计算复杂度,因此是高维系统统计机器学习中的一个重要工具。传统的分子建模,包括分子系统的分子动力学和蒙特卡罗模拟,是一个基于分子相互作用近似因式分解的大型研究领域。最近,提出了局部分布理论,将给定分子系统的联合分布分解为可训练的局部分布。置信传播算法是一类用于(连接)树的精确因式分解算法,并扩展为用于有环图的近似循环置信传播算法。尽管概率分布的因式分解是共同基础,但分子系统的计算研究和利用置信传播算法的机器学习研究是各自独立进行的,有着各自的算法发展轨迹。从这个角度简要介绍了这些因式分解算法之间的联系和差异,希望能激发用于复杂分子系统物理建模的因式分解算法的进一步发展。

相似文献

1
Factorization in molecular modeling and belief propagation algorithms.分子建模与置信传播算法中的因式分解
Math Biosci Eng. 2023 Nov 27;20(12):21147-21162. doi: 10.3934/mbe.2023935.
2
Tensor Network Message Passing.张量网络消息传递
Phys Rev Lett. 2024 Mar 15;132(11):117401. doi: 10.1103/PhysRevLett.132.117401.
3
Correctness of belief propagation in Gaussian graphical models of arbitrary topology.任意拓扑结构高斯图形模型中信念传播的正确性。
Neural Comput. 2001 Oct;13(10):2173-200. doi: 10.1162/089976601750541769.
4
Accuracy of Loopy belief propagation in Gaussian models.
Neural Netw. 2009 May;22(4):385-94. doi: 10.1016/j.neunet.2009.01.003. Epub 2009 Jan 30.
5
Making High-Dimensional Molecular Distribution Functions Tractable through Belief Propagation on Factor Graphs.通过因子图上的置信传播使高维分子分布函数易于处理。
J Phys Chem B. 2021 Oct 14;125(40):11150-11158. doi: 10.1021/acs.jpcb.1c05717. Epub 2021 Sep 29.
6
Learning unbelievable probabilities.学习令人难以置信的概率。
Adv Neural Inf Process Syst. 2011 Dec;24:738-746.
7
Estimation and marginalization using the Kikuchi approximation methods.使用菊池近似方法进行估计和边缘化。
Neural Comput. 2005 Aug;17(8):1836-73. doi: 10.1162/0899766054026693.
8
Joint propagation of variability and imprecision in assessing the risk of groundwater contamination.评估地下水污染风险时变异性与不精确性的联合传播
J Contam Hydrol. 2007 Aug 15;93(1-4):72-84. doi: 10.1016/j.jconhyd.2007.01.015. Epub 2007 Jan 27.
9
Linear response algorithms for approximate inference in graphical models.用于图形模型近似推理的线性响应算法。
Neural Comput. 2004 Jan;16(1):197-221. doi: 10.1162/08997660460734056.
10
Systematic Testing of Belief-Propagation Estimates for Absolute Free Energies in Atomistic Peptides and Proteins.原子肽和蛋白质中绝对自由能的置信传播估计的系统测试
J Chem Theory Comput. 2018 Jan 9;14(1):426-443. doi: 10.1021/acs.jctc.7b00775. Epub 2017 Dec 22.