A numerically stable online implementation and exploration of WAIC through variations of the predictive density, using NIMBLE

by   Joshua E. Hug, et al.

We go through the process of crafting a robust and numerically stable online algorithm for the computation of the Watanabe-Akaike information criteria (WAIC). We implement this algorithm in the NIMBLE software. The implementation is performed in an online manner and does not require the storage in memory of the complete samples from the posterior distribution. This algorithm allows the user to specify a specific form of the predictive density to be used in the computation of WAIC, in order to cater to specific prediction goals. We then comment and explore via simulations the use of different forms of the predictive density in the context of different predictive goals. We find that when using marginalized predictive densities, WAIC is sensitive to the grouping of the observations into a joint density.



There are no comments yet.


page 1

page 2

page 3

page 4


Predictive density estimation under the Wasserstein loss

We investigate predictive density estimation under the L^2 Wasserstein l...

Bayesian Shrinkage Approaches to Unbalanced Problems of Estimation and Prediction on the Basis of Negative Multinomial Samples

In this paper, we treat estimation and prediction problems where negativ...

Robust Bayes-Like Estimation: Rho-Bayes estimation

We consider the problem of estimating the joint distribution P of n inde...

Tree based credible set estimation

Estimating a joint Highest Posterior Density credible set for a multivar...

3D Density Histograms for Criteria-driven Edge Bundling

This paper presents a graph bundling algorithm that agglomerates edges t...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.