arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1904.00670stat.MLcs.LGstat.COstat.ME
收藏

稳健优化蒙特卡罗

Robust Optimisation Monte Carlo

University of Edinburgh(爱丁堡大学)

Borislav Ikonomov, Michael U. Gutmann

摘要:

本文是关于参数统计模型的贝叶斯推断,这些模型是由一个随机模拟器定义的,该模拟器指定数据是如何生成的。精确的采样是可能的,但是估计似然函数通常是昂贵的。近似贝叶斯计算(ABC)是在这种情况下执行近似推理的框架。虽然基本的ABC算法广泛适用,但它们的速度非常慢,许多研究都集中在提高效率上。优化蒙特卡罗(OMC)最近被提出作为一种有效的和有益的并行方法,利用优化来加速推理。在本文中,我们证明了一个重要的OMC以前未认识到的故障模式:它产生强烈的过度自信的近似崩溃区域相似或接近恒定的可能性到一个单一的点。我们提出了一个有效的,强大的概括OMC纠正这一点。它做了更少的假设,保留了OMC的主要优点,并且可以作为OMC的后处理或作为独立计算来执行。我们证明了建议的鲁棒OMC玩具的例子和任务中的反图形,我们执行贝叶斯推断与复杂的图像渲染器的有效性。

英文摘要:

This paper is on Bayesian inference for parametric statistical models that are defined by a stochastic simulator which specifies how data is generated. Exact sampling is then possible but evaluating the likelihood function is typically prohibitively expensive. Approximate Bayesian Computation (ABC) is a framework to perform approximate inference in such situations. While basic ABC algorithms are widely applicable, they are notoriously slow and much research has focused on increasing their efficiency. Optimisation Monte Carlo (OMC) has recently been proposed as an efficient and embarrassingly parallel method that leverages optimisation to accelerate the inference. In this paper, we demonstrate an important previously unrecognised failure mode of OMC: It generates strongly overconfident approximations by collapsing regions of similar or near-constant likelihood into a single point. We propose an efficient, robust generalisation of OMC that corrects this. It makes fewer assumptions, retains the main benefits of OMC, and can be performed either as post-processing to OMC or as a stand-alone computation. We demonstrate the effectiveness of the proposed Robust OMC on toy examples and tasks in inverse-graphics where we perform Bayesian inference with a complex image renderer.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑