Generative Adversarial Networks for LHCb Fast Simulation

• URL: http://arxiv.org/abs/2003.09762v1
• Date: Sat, 21 Mar 2020 22:46:15 GMT
• Title: Generative Adversarial Networks for LHCb Fast Simulation
• Authors: Fedor Ratnikov
• Abstract summary: LHCb generative models are being investigated in order to accelerate the generation of showers in the calorimeter and high-level responses of Cherenkov detector. We demonstrate this approach provides high-fidelity results along with a significant speed increase and discuss possible implication of these results.
• Score: 0.7106986689736827
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: LHCb is one of the major experiments operating at the Large Hadron Collider at CERN. The richness of the physics program and the increasing precision of the measurements in LHCb lead to the need of ever larger simulated samples. This need will increase further when the upgraded LHCb detector will start collecting data in the LHC Run 3. Given the computing resources pledged for the production of Monte Carlo simulated events in the next years, the use of fast simulation techniques will be mandatory to cope with the expected dataset size. In LHCb generative models, which are nowadays widely used for computer vision and image processing are being investigated in order to accelerate the generation of showers in the calorimeter and high-level responses of Cherenkov detector. We demonstrate that this approach provides high-fidelity results along with a significant speed increase and discuss possible implication of these results. We also present an implementation of this algorithm into LHCb simulation software and validation tests.

Related papers

• A conditional latent autoregressive recurrent model for generation and forecasting of beam dynamics in particle accelerators [46.348283638884425]
  We propose a two-step unsupervised deep learning framework named as Latent Autoregressive Recurrent Model (CLARM) for learning dynamics of charged particles in accelerators. The CLARM can generate projections at various accelerator sampling modules by capturing and decoding the latent space representation. The results demonstrate that the generative and forecasting ability of the proposed approach is promising when tested against a variety of evaluation metrics.
  arXiv  Detail & Related papers  (2024-03-19T22:05:17Z)
• The LHCb ultra-fast simulation option, Lamarr: design and validation [0.46369270610100627]
  Detailed detector simulation is the major consumer of CPU resources at LHCb. Lamarr is a Gaudi-based framework designed to offer the fastest solution for the simulation of the LHCb detector.
  arXiv  Detail & Related papers  (2023-09-22T23:21:27Z)
• Decreasing the Computing Time of Bayesian Optimization using Generalizable Memory Pruning [56.334116591082896]
  We show a wrapper of memory pruning and bounded optimization capable of being used with any surrogate model and acquisition function. Running BO on high-dimensional or massive data sets becomes intractable due to this time complexity. All model implementations are run on the MIT Supercloud state-of-the-art computing hardware.
  arXiv  Detail & Related papers  (2023-09-08T14:05:56Z)
• Lamarr: LHCb ultra-fast simulation based on machine learning models deployed within Gauss [0.0]
  We discuss Lamarr, a framework to speed-up the simulation production parameterizing both the detector response and the reconstruction algorithms of the LHCb experiment. Deep Generative Models powered by several algorithms and strategies are employed to effectively parameterize the high-level response of the single components of the LHCb detector.
  arXiv  Detail & Related papers  (2023-03-20T20:18:04Z)
• Continual learning autoencoder training for a particle-in-cell simulation via streaming [52.77024349608834]
  upcoming exascale era will provide a new generation of physics simulations with high resolution. These simulations will have a high resolution, which will impact the training of machine learning models since storing a high amount of simulation data on disk is nearly impossible. This work presents an approach that trains a neural network concurrently to a running simulation without data on a disk.
  arXiv  Detail & Related papers  (2022-11-09T09:55:14Z)
• Towards Reliable Neural Generative Modeling of Detectors [0.45671221781968335]
  We discuss the application of generative adversarial networks (GANs) to the simulation of the LHCb experiment events. Results are based on the Geant4 simulation of the LHCb Cherenkov detector.
  arXiv  Detail & Related papers  (2022-04-21T08:14:24Z)
• The Boundary for Quantum Advantage in Gaussian Boson Sampling [44.62475518267084]
  State-of-the-art quantum photonics experiments would require 600 million years to simulate using the best pre-existing classical algorithms. We present substantially faster classical GBS simulation methods, including speed and accuracy improvements. This reduces the run-time of simulating state-of-the-art GBS experiments to several months -- a nine orders of magnitude improvement over previous estimates.
  arXiv  Detail & Related papers  (2021-08-03T16:49:40Z)
• Deep Bayesian Active Learning for Accelerating Stochastic Simulation [74.58219903138301]
  Interactive Neural Process (INP) is a deep active learning framework for simulations and with active learning approaches. For active learning, we propose a novel acquisition function, Latent Information Gain (LIG), calculated in the latent space of NP based models. The results demonstrate STNP outperforms the baselines in the learning setting and LIG achieves the state-of-the-art for active learning.
  arXiv  Detail & Related papers  (2021-06-05T01:31:51Z)
• Providing Meaningful Data Summarizations Using Examplar-based Clustering in Industry 4.0 [67.80123919697971]
  We show, that our GPU implementation provides speedups of up to 72x using single-precision and up to 452x using half-precision compared to conventional CPU algorithms. We apply our algorithm to real-world data from injection molding manufacturing processes and discuss how found summaries help with steering this specific process to cut costs and reduce the manufacturing of bad parts.
  arXiv  Detail & Related papers  (2021-05-25T15:55:14Z)
• Graph Generative Models for Fast Detector Simulations in High Energy Physics [0.0]
  Simulating particle interactions with detectors is time consuming and computationally expensive. HL-LHC upgrade will put a significant strain on the computing infrastructure. We discuss a graph generative model that provides effective reconstruction of LHC events.
  arXiv  Detail & Related papers  (2021-04-05T00:27:43Z)
• Data Augmentation at the LHC through Analysis-specific Fast Simulation with Deep Learning [4.666011151359189]
  We present a fast simulation application based on a Deep Neural Network, designed to create large analysis-specific datasets. We propose a novel fast-simulation workflow that starts from a large amount of generator-level events to deliver large analysis-specific samples.
  arXiv  Detail & Related papers  (2020-10-05T07:48:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.