Abstract: Simulating nature and in particular processes in particle physics require expensive computations and sometimes would take much longer than scientists can afford. Here, we explore ways to a solution for this problem by investigating recent advances in generative modeling and present a study for the generation of events from a physical process with deep generative models. The simulation of physical processes requires not only the production of physical events, but to also ensure that these events occur with the correct frequencies. We investigate the feasibility of learning the event generation and the frequency of occurrence with several generative machine learning models to produce events like Monte Carlo generators. We study three processes: a simple two-body decay, the processes e(+)e(-)-> Z -> l(+)l(-) and pp -> tt<mml:mo><overbar></mml:mover> including the decay of the top quarks and a simulation of the detector response. By buffering density information of encoded Monte Carlo events given the encoder of a Variational Autoencoder we are able to construct a prior for the sampling of new events from the decoder that yields distributions that are in very good agreement with real Monte Carlo events and are generated several orders of magnitude faster. Applications of this work include generic density estimation and sampling, targeted event generation via a principal component analysis of encoded ground truth data, anomaly detection and more efficient importance sampling, e.g., for the phase space integration of matrix elements in quantum field theories. Here, the authors report buffered-density variational autoencoders for the generation of physical events. This method is computationally less expensive over other traditional methods and beyond accelerating the data generation process, it can help to steer the generation and to detect anomalies.

Abstract: We assess the coverage properties of confidence and credible intervals on the CMSSM parameter space inferred from a Bayesian posterior and the profile likelihood based on an ATLAS sensitivity study. In order to make those calculations feasible, we introduce a new method based on neural networks to approximate the mapping between CMSSM parameters and weak-scale particle masses. Our method reduces the computational effort needed to sample the CMSSM parameter space by a factor of similar to 10(4) with respect to conventional techniques. We find that both the Bayesian posterior and the profile likelihood intervals can significantly over-cover and identify the origin of this effect to physical boundaries in the parameter space. Finally, we point out that the effects intrinsic to the statistical procedure are conflated with simplifications to the likelihood functions from the experiments themselves.

Abstract: Statistical inference of the fundamental parameters of supersymmetric theories is a challenging and active endeavor. Several sophisticated algorithms have been employed to this end. While Markov-Chain Monte Carlo (MCMC) and nested sampling techniques are geared towards Bayesian inference, they have also been used to estimate frequentist confidence intervals based on the profile likelihood ratio. We investigate the performance and appropriate configuration of MULTINEST, a nested sampling based algorithm, when used for profile likelihood-based analyses both on toy models and on the parameter space of the Constrained MSSM. We find that while the standard configuration previously used in the literarture is appropriate for an accurate reconstruction of the Bayesian posterior, the profile likelihood is poorly approximated. We identify a more appropriate MULTINEST configuration for profile likelihood analyses, which gives an excellent exploration of the profile likelihood (albeit at a larger computational cost), including the identification of the global maximum likelihood value. We conclude that with the appropriate configuration MULTINEST is a suitable tool for profile likelihood studies, indicating previous claims to the contrary are not well founded.