{"title":"Issues of parameterization and computation for posterior inference in partially identified models","authors":"Seren Lee, Paul Gustafson","doi":"arxiv-2408.10416","DOIUrl":null,"url":null,"abstract":"A partially identified model, where the parameters can not be uniquely\nidentified, often arises during statistical analysis. While researchers\nfrequently use Bayesian inference to analyze the models, when Bayesian\ninference with an off-the-shelf MCMC sampling algorithm is applied to a\npartially identified model, the computational performance can be poor. It is\nfound that using importance sampling with transparent reparameterization (TP)\nis one remedy. This method is preferable since the model is known to be\nrendered as identified with respect to the new parameterization, and at the\nsame time, it may allow faster, i.i.d. Monte Carlo sampling by using conjugate\nconvenience priors. In this paper, we explain the importance sampling method\nwith the TP and a pseudo-TP. We introduce the pseudo-TP, an alternative to TP,\nsince finding a TP is sometimes difficult. Then, we test the methods'\nperformance in some scenarios and compare it to the performance of the\noff-the-shelf MCMC method - Gibbs sampling - applied in the original\nparameterization. While the importance sampling with TP (ISTP) shows generally\nbetter results than off-the-shelf MCMC methods, as seen in the compute time and\ntrace plots, it is also seen that finding a TP which is necessary for the\nmethod may not be easy. On the other hand, the pseudo-TP method shows a mixed\nresult and room for improvement since it relies on an approximation, which may\nnot be adequate for a given model and dataset.","PeriodicalId":501215,"journal":{"name":"arXiv - STAT - Computation","volume":"66 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.10416","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A partially identified model, where the parameters can not be uniquely
identified, often arises during statistical analysis. While researchers
frequently use Bayesian inference to analyze the models, when Bayesian
inference with an off-the-shelf MCMC sampling algorithm is applied to a
partially identified model, the computational performance can be poor. It is
found that using importance sampling with transparent reparameterization (TP)
is one remedy. This method is preferable since the model is known to be
rendered as identified with respect to the new parameterization, and at the
same time, it may allow faster, i.i.d. Monte Carlo sampling by using conjugate
convenience priors. In this paper, we explain the importance sampling method
with the TP and a pseudo-TP. We introduce the pseudo-TP, an alternative to TP,
since finding a TP is sometimes difficult. Then, we test the methods'
performance in some scenarios and compare it to the performance of the
off-the-shelf MCMC method - Gibbs sampling - applied in the original
parameterization. While the importance sampling with TP (ISTP) shows generally
better results than off-the-shelf MCMC methods, as seen in the compute time and
trace plots, it is also seen that finding a TP which is necessary for the
method may not be easy. On the other hand, the pseudo-TP method shows a mixed
result and room for improvement since it relies on an approximation, which may
not be adequate for a given model and dataset.