Proximal-IMH: Proximal Posterior Proposals for Independent Metropolis-Hastings with Approximate Operators. Chen, Y. & Biros, G. May, 2026. arXiv:2602.21426 [cs.LG]
Paper doi abstract bibtex We are considering the problem of sampling from a posterior distribution related to Bayesian inverse problems arising in science, engineering, and imaging. Our method belongs to the family of independence Metropolis–Hastings (IMH) sampling algorithms. These are quite common in Bayesian inference. Relying on the existence of an approximate posterior distribution that is cheaper to sample from but can have significant bias, we introduce Proximal-IMH, a scheme that removes this bias: it corrects samples from the approximate posterior solving an auxiliary optimization problem, yielding a local adjustment that trades off adherence to the exact model against stability around the approximate reference point. For idealized settings, we prove that the proximal correction tightens the match between approximate and exact posteriors, and thereby improves acceptance rates and mixing. The new method works with both linear and nonlinear input-output operators and is especially suitable for inverse problems where exact posterior sampling is too expensive. We perform several numerical experiments that include multimodal and data-driven priors and nonlinear input-output operators. The results show that Proximal-IMH reliably outperforms existing IMH variants.
@misc{chen_proximal-imh_2026,
title = {Proximal-{IMH}: {Proximal} {Posterior} {Proposals} for {Independent} {Metropolis}-{Hastings} with {Approximate} {Operators}},
shorttitle = {Proximal-{IMH}},
url = {http://arxiv.org/abs/2602.21426},
doi = {10.48550/arXiv.2602.21426},
abstract = {We are considering the problem of sampling from a posterior distribution related to Bayesian inverse problems arising in science, engineering, and imaging. Our method belongs to the family of independence Metropolis–Hastings (IMH) sampling algorithms. These are quite common in Bayesian inference. Relying on the existence of an approximate posterior distribution that is cheaper to sample from but can have significant bias, we introduce Proximal-IMH, a scheme that removes this bias: it corrects samples from the approximate posterior solving an auxiliary optimization problem, yielding a local adjustment that trades off adherence to the exact model against stability around the approximate reference point. For idealized settings, we prove that the proximal correction tightens the match between approximate and exact posteriors, and thereby improves acceptance rates and mixing. The new method works with both linear and nonlinear input-output operators and is especially suitable for inverse problems where exact posterior sampling is too expensive. We perform several numerical experiments that include multimodal and data-driven priors and nonlinear input-output operators. The results show that Proximal-IMH reliably outperforms existing IMH variants.},
language = {en},
urldate = {2026-06-15},
publisher = {arXiv},
author = {Chen, Youguang and Biros, George},
month = may,
year = {2026},
note = {arXiv:2602.21426 [cs.LG]},
keywords = {Computer Science - Machine Learning, Statistics - Computation, WG: Accelerated},
}
Downloads: 0
{"_id":"PCazJA7vBf89AwtWv","bibbaseid":"chen-biros-proximalimhproximalposteriorproposalsforindependentmetropolishastingswithapproximateoperators-2026","author_short":["Chen, Y.","Biros, G."],"bibdata":{"bibtype":"misc","type":"misc","title":"Proximal-IMH: Proximal Posterior Proposals for Independent Metropolis-Hastings with Approximate Operators","shorttitle":"Proximal-IMH","url":"http://arxiv.org/abs/2602.21426","doi":"10.48550/arXiv.2602.21426","abstract":"We are considering the problem of sampling from a posterior distribution related to Bayesian inverse problems arising in science, engineering, and imaging. Our method belongs to the family of independence Metropolis–Hastings (IMH) sampling algorithms. These are quite common in Bayesian inference. Relying on the existence of an approximate posterior distribution that is cheaper to sample from but can have significant bias, we introduce Proximal-IMH, a scheme that removes this bias: it corrects samples from the approximate posterior solving an auxiliary optimization problem, yielding a local adjustment that trades off adherence to the exact model against stability around the approximate reference point. For idealized settings, we prove that the proximal correction tightens the match between approximate and exact posteriors, and thereby improves acceptance rates and mixing. The new method works with both linear and nonlinear input-output operators and is especially suitable for inverse problems where exact posterior sampling is too expensive. We perform several numerical experiments that include multimodal and data-driven priors and nonlinear input-output operators. The results show that Proximal-IMH reliably outperforms existing IMH variants.","language":"en","urldate":"2026-06-15","publisher":"arXiv","author":[{"propositions":[],"lastnames":["Chen"],"firstnames":["Youguang"],"suffixes":[]},{"propositions":[],"lastnames":["Biros"],"firstnames":["George"],"suffixes":[]}],"month":"May","year":"2026","note":"arXiv:2602.21426 [cs.LG]","keywords":"Computer Science - Machine Learning, Statistics - Computation, WG: Accelerated","bibtex":"@misc{chen_proximal-imh_2026,\n\ttitle = {Proximal-{IMH}: {Proximal} {Posterior} {Proposals} for {Independent} {Metropolis}-{Hastings} with {Approximate} {Operators}},\n\tshorttitle = {Proximal-{IMH}},\n\turl = {http://arxiv.org/abs/2602.21426},\n\tdoi = {10.48550/arXiv.2602.21426},\n\tabstract = {We are considering the problem of sampling from a posterior distribution related to Bayesian inverse problems arising in science, engineering, and imaging. Our method belongs to the family of independence Metropolis–Hastings (IMH) sampling algorithms. These are quite common in Bayesian inference. Relying on the existence of an approximate posterior distribution that is cheaper to sample from but can have significant bias, we introduce Proximal-IMH, a scheme that removes this bias: it corrects samples from the approximate posterior solving an auxiliary optimization problem, yielding a local adjustment that trades off adherence to the exact model against stability around the approximate reference point. For idealized settings, we prove that the proximal correction tightens the match between approximate and exact posteriors, and thereby improves acceptance rates and mixing. The new method works with both linear and nonlinear input-output operators and is especially suitable for inverse problems where exact posterior sampling is too expensive. We perform several numerical experiments that include multimodal and data-driven priors and nonlinear input-output operators. The results show that Proximal-IMH reliably outperforms existing IMH variants.},\n\tlanguage = {en},\n\turldate = {2026-06-15},\n\tpublisher = {arXiv},\n\tauthor = {Chen, Youguang and Biros, George},\n\tmonth = may,\n\tyear = {2026},\n\tnote = {arXiv:2602.21426 [cs.LG]},\n\tkeywords = {Computer Science - Machine Learning, Statistics - Computation, WG: Accelerated},\n}\n\n\n\n","author_short":["Chen, Y.","Biros, G."],"key":"chen_proximal-imh_2026","id":"chen_proximal-imh_2026","bibbaseid":"chen-biros-proximalimhproximalposteriorproposalsforindependentmetropolishastingswithapproximateoperators-2026","role":"author","urls":{"Paper":"http://arxiv.org/abs/2602.21426"},"keyword":["Computer Science - Machine Learning","Statistics - Computation","WG: Accelerated"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"misc","biburl":"https://bibbase.org/zotero-group/pratikmhatre/5933976","dataSources":["yJr5AAtJ5Sz3Q4WT4"],"keywords":["computer science - machine learning","statistics - computation","wg: accelerated"],"search_terms":["proximal","imh","proximal","posterior","proposals","independent","metropolis","hastings","approximate","operators","chen","biros"],"title":"Proximal-IMH: Proximal Posterior Proposals for Independent Metropolis-Hastings with Approximate Operators","year":2026}