ترغب بنشر مسار تعليمي؟ اضغط هنا

Foundations of a Fast, Data-Driven, Machine-Learned Simulator

56   0   0.0 ( 0 )
 نشر من قبل Jessica Howard
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

We introduce a novel strategy for machine-learning-based fast simulators, which is the first that can be trained in an unsupervised manner using observed data samples to learn a predictive model of detector response and other difficult-to-model transformations. Across the physical sciences, a barrier to interpreting observed data is the lack of knowledge of a detectors imperfect resolution, which transforms and obscures the unobserved latent data. Modeling this detector response is an essential step for statistical inference, but closed-form models are often unavailable or intractable, requiring the use of computationally expensive, ad-hoc numerical simulations. Using particle physics detectors as an illustrative example, we describe a novel strategy for a fast, predictive simulator called Optimal Transport based Unfolding and Simulation (OTUS), which uses a probabilistic autoencoder to learn this transformation directly from observed data, rather than from existing simulations. Unusually, the probabilistic autoencoders latent space is physically meaningful, such that the decoder becomes a fast, predictive simulator for a new latent sample, and has the potential to replace Monte Carlo simulators. We provide proof-of-principle results for $Z$-boson and top-quark decays, but stress that our approach can be widely applied to other physical science fields.

قيم البحث

اقرأ أيضاً

Computing the trajectories of particles in generic beamlines is an important ingredient of experimental particle physics, in particular regarding near-beam detectors. A new tool, Hector, has been built for such calculations, using the transfer matrix approach and energy corrections. The limiting aperture effects are also taken into account. As an illustration, the tool was used to simulate the LHC beamlines, in particular around the high luminosity interaction points (IPs), and validated with results of the Mad-X simulator. The LHC beam profiles, trajectories and beta functions are presented. Assuming certain forward proton detector scenarios around the IP5, acceptance plots, irradiation doses and chromaticity grids are produced. Furthermore, the reconstruction of proton kinematic variables at the IP (energy and angle) is studied as well as the impact of the misalignment of beamline elements.
We introduce a new and highly efficient tagger for hadronically decaying top quarks, based on a deep neural network working with Lorentz vectors and the Minkowski metric. With its novel machine learning setup and architecture it allows us to identify boosted top quarks not only from calorimeter towers, but also including tracking information. We show how the performance of our tagger compares with QCD-inspired and image-recognition approaches and find that it significantly increases the performance for strongly boosted top quarks.
We report on a general and automatic data-driven background distribution shape estimation method using neural autoregressive flows (NAF), which is one of the deep generative learning methods. Data-driven background estimation is indispensable for man y analyses involving complicated final states where reliable predictions are not available. NAF allow us to construct general bijective transformations that operate on multidimensional space, out of finite number of invertible one-dimensional functions. Given its simplicity and universality, it is well suited to the application in the data-driven background estimation, since data-driven estimations can be expressed as transformations. In a data-driven background estimation, the goal is to derive appropriate transformations and apply extrapolated transformations to the region of interest. In the ABCDnn method, we can have the NAF learn the transformations dependence on control variables by having multiple control regions. We demonstrate that the prediction through ABCDnn method is similar to optimal case, while having smaller statistical uncertainty.
Kernel ridge regression is used to approximate the kinetic energy of non-interacting fermions in a one-dimensional box as a functional of their density. The properties of different kernels and methods of cross-validation are explored, and highly accu rate energies are achieved. Accurate {em constrained optimal densities} are found via a modified Euler-Lagrange constrained minimization of the total energy. A projected gradient descent algorithm is derived using local principal component analysis. Additionally, a sparse grid representation of the density can be used without degrading the performance of the methods. The implications for machine-learned density functional approximations are discussed.
67 - S. Ovyn , X. Rouby , V. Lemaitre 2009
This paper presents a new C++ framework, DELPHES, performing a fast multipurpose detector response simulation. The simulation includes a tracking system, embedded into a magnetic field, calorimeters and a muon system, and possible very forward detect ors arranged along the beamline. The framework is interfaced to standard file formats (e.g. Les Houches Event File or HepMC) and outputs observables such as isolated leptons, missing transverse energy and collection of jets which can be used for dedicated analyses. The simulation of the detector response takes into account the effect of magnetic field, the granularity of the calorimeters and subdetector resolutions. A simplified preselection can also be applied on processed events for trigger emulation. Detection of very forward scattered particles relies on the transport in beamlines with the HECTOR software. Finally, the FROG 2D/3D event display is used for visualisation of the collision final states.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا