Adaptiveness Of Cma Based Samplers

PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCO'17 COMPANION)(2017)

引用 0|浏览0
暂无评分
摘要
We turn the Covariance Matrix Adaptation Evolution Strategy into an adaptive Markov Chain Monte Carlo (or MCMC) sampling algorithm that adapts online to the target distribution, i.e. the distribution to be sampled from. We call the resulting algorithm CMA-Sampling. It exhibits a higher convergence rate, a better mixing, and consequently a more effective MCMC sampler. We look at a few variants and compare their adaptiveness to a number of other adaptive samplers, including Haario et. al's AM sampler, on a testsuite of 4 target distributions.
更多
查看译文
关键词
Adaptive Markov Chain Monte Carlo,Covariance Matrix Adaptation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要