• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

交换蒙特卡罗方法中交换比率的渐近行为。

Asymptotic behavior of exchange ratio in exchange Monte Carlo method.

作者信息

Nagata Kenji, Watanabe Sumio

机构信息

Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology, Japan.

出版信息

Neural Netw. 2008 Sep;21(7):980-8. doi: 10.1016/j.neunet.2007.11.002. Epub 2008 Feb 12.

DOI:10.1016/j.neunet.2007.11.002
PMID:18367375
Abstract

The exchange Monte Carlo (EMC) algorithm is well known as being an improvement on the Markov Chain Monte Carlo method. Although it has been shown to be effective in many different contexts, the mathematical foundation of the EMC method has not yet been established. In this paper, we derive the asymptotic behavior of the symmetrized Kullback divergence and the exchange ratio, which is the acceptance ratio of the exchange process for the EMC method. In addition, based on these derived results, we propose optimal settings for the EMC method.

摘要

交换蒙特卡罗(EMC)算法是对马尔可夫链蒙特卡罗方法的一种改进,这一点广为人知。尽管它已在许多不同情况下被证明是有效的,但EMC方法的数学基础尚未确立。在本文中,我们推导了对称化库尔贝克散度和交换率的渐近行为,其中交换率是EMC方法中交换过程的接受率。此外,基于这些推导结果,我们提出了EMC方法的最优设置。

相似文献

1
Asymptotic behavior of exchange ratio in exchange Monte Carlo method.交换蒙特卡罗方法中交换比率的渐近行为。
Neural Netw. 2008 Sep;21(7):980-8. doi: 10.1016/j.neunet.2007.11.002. Epub 2008 Feb 12.
2
Problems with determination of noncommunicating classes for Monte Carlo Markov chain applications in pedigree analysis.系谱分析中蒙特卡罗马尔可夫链应用的非连通类确定问题。
Biometrics. 1998 Jun;54(2):416-25.
3
Markov chains of infinite order and asymptotic satisfaction of balance: application to the adaptive integration method.无限阶马尔可夫链与平衡的渐近满足性:在自适应积分方法中的应用
J Phys Chem B. 2005 Apr 14;109(14):6701-4. doi: 10.1021/jp045508t.
4
Is anoxic depolarisation associated with an ADC threshold? A Markov chain Monte Carlo analysis.缺氧去极化与表观扩散系数(ADC)阈值有关吗?马尔可夫链蒙特卡罗分析。
NMR Biomed. 2005 Dec;18(8):587-94. doi: 10.1002/nbm.996.
5
Comment on "On the Metropolis-Hastings acceptance probability to add or drop a quantitative trait locus in Markov chain Monte Carlo-based Bayesian analyses".对《关于在基于马尔可夫链蒙特卡罗的贝叶斯分析中添加或删除数量性状基因座的 metropolis - hastings 接受概率》的评论
Genetics. 2004 Jun;167(2):1037. doi: 10.1534/genetics.103.025320.
6
A quasi-Monte Carlo Metropolis algorithm.一种准蒙特卡罗梅特罗波利斯算法。
Proc Natl Acad Sci U S A. 2005 Jun 21;102(25):8844-9. doi: 10.1073/pnas.0409596102. Epub 2005 Jun 13.
7
Reversible-jump Markov chain Monte Carlo for quantitative trait loci mapping.用于数量性状基因座定位的可逆跳跃马尔可夫链蒙特卡罗方法
Genetics. 2004 Jun;167(2):1033-5. doi: 10.1534/genetics.103.025536.
8
Correcting for ascertainment bias in the inference of population structure.在群体结构推断中校正确认偏倚。
Bioinformatics. 2009 Feb 15;25(4):552-4. doi: 10.1093/bioinformatics/btn665. Epub 2009 Jan 9.
9
Nonparametric identification of population models: an MCMC approach.群体模型的非参数识别:一种马尔可夫链蒙特卡罗方法。
IEEE Trans Biomed Eng. 2008 Jan;55(1):41-50. doi: 10.1109/TBME.2007.902240.
10
Improved short adjacent repeat identification using three evolutionary Monte Carlo schemes.使用三种进化蒙特卡罗方法改进短相邻重复序列识别
Int J Data Min Bioinform. 2013;8(4):462-79. doi: 10.1504/ijdmb.2013.056614.

引用本文的文献

1
Learning Coefficient of Vandermonde Matrix-Type Singularities in Model Selection.模型选择中范德蒙德矩阵型奇点的学习系数
Entropy (Basel). 2019 Jun 4;21(6):561. doi: 10.3390/e21060561.
2
Development of spectral decomposition based on Bayesian information criterion with estimation of confidence interval.
Sci Technol Adv Mater. 2020 Jul 2;21(1):402-419. doi: 10.1080/14686996.2020.1773210.
3
Spectrum adapted the expectation-maximization algorithm for high-throughput peak shift analysis.Spectrum采用了期望最大化算法进行高通量峰移分析。
Sci Technol Adv Mater. 2019 Jun 27;20(1):733-745. doi: 10.1080/14686996.2019.1620123. eCollection 2019.