%0 Conference Paper %1 pmlr-v97-xing19a %A Xing, Hanwen %A Nicholls, Geoff %A Lee, Jeong %B Proceedings of the 36th International Conference on Machine Learning %C Long Beach, California, USA %D 2019 %E Chaudhuri, Kamalika %E Salakhutdinov, Ruslan %I PMLR %K approximate bayesian calibration computation readings sampling %P 6912--6920 %T Calibrated Approximate Bayesian Inference %U http://proceedings.mlr.press/v97/xing19a.html %V 97 %X We give a general purpose computational framework for estimating the bias in coverage resulting from making approximations in Bayesian inference. Coverage is the probability credible sets cover true parameter values. We show how to estimate the actual coverage an approximation scheme achieves when the ideal observation model and the prior can be simulated, but have been replaced, in the Monte Carlo, with approximations as they are intractable. Coverage estimation procedures given in Lee et al. (2018) work well on simple problems, but are biased, and do not scale well, as those authors note. For example, the methods of Lee et al. (2018) fail for calibration of an approximate completely collapsed MCMC algorithm for partition structure in a Dirichlet process for clustering group labels in a hierarchical model. By exploiting the symmetry of the coverage error under permutation of low level group labels and smoothing with Bayesian Additive Regression Trees, we are able to show that the original approximate inference had poor coverage and should not be trusted.

@inproceedings{pmlr-v97-xing19a, abstract = {We give a general purpose computational framework for estimating the bias in coverage resulting from making approximations in Bayesian inference. Coverage is the probability credible sets cover true parameter values. We show how to estimate the actual coverage an approximation scheme achieves when the ideal observation model and the prior can be simulated, but have been replaced, in the Monte Carlo, with approximations as they are intractable. Coverage estimation procedures given in Lee et al. (2018) work well on simple problems, but are biased, and do not scale well, as those authors note. For example, the methods of Lee et al. (2018) fail for calibration of an approximate completely collapsed MCMC algorithm for partition structure in a Dirichlet process for clustering group labels in a hierarchical model. By exploiting the symmetry of the coverage error under permutation of low level group labels and smoothing with Bayesian Additive Regression Trees, we are able to show that the original approximate inference had poor coverage and should not be trusted.}, added-at = {2020-01-13T12:46:06.000+0100}, address = {Long Beach, California, USA}, author = {Xing, Hanwen and Nicholls, Geoff and Lee, Jeong}, biburl = {https://www.bibsonomy.org/bibtex/27cc24d1b557c0f887359f607a5010040/kirk86}, booktitle = {Proceedings of the 36th International Conference on Machine Learning}, description = {Calibrated Approximate Bayesian Inference}, editor = {Chaudhuri, Kamalika and Salakhutdinov, Ruslan}, interhash = {e07e028566e1900467876bc6284acb78}, intrahash = {7cc24d1b557c0f887359f607a5010040}, keywords = {approximate bayesian calibration computation readings sampling}, month = {09--15 Jun}, pages = {6912--6920}, pdf = {http://proceedings.mlr.press/v97/xing19a/xing19a.pdf}, publisher = {PMLR}, series = {Proceedings of Machine Learning Research}, timestamp = {2020-01-13T12:46:06.000+0100}, title = {Calibrated Approximate {B}ayesian Inference}, url = {http://proceedings.mlr.press/v97/xing19a.html}, volume = 97, year = 2019 }