Towards formal verification of Bayesian inference in probabilistic programming via guaranteed bounds
<p>Probabilistic models are an indispensable tool in many scientific fields, from the social and medical sciences to physics and machine learning. In probabilistic programming, such models are specified as computer programs: a flexible yet precise representation that allows for automated analy...
| מחבר ראשי: | |
|---|---|
| מחברים אחרים: | |
| פורמט: | Thesis |
| שפה: | English |
| יצא לאור: |
2024
|
| נושאים: |