Two-stage Metropolis-Hastings for tall data

From MaRDI portal
Publication:724596

DOI10.1007/S00357-018-9248-ZzbMATH Open1391.62120DBLPjournals/classification/PayneM18arXiv1411.5653OpenAlexW2625684004WikidataQ57146845 ScholiaQ57146845MaRDI QIDQ724596FDOQ724596


Authors: Richard D. Payne, Bani Mallick Edit this on Wikidata


Publication date: 26 July 2018

Published in: Journal of Classification (Search for Journal in Brave)

Abstract: This paper discusses the challenges presented by tall data problems associated with Bayesian classification (specifically binary classification) and the existing methods to handle them. Current methods include parallelizing the likelihood, subsampling, and consensus Monte Carlo. A new method based on the two-stage Metropolis-Hastings algorithm is also proposed. The purpose of this algorithm is to reduce the exact likelihood computational cost in the tall data situation. In the first stage, a new proposal is tested by the approximate likelihood based model. The full likelihood based posterior computation will be conducted only if the proposal passes the first stage screening. Furthermore, this method can be adopted into the consensus Monte Carlo framework. The two-stage method is applied to logistic regression, hierarchical logistic regression, and Bayesian multivariate adaptive regression splines.


Full work available at URL: https://arxiv.org/abs/1411.5653




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Two-stage Metropolis-Hastings for tall data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724596)