Efficient Probabilistic Inference in the Quest for Physics Beyond the Standard Model
Not on the map. Why?
Abstract (arXiv)
We present a novel probabilistic programming framework that couples directly to existing large-scale simulators through a cross-platform probabilistic execution protocol, which allows general-purpose inference engines to record and control random number draws within simulators in a language-agnostic way. The execution of existing simulators as probabilistic programs enables highly interpretable posterior inference in the structured model defined by the simulator code base. We demonstrate the technique in particle physics, on a scientifically accurate simulation of the tau lepton decay, which is a key ingredient in establishing the properties of the Higgs boson. Inference efficiency is achieved via inference compilation where a deep recurrent neural network is trained to parameterize proposal distributions and control the stochastic simulator in a sequential importance sampling scheme, at a fraction of the computational cost of a Markov chain Monte Carlo baseline.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jul 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 1.
4 papers.
- 2021Variational Inference for Deblending Crowded Starfieldscited by 5
- 2022Uncertain Evidence in Probabilistic Models and Stochastic Simulatorscited by 5
- 2024Flow Matching for Posterior Inference with Simulator Feedbackcited by 2
- 2021Meta-Learning an Inference Algorithm for Probabilistic Programscited by 1
- 2024Flow Matching for Posterior Inference with Simulator Feedback29 Oct 2024
- 2022Uncertain Evidence in Probabilistic Models and Stochastic Simulators21 Oct 2022
- 2021Meta-Learning an Inference Algorithm for Probabilistic Programs1 Mar 2021
- 2021Variational Inference for Deblending Crowded Starfields4 Feb 2021