parton
What Octogenarian Pop Divas Show Us About a Life Well-Lived
Follow this section to personalize your feed and get instant alerts. Follow Go to your personalized feed WHY FOLLOW? Smart Alerts: Get notified about major news as it happens. Follow this tag to personalize your feed and get instant alerts. Follow Go to your personalized feed WHY FOLLOW? Smart Alerts: Get notified about major news as it happens.
PIPPIN: Generating variable length full events from partons
Quรฉtant, Guillaume, Raine, John Andrew, Leigh, Matthew, Sengupta, Debajyoti, Golling, Tobias
This occurs before In the realm of high-energy physics, the simulation of they hit the detector material and greatly increases the particle collisions is a crucial tool for the downstream number of particles produced by the collision. Following analysis of the huge amount of data produced by collider this, all stable particles are propagated through the experiments. The classical generation of these simulated detector material, where they can interact with it and events is a complex task. By far the most computationally produce secondary particles. This showering process is taxing subtask is the propagation of particles through typically the most computationally expensive part of the the detectors, accounting for the interactions with the simulation. Finally, the deposited energy in the detector detector material and modelling the secondary radiation is digitised and reconstructed into objects such as jets, showers this produces. This process is usually performed leptons and missing transverse energy (MET).
Re-Simulation-based Self-Supervised Learning for Pre-Training Foundation Models
Harris, Philip, Kagan, Michael, Krupa, Jeffrey, Maier, Benedikt, Woodward, Nathaniel
Self-Supervised Learning (SSL) is at the core of training modern large machine learning models, providing a scheme for learning powerful representations that can be used in a variety of downstream tasks. However, SSL strategies must be adapted to the type of training data and downstream tasks required. We propose RS3L, a novel simulation-based SSL strategy that employs a method of re-simulation to drive data augmentation for contrastive learning. By intervening in the middle of the simulation process and re-running simulation components downstream of the intervention, we generate multiple realizations of an event, thus producing a set of augmentations covering all physics-driven variations available in the simulator. Using experiments from high-energy physics, we explore how this strategy may enable the development of a foundation model; we show how R3SL pre-training enables powerful performance in downstream tasks such as discrimination of a variety of objects and uncertainty mitigation. In addition to our results, we make the RS3L dataset publicly available for further studies on how to improve SSL strategies.
Topological Reconstruction of Particle Physics Processes using Graph Neural Networks
Ehrke, Lukas, Raine, John Andrew, Zoch, Knut, Guth, Manuel, Golling, Tobias
We present a new approach, the Topograph, which reconstructs underlying physics processes, including the intermediary particles, by leveraging underlying priors from the nature of particle physics decays and the flexibility of message passing graph neural networks. The Topograph not only solves the combinatoric assignment of observed final state objects, associating them to their original mother particles, but directly predicts the properties of intermediate particles in hard scatter processes and their subsequent decays. In comparison to standard combinatoric approaches or modern approaches using graph neural networks, which scale exponentially or quadratically, the complexity of Topographs scales linearly with the number of reconstructed objects. We apply Topographs to top quark pair production in the all hadronic decay channel, where we outperform the standard approach and match the performance of the state-of-the-art machine learning technique.
End-To-End Latent Variational Diffusion Models for Inverse Problems in High Energy Physics
Shmakov, Alexander, Greif, Kevin, Fenton, Michael, Ghosh, Aishik, Baldi, Pierre, Whiteson, Daniel
High-energy collisions at the Large Hadron Collider (LHC) provide valuable insights into open questions in particle physics. However, detector effects must be corrected before measurements can be compared to certain theoretical predictions or measurements from other detectors. Methods to solve this \textit{inverse problem} of mapping detector observations to theoretical quantities of the underlying collision are essential parts of many physics analyses at the LHC. We investigate and compare various generative deep learning methods to approximate this inverse mapping. We introduce a novel unified architecture, termed latent variation diffusion models, which combines the latent learning of cutting-edge generative art approaches with an end-to-end variational framework. We demonstrate the effectiveness of this approach for reconstructing global distributions of theoretical kinematic quantities, as well as for ensuring the adherence of the learned posterior distributions to known physics constraints. Our unified approach achieves a distribution-free distance to the truth of over 20 times less than non-latent state-of-the-art baseline and 3 times less than traditional latent diffusion models.
SPANet: Generalized Permutationless Set Assignment for Particle Physics using Symmetry Preserving Attention
Shmakov, Alexander, Fenton, Michael James, Ho, Ta-Wei, Hsu, Shih-Chieh, Whiteson, Daniel, Baldi, Pierre
The creation of unstable heavy particles at the Large Hadron Collider is the most direct way to address some of the deepest open questions in physics. Collisions typically produce variable-size sets of observed particles which have inherent ambiguities complicating the assignment of observed particles to the decay products of the heavy particles. Current strategies for tackling these challenges in the physics community ignore the physical symmetries of the decay products and consider all possible assignment permutations and do not scale to complex configurations. Attention based deep learning methods for sequence modelling have achieved state-of-the-art performance in natural language processing, but they lack built-in mechanisms to deal with the unique symmetries found in physical set-assignment problems. We introduce a novel method for constructing symmetry-preserving attention networks which reflect the problem's natural invariances to efficiently find assignments without evaluating all permutations. This general approach is applicable to arbitrarily complex configurations and significantly outperforms current methods, improving reconstruction efficiency between 19\% - 35\% on typical benchmark problems while decreasing inference time by two to five orders of magnitude on the most complex events, making many important and previously intractable cases tractable. A full code repository containing a general library, the specific configuration used, and a complete dataset release, are avaiable at https://github.com/Alexanders101/SPANet