arrow
返回

Stochastic Gradient Population Monte Carlo

delete2020-01-01
delete6
delete
OA
AI
Y
Yousef El-Laham *
M
Mónica F. Bugallo
DOI:10.1109/LSP.2019.2954048delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The population Monte Carlo (PMC) algorithm is a powerful adaptive importance sampling (AIS) methodology used for estimating expected values of random quantities w.r.t. some target probability distribution. At each iteration, a Markov transition kernel is used to propagate a set of particles. Importance weights of the particles are computed and then used to resample the particles that are most representative of the target distribution. At the end of the algorithm, the set of all particles and weights can be used to perform estimation. The resampling step is an adaptive mechanism of the PMC algorithm that allows for particles to locate the most significant regions of the sampling space. In this letter, we generalize the adaptation procedure of PMC sampling by providing a perspective based on stochastic optimization rather than resampling. The proposed method is more flexible than standard PMC as it allows the parameter adaptation to be resolved using any stochastic optimization method. We show that under certain conditions, the standard PMC algorithm is a special case of the proposed approach.
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Signal Processing Magazine 封面图
IEEE Signal Processing Magazine
IF:
9.6
论文数:
1.1W
被引数:
1.7W

机构

S
state university of new york (suny) system
学者数:
6.5W
论文数: 5.8W
被引数: 65
引用论文

引用论文

err分享
err收藏
Adaptive Importance Sampling The past, the present, and the future
err2017-07-01
err180
PREAI
errBugallo, Monica F.; Elvira, Victor; Martino, Luca; Luengo, David; Miguez, Joaquin; Djuric, Petar M.
err分享
err收藏
学者 查看更多内容