论文检索

近似贝叶斯计算中的模型误设：后果与诊断AI 解读

Summary We analyse the behaviour of approximate Bayesian computation (ABC) when the model generating the simulated data differs from the actual data-generating process, i.e. when the data simulator in ABC is misspecified. We demonstrate both theoretically and in simple, but practically relevant, examples that when the model is misspecified different versions of ABC can yield substantially different results. Our theoretical results demonstrate that even though the model is…

基于 Wasserstein 距离的近似贝叶斯计算AI 解读

Summary A growing number of generative statistical models do not permit the numerical evaluation of their likelihood functions. Approximate Bayesian computation has become a popular approach to overcome this issue, in which one simulates synthetic data sets given parameters and compares summaries of these data sets with the corresponding observed values. We propose to avoid the use of summaries and the ensuing loss of information by instead using the Wasserstein distance…

贝叶斯模型选择中的相关摘要统计量AI 解读

Summary The choice of the summary statistics that are used in Bayesian inference and in particular in approximate Bayesian computation algorithms has bearings on the validation of the resulting inference. Those statistics are nonetheless customarily used in approximate Bayesian computation algorithms without consistency checks. We derive necessary and sufficient conditions on summary statistics for the corresponding Bayes factor to be convergent, namely to select the true…

Metropolis–Hastings 算法的简易 Rao–Blackwell 化AI 解读

Casella and Robert [Biometrika 83 (1996) 81–94] presented a general Rao–Blackwellization principle for accept-reject and Metropolis–Hastings schemes that leads to significant decreases in the variance of the resulting estimators, but at a high cost in computation and storage. Adopting a completely different perspective, we introduce instead a universal scheme that guarantees variance reductions in all Metropolis–Hastings-based estimators while keeping the computation cost…

最近邻分类的贝叶斯重新评估AI 解读

The k-nearest-neighbor (knn) procedure is a well-known deterministic method used in supervised classification. This article proposes a reassessment of this approach as a statistical technique derived from a proper probabilistic model; in particular, we modify the assessment found in Holmes and Adams, and evaluated by Manocha and Girolami, where the underlying probabilistic model is not completely well defined. Once provided with a clear probabilistic basis for the knn…

可逆跳跃、出生死亡及更一般的连续时间 MCMC 采样器AI 解读

Summary Reversible jump methods are the most commonly used Markov chain Monte Carlo tool for exploring variable dimension statistical models. Recently, however, an alternative approach based on birth-and-death processes has been proposed by Stephens for mixtures of distributions. We show that the birth-and-death setting can be generalized to include other types of continuous time jumps like split-and-combine moves in the spirit of Richardson and Green. We illustrate these…

对 Brooks、Giudici 与 Roberts 论文的讨论AI 解读

This paper aims to develop general strategies for improving jumps between models in reversible jump Markov chain Monte Carlo (MCMC) algorithms, which is quite an important and timely goal. Indeed, in practical implementations of the method, we usually find that the choice of proposals is paramount: in many cases, the ‘natural choice’ leads to a zero acceptance probability and the construction of well-tuned moves is often quite costly. Given that the reversible jump MCMC…

摘要暂缺

摘要暂缺

混合模型后验分布的计算与推断困难AI 解读

This article deals with both exploration and interpretation problems related to posterior distributions for mixture models. The specification of mixture posterior distributions means that the presence of k! modes is known immediately. Standard Markov chain Monte Carlo (MCMC) techniques usually have difficulties with well-separated modes such as occur here; the MCMC sampler stays within a neighborhood of a local mode and fails to visit other equally important modes. We show…

连续状态空间马尔可夫链的离散化与 MCMC 收敛评估AI 解读

We show that continuous state-space Markov chains can be rigorously discretized into finite Markov chains. The idea is to subsample the continuous chain at renewal times related to small sets that control the discretization. Once a finite Markov chain is derived from the Markov chain Monte Carlo output, general convergence properties on finite state spaces can be exploited for convergence assessment in several directions. Our choice is based on a divergence criterion derived…

连续状态马尔可夫链的离散化与 MCMC 收敛评估AI 解读

We show that continuous state-space Markov chains can be rigorously discretized into finite Markov chains. The idea is to subsample the continuous chain at renewal times related to small sets that control the discretization. Once a finite Markov chain is derived from the Markov chain Monte Carlo output, general convergence properties on finite state spaces can be exploited for convergence assessment in several directions. Our choice is based on a divergence criterion derived…

利用先验反馈法进行序约束下的最大似然估计AI 解读

Algorithms for deriving isotonic regression estimators in order-restricted linear models and more generally restricted maximum likelihood estimators are usually quite dependent on the particular problem considered. We propose here an optimization method based on a sequence of formal Bayes estimates whose variances converge to zero. This method, akin to simulated annealing, can be applied “universally”; that is, as long as these Bayes estimators can be derived by exact…

利用先验反馈法进行顺序约束下的极大似然估计AI 解读

Algorithms for deriving isotonic regression estimators in order-restricted linear models and more generally restricted maximum likelihood estimators are usually quite dependent on the particular problem considered. We propose here an optimization method based on a sequence of formal Bayes estimates whose variances converge to zero. This method, akin to simulated annealing, can be applied “universally”; that is, as long as these Bayes estimators can be derived by exact…

通过贝叶斯抽样估计有限混合分布AI 解读

SUMMARY A formal Bayesian analysis of a mixture model usually leads to intractable calculations, since the posterior distribution takes into account all the partitions of the sample. We present approximation methods which evaluate the posterior distribution and Bayes estimators by Gibbs sampling, relying on the missing data structure of the mixture model. The data augmentation method is shown to converge geometrically, since a duality principle transfers properties from the…

摘要暂缺