跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要研究通用贝叶斯后验计算,未明确针对所列经济计量细分目标。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Leo L. Duan

传输蒙特卡洛:通过随机传输高精度近似后验

研究问题
对于高维、层级或多峰贝叶斯模型,如何构造快速且准确的后验近似,并从中生成独立样本以支持后续计算?
方法与思路
作者优化后验变量与简单多元均匀变量之间的随机传输计划,以位置尺度变换混合近似条件分布,再反向变换抽样。
材料陈述的贡献
摘要称方法产生高精度近似的独立样本并具有理论保证,在多峰分布、稀疏信号及图模型应用中展示比较优势。
阅读关注点
应核对优化目标、混合近似的实际实现、误差控制及独立性含义,并比较训练成本、抽样成本和基准调参方式。
阅读边界
仅据 OpenAlex 索引摘要,稿件版本未注明;独立抽样不意味着精确后验抽样,近似误差和优势条件未说明,不能推断刊本变化。

原文摘要

In Bayesian applications, there is a huge interest in rapid and accurate estimation of the posterior distribution, particularly for high dimensional or hierarchical models. In this article, we propose to use optimization to solve for a joint distribution (random transport plan) between two random variables, θ from the posterior distribution and β from the simple multivariate uniform. Specifically, we obtain an approximate estimate of the conditional distribution Π(β|θ) as an infinite mixture of simple location-scale changes; applying the Bayes’ theorem, Π(θ|β) can be sampled as one of the reversed transforms from the uniform, with the weight proportional to the posterior density/mass function. This produces independent random samples with high approximation accuracy, as well as nice theoretical guarantees. Our method shows compelling advantages in performance and accuracy, compared to the state-of-the-art Markov chain Monte Carlo and approximations such as variational Bayes and normalizing flow. We illustrate this approach via several challenging applications, such as sampling from multi-modal distribution, estimating sparse signals in high dimension, and soft-thresholding of a graph with a prior on the degrees. Supplementary materials for this article, including the source code and additional comparison with popular alternative algorithms are available on the journal website.

笔记与分组
相关领域论文