Metraipolis › archive › dc_c3ead31b2b2d
Exact Likelihood-Coin Poisson Sampling for Bayesian Inverse Problems with Sharp Complexity Bounds — arXiv:2609.14225
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14225
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:11:46.979Z
- SHA-256 of the archived text
28d11cd93ff05b99650c223be48abe9f1ffa84af4a2fef4567bf0858488199ca- Stable URL of this page
https://metraipolis.com/documento/dc_c3ead31b2b2d
How to cite
Exact Likelihood-Coin Poisson Sampling for Bayesian Inverse Problems with Sharp Complexity Bounds — arXiv:2609.14225 — arXiv (en), https://arxiv.org/abs/2609.14225 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c3ead31b2b2d (Metraipolis archive dc_c3ead31b2b2d, sha256 28d11cd93ff05b99650c223be48abe9f1ffa84af4a2fef4567bf0858488199ca)
BibTeX
@misc{dcc3ead31b2b2d,
title = {Exact Likelihood-Coin Poisson Sampling for Bayesian Inverse Problems with Sharp Complexity Bounds — arXiv:2609.14225},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14225},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c3ead31b2b2d; sha256 28d11cd93ff05b99650c223be48abe9f1ffa84af4a2fef4567bf0858488199ca},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14225. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We develop an exact posterior-sampling framework for Bayesian inverse problems when selected bounded forward observables can be accessed through Bernoulli events. A Bernstein--Poisson construction converts these forward coins into scaled Gaussian likelihood coins, and thinning an inflated prior Poisson point process yields posterior atoms that are iid conditional on their number. For independent Gaussian observations, we derive an exact mean-work identity for the implemented early-stopped factory and sharp small-noise complexity laws governed by local prior-predictive mass near the exact-fit set; a factorial-moment construction extends the likelihood factory to correlated Gaussian errors. The posterior algorithm is model-agnostic once Bernoulli access is available. As one continuum realization, we use Feynman--Kac sampling, Poisson killing, and lazy random-series evaluation for a bounded elliptic resolvent problem with a function-valued coefficient. Numerical experiments validate the forward and likelihood coins, support the predicted work regimes, and demonstrate posterior sampling without deterministic spatial discretization or fixed parameter truncation in the target. A matched-accuracy benchmark against finite-difference prior rejection illustrates how deterministic discretization bias changes the posterior accuracy--cost balance. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.ST). Categorie arXiv: Statistics Theory (math.ST) ; Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.14225 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T00:31:08.649Z dalla pagina https://arxiv.org/catchup/math.ST/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).