Simulating the Time Projection Chamber responses at the MPD detector using Generative Adversarial Networks

• URL: http://arxiv.org/abs/2012.04595v1
• Date: Tue, 8 Dec 2020 17:57:37 GMT
• Title: Simulating the Time Projection Chamber responses at the MPD detector using Generative Adversarial Networks
• Authors: A. Maevskiy, F. Ratnikov, A. Zinchenko and V. Riabov
• Abstract summary: In this work, we demonstrate a novel approach to speed up the simulation of the Time Projection Chamber tracker of the MPD experiment at the NICA accelerator complex. Our method is based on a Generative Adrial Network - a deep learning technique allowing for implicit non-parametric estimation of the population distribution for a given set of objects. To evaluate the quality of the proposed model, we integrate it into the MPD software stack and demonstrate that it produces high-quality events similar to the detailed simulator.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High energy physics experiments rely heavily on the detailed detector simulation models in many tasks. Running these detailed models typically requires a notable amount of the computing time available to the experiments. In this work, we demonstrate a novel approach to speed up the simulation of the Time Projection Chamber tracker of the MPD experiment at the NICA accelerator complex. Our method is based on a Generative Adversarial Network - a deep learning technique allowing for implicit non-parametric estimation of the population distribution for a given set of objects. This approach lets us learn and then sample from the distribution of raw detector responses, conditioned on the parameters of the charged particle tracks. To evaluate the quality of the proposed model, we integrate it into the MPD software stack and demonstrate that it produces high-quality events similar to the detailed simulator, with a speed-up of at least an order of magnitude.

Related papers

• Diffusion posterior sampling for simulation-based inference in tall data settings [53.17563688225137]
  Simulation-based inference ( SBI) is capable of approximating the posterior distribution that relates input parameters to a given observation. In this work, we consider a tall data extension in which multiple observations are available to better infer the parameters of the model. We compare our method to recently proposed competing approaches on various numerical experiments and demonstrate its superiority in terms of numerical stability and computational cost.
  arXiv  Detail & Related papers  (2024-04-11T09:23:36Z)
• 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)
• Deep Generative Models for Ultra-High Granularity Particle Physics Detector Simulation: A Voyage From Emulation to Extrapolation [0.0]
  This thesis aims to overcome this challenge for the Pixel Vertex Detector (PXD) at the Belle II experiment. This study introduces, for the first time, the results of using deep generative models for ultra-high granularity detector simulation in Particle Physics.
  arXiv  Detail & Related papers  (2024-03-05T23:12:47Z)
• 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)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Generative Adversarial Networks for the fast simulation of the Time Projection Chamber responses at the MPD detector [0.0]
  We demonstrate the applicability of Generative Adversarial Networks (GAN) as the basis for such fast-simulation models. Our prototype GAN-based model of TPC works more than an order of magnitude faster compared to the detailed simulation.
  arXiv  Detail & Related papers  (2022-03-30T14:31:50Z)
• 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)
• Deep Transformer Networks for Time Series Classification: The NPP Safety Case [59.20947681019466]
  An advanced temporal neural network referred to as the Transformer is used within a supervised learning fashion to model the time-dependent NPP simulation data. The Transformer can learn the characteristics of the sequential data and yield promising performance with approximately 99% classification accuracy on the testing dataset.
  arXiv  Detail & Related papers  (2021-04-09T14:26:25Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• 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.