arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.01022stat.CO
收藏

近似贝叶斯计算中的局部核降维

Local Kernel Dimension Reduction in Approximate Bayesian Computation

Jin Zhou, Kenji Fukumizu

摘要:

近似贝叶斯计算(ABC)是一种流行的抽样方法,在涉及棘手的似然函数的应用。在不评估似然函数的情况下,ABC通过一组可接受的样本来近似后验分布,这些样本是用从先验分布中提取的参数模拟的,其中可接受性由样本的汇总统计量与观察值之间的距离确定。摘要统计量的充分性和维度在作业成本法的应用中起着核心作用。本文提出了局部梯度核降维(LGKDR)来构造ABC的低维汇总统计量。该方法通过隐式地考虑其中的所有非线性变换来识别原始汇总统计量的足够子空间,并且加权核用于投影的浓度。对边缘分布和回归模型都没有做出强有力的假设,允许在广泛的应用中使用。用简单拒绝ABC法和序贯蒙特卡罗ABC法进行了实验。结果被报道为竞争力,在前者和更好地在后者的情况下,其中蒙特卡罗误差被压缩尽可能多的。

英文摘要:

Approximate Bayesian Computation (ABC) is a popular sampling method in applications involving intractable likelihood functions. Without evaluating the likelihood function, ABC approximates the posterior distribution by the set of accepted samples which are simulated with parameters drawn from the prior distribution, where acceptance is determined by the distance between the summary statistics of the sample and the observation. The sufficiency and dimensionality of the summary statistics play a central role in the application of ABC. This paper proposes Local Gradient Kernel Dimension Reduction (LGKDR) to construct low dimensional summary statistics for ABC. The proposed method identifies a sufficient subspace of the original summary statistics by implicitly considers all nonlinear transforms therein, and a weighting kernel is used for the concentration of the projections. No strong assumptions are made on the marginal distributions nor the regression model, permitting usage in a wide range of applications. Experiments are done with both simple rejection ABC and sequential Monte Carlo ABC methods. Results are reported as competitive in the former and substantially better in the latter cases in which Monte Carlo errors are compressed as much as possible.

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

↑