Jonas El Gammal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jonas El Gammal has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Jesús Torrado
Dipartimento di Fisica e Astronomia "G. Galilei" Università degli Studi di Padova via Marzolo 8 I-35131 Padova Italy
2 shared publications Nils Schöneberg
Institut de Ciències del Cosmos Universitat de Barcelona Martí i Franquès 1 E08028 Barcelona Spain
2 shared publications- Andreas Nygaard
Department of Astrophysics University of Zurich CH-8057 Zurich Switzerland
1 shared publication - Christian Fidler
Institute for Theoretical Particle Physics and Cosmology (TTK), RWTH Aachen University, D-52056 Aachen
1 shared publication - Emil Brinch Holm
Department of Physics and Astronomy, Aarhus University , DK-8000 Aarhus C
1 shared publication - Sven Günther
Institute for Theoretical Particle Physics and Cosmology (TTK) RWTH Aachen University Sommerfeldstr. 16 D-52056 Aachen Germany
1 shared publication
Latest Publications
- Open AccessCircular reasoning: Solving the Hubble tension with a non-$π$ value of $π$Recently, cosmology has seen a surge in alternative models that purport to solve the discrepancy between the values of the Hubble constant $H_0$ as measured by cosmological microwave background anisotropies and local supernovae, respectively. In particular, many of the most successful approaches have involved varying fundamental constants, such as an alternative value of the fine structure constant and time-varying values of the electron mass, the latter of which showed particular promise as the strongest candidate in several earlier studies. Inspired by these approaches, in this paper, we investigate a cosmological model where the value of the geometric constant $π$ is taken to be a free model parameter. Using the latest CMB data from Planck as well as baryon-acoustic oscillation data, we constrain the parameters of the model and find a strong correlation between $π$ and $H_0$, with the final constraint $H_0 = 71.3 \pm 1.1 \ \mathrm{ km/s/Mpc}$, equivalent to a mere $1.5σ$ discrepancy with the value measured by the SH0ES collaboration. Furthermore, our results show that $π= 3.206 \pm 0.038$ at $95 \%$ C.L., which is in good agreement with several external measurements discussed in the paper. Hence, we conclude that the $πΛ$CDM model presented in this paper, which has only a single extra parameter, currently stands as the perhaps strongest solution to the Hubble tension.Open AccessCircular reasoning: Solving the Hubble tension with a non-$π$ value of $π$Recently, cosmology has seen a surge in alternative models that purport to solve the discrepancy between the values of the Hubble constant $H_0$ as measured by cosmological microwave background anisotropies and local supernovae, respectively. In particular, many of the most successful approaches have involved varying fundamental constants, such as an alternative value of the fine structure constant and time-varying values of the electron mass, the latter of which showed particular promise as the strongest candidate in several earlier studies. Inspired by these approaches, in this paper, we investigate a cosmological model where the value of the geometric constant $π$ is taken to be a free model parameter. Using the latest CMB data from Planck as well as baryon-acoustic oscillation data, we constrain the parameters of the model and find a strong correlation between $π$ and $H_0$, with the final constraint $H_0 = 71.3 \pm 1.1 \ \mathrm{ km/s/Mpc}$, equivalent to a mere $1.5σ$ discrepancy with the value measured by the SH0ES collaboration. Furthermore, our results show that $π= 3.206 \pm 0.038$ at $95 \%$ C.L., which is in good agreement with several external measurements discussed in the paper. Hence, we conclude that the $πΛ$CDM model presented in this paper, which has only a single extra parameter, currently stands as the perhaps strongest solution to the Hubble tension.
- Open Access
Parallelized Acquisition for Active Learning using Monte Carlo Sampling
Bayesian inference remains one of the most important tool-kits for any scientist, but increasingly expensive likelihood functions are required for ever-more complex experiments, raising the cost of generating a Monte Carlo sample of the posterior. Recent attention has been directed towards the use of emulators of the posterior based on Gaussian Process (GP) regression combined with active sampling to achieve comparable precision with far fewer costly likelihood evaluations. Key to this approach is the batched acquisition of proposals, so that the true posterior can be evaluated in parallel. This is usually achieved via sequential maximization of the highly multimodal acquisition function. Unfortunately, this approach parallelizes poorly and is prone to getting stuck in local maxima. Our approach addresses this issue by generating nearly-optimal batches of candidates using an almost-embarrassingly parallel Nested Sampler on the mean prediction of the GP. The resulting nearly-sorted Monte Carlo sample is used to generate a batch of candidates ranked according to their sequentially conditioned acquisition function values at little cost. The final sample can also be used for inferring marginal quantities. Our proposed implementation (NORA) demonstrates comparable accuracy to sequential conditioned acquisition optimization and efficient parallelization in various synthetic and cosmological inference problems.
Open AccessParallelized Acquisition for Active Learning using Monte Carlo Sampling
Bayesian inference remains one of the most important tool-kits for any scientist, but increasingly expensive likelihood functions are required for ever-more complex experiments, raising the cost of generating a Monte Carlo sample of the posterior. Recent attention has been directed towards the use of emulators of the posterior based on Gaussian Process (GP) regression combined with active sampling to achieve comparable precision with far fewer costly likelihood evaluations. Key to this approach is the batched acquisition of proposals, so that the true posterior can be evaluated in parallel. This is usually achieved via sequential maximization of the highly multimodal acquisition function. Unfortunately, this approach parallelizes poorly and is prone to getting stuck in local maxima. Our approach addresses this issue by generating nearly-optimal batches of candidates using an almost-embarrassingly parallel Nested Sampler on the mean prediction of the GP. The resulting nearly-sorted Monte Carlo sample is used to generate a batch of candidates ranked according to their sequentially conditioned acquisition function values at little cost. The final sample can also be used for inferring marginal quantities. Our proposed implementation (NORA) demonstrates comparable accuracy to sequential conditioned acquisition optimization and efficient parallelization in various synthetic and cosmological inference problems.
- Open Access
Fast and robust Bayesian Inference using Gaussian Processes with GPry
We present the GPry algorithm for fast Bayesian inference of general (non-Gaussian) posteriors with a moderate number of parameters. GPry does not need any pre-training, special hardware such as GPUs, and is intended as a drop-in replacement for traditional Monte Carlo methods for Bayesian inference. Our algorithm is based on generating a Gaussian Process surrogate model of the log-posterior, aided by a Support Vector Machine classifier that excludes extreme or non-finite values. An active learning scheme allows us to reduce the number of required posterior evaluations by two orders of magnitude compared to traditional Monte Carlo inference. Our algorithm allows for parallel evaluations of the posterior at optimal locations, further reducing wall-clock times. We significantly improve performance using properties of the posterior in our active learning scheme and for the definition of the GP prior. In particular we account for the expected dynamical range of the posterior in different dimensionalities. We test our model against a number of synthetic and cosmological examples. GPry outperforms traditional Monte Carlo methods when the evaluation time of the likelihood (or the calculation of theoretical observables) is of the order of seconds; for evaluation times of over a minute it can perform inference in days that would take months using traditional methods. GPry is distributed as an open source Python package (pip install gpry) and can also be found at https://github.com/jonaselgammal/GPry.
Open AccessFast and robust Bayesian Inference using Gaussian Processes with GPry
We present the GPry algorithm for fast Bayesian inference of general (non-Gaussian) posteriors with a moderate number of parameters. GPry does not need any pre-training, special hardware such as GPUs, and is intended as a drop-in replacement for traditional Monte Carlo methods for Bayesian inference. Our algorithm is based on generating a Gaussian Process surrogate model of the log-posterior, aided by a Support Vector Machine classifier that excludes extreme or non-finite values. An active learning scheme allows us to reduce the number of required posterior evaluations by two orders of magnitude compared to traditional Monte Carlo inference. Our algorithm allows for parallel evaluations of the posterior at optimal locations, further reducing wall-clock times. We significantly improve performance using properties of the posterior in our active learning scheme and for the definition of the GP prior. In particular we account for the expected dynamical range of the posterior in different dimensionalities. We test our model against a number of synthetic and cosmological examples. GPry outperforms traditional Monte Carlo methods when the evaluation time of the likelihood (or the calculation of theoretical observables) is of the order of seconds; for evaluation times of over a minute it can perform inference in days that would take months using traditional methods. GPry is distributed as an open source Python package (pip install gpry) and can also be found at https://github.com/jonaselgammal/GPry.