HackerPapers

arXiv:2310.14888cs.LG

Beyond Bayesian Model Averaging over Paths in Probabilistic Programs with Stochastic Support

Tim Reichelt, Luke Ong, Tom Rainforth

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

The posterior in probabilistic programs with stochastic support decomposes as a weighted sum of the local posterior distributions associated with each possible program path. We show that making predictions with this full posterior implicitly performs a Bayesian model averaging (BMA) over paths. This is potentially problematic, as BMA weights can be unstable due to model misspecification or inference approximations, leading to sub-optimal predictions in turn. To remedy this issue, we propose alternative mechanisms for path weighting: one based on stacking and one based on ideas from PAC-Bayes. We show how both can be implemented as a cheap post-processing step on top of existing inference engines. In our experiments, we find them to be more robust and lead to better predictions compared to the default BMA weights.

arXiv comments
Accepted at the 27th International Conference on Artificial Intelligence and Statistics (AISTATS) 2024
Journal reference
DOI
Subjects
cs.LGMachine Learning cs.PLProgramming Languages

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Feb 2025 to Feb 2025.

Comments linking this paper, per year.

Discussed in comments1 thread

    • And going beyond this: my layman's understanding of biology is that the way in which genes are expressed can be highly nonlinear and modulated by all sorts of different pathways. If you have some clarity on how these pathways work, probabilistic programming might be a helpful…

      btownView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.