<HashMap><database>biostudies-literature</database><scores/><additional><omics_type>Unknown</omics_type><volume>78(4)</volume><submitter>Zhou X</submitter><pubmed_abstract>This paper advocates proximal Markov Chain Monte Carlo (ProxMCMC) as a flexible and general Bayesian inference framework for constrained or regularized estimation. Originally introduced in the Bayesian imaging literature, ProxMCMC employs the Moreau-Yosida envelope for a smooth approximation of the total-variation regularization term, fixes variance and regularization strength parameters as constants, and uses the Langevin algorithm for the posterior sampling. We extend ProxMCMC to be fully Bayesian by providing data-adaptive estimation of all parameters including the regularization strength parameter. More powerful sampling algorithms such as Hamiltonian Monte Carlo are employed to scale ProxMCMC to high-dimensional problems. Analogous to the proximal algorithms in optimization, ProxMCMC </pubmed_abstract><journal>The American statistician</journal><pagination>379-390</pagination><full_dataset_link>https://www.ebi.ac.uk/biostudies/studies/S-EPMC11670895</full_dataset_link><repository>biostudies-literature</repository><pubmed_title>Proximal MCMC for Bayesian Inference of Constrained and Regularized Estimation.</pubmed_title><pmcid>PMC11670895</pmcid><pubmed_authors>Chi EC</pubmed_authors><pubmed_authors>Heng Q</pubmed_authors><pubmed_authors>Zhou X</pubmed_authors><pubmed_authors>Zhou H</pubmed_authors></additional><is_claimable>false</is_claimable><name>Proximal MCMC for Bayesian Inference of Constrained and Regularized Estimation.</name><description>This paper advocates proximal Markov Chain Monte Carlo (ProxMCMC) as a flexible and general Bayesian inference framework for constrained or regularized estimation. Originally introduced in the Bayesian imaging literature, ProxMCMC employs the Moreau-Yosida envelope for a smooth approximation of the total-variation regularization term, fixes variance and regularization strength parameters as constants, and uses the Langevin algorithm for the posterior sampling. We extend ProxMCMC to be fully Bayesian by providing data-adaptive estimation of all parameters including the regularization strength parameter. More powerful sampling algorithms such as Hamiltonian Monte Carlo are employed to scale ProxMCMC to high-dimensional problems. Analogous to the proximal algorithms in optimization, ProxMCMC </description><dates><release>2024-01-01T00:00:00Z</release><publication>2024</publication><modification>2025-04-18T22:01:22.822Z</modification><creation>2025-04-07T09:56:54.291Z</creation></dates><accession>S-EPMC11670895</accession><cross_references><pubmed>39726826</pubmed><doi>10.1080/00031305.2024.2308821</doi></cross_references></HashMap>