Efficient Bayesian analysis of kilonovae and GRB afterglows with fiesta

Authors: Hauke Koehn, Thibeau Wouters, Peter T. H. Pang, Mattia Bulla, Henrik Rose, Hannah Wichern, Tim Dietrich

arXiv: 2507.13807v1 - DOI (astro-ph.HE)
18 pages, 15 figures, comments welcome
License: CC BY 4.0

Abstract: Gamma-ray burst (GRB) afterglows and kilonovae (KNe) are electromagnetic transients that can accompany binary neutron star (BNS) mergers. Therefore, studying their emission processes is of general interest for constraining cosmological parameters or the behavior of ultra-dense matter. One common method to analyze electromagnetic data from BNS mergers is to sample a Bayesian posterior over the parameters of a physical model for the transient. However, sampling the posterior is computationally costly, and because of the many likelihood evaluations needed in this process, detailed models are too expensive to be used directly in inference. In the present article, we address this problem by introducing fiesta, a python package to train machine learning (ML) surrogates for GRB afterglow and kilonova models that can accelerate likelihood evaluations. Specifically, we introduce extensive ML surrogates for the state-of-the-art GRB afterglow models afterglowpy and pyblastafterglow, as well as a new surrogate for the KN emission as modeled by the possis code. Our surrogates enable evaluation of the lightcurve posterior within minutes. We also provide built-in posterior sampling capabilities in fiesta that rely on the flowMC package which scale efficiently to higher dimensions when adding up to tens of nuisance sampling parameters. Because of its use of the JAX framework, fiesta also allows for GPU acceleration during both surrogate training and posterior sampling. We apply our framework to reanalyze AT2017gfo/GRB170817A and GRB211211A using our surrogates, thus employing the new pyblastafterglow model for the first time in Bayesian inference.

Submitted to arXiv on 18 Jul. 2025

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.