ELSA -- Enhanced latent spaces for improved collider simulations

• URL: http://arxiv.org/abs/2305.07696v2
• Date: Sat, 21 Oct 2023 12:04:48 GMT
• Title: ELSA -- Enhanced latent spaces for improved collider simulations
• Authors: Benjamin Nachman, Ramon Winterhalder
• Abstract summary: Simulations play a key role for inference in collider physics. We explore various approaches for enhancing the precision of simulations using machine learning. We find that modified simulations can achieve sub-percent precision across a wide range of phase space.
• Score: 0.1450405446885067
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Simulations play a key role for inference in collider physics. We explore various approaches for enhancing the precision of simulations using machine learning, including interventions at the end of the simulation chain (reweighting), at the beginning of the simulation chain (pre-processing), and connections between the end and beginning (latent space refinement). To clearly illustrate our approaches, we use W+jets matrix element surrogate simulations based on normalizing flows as a prototypical example. First, weights in the data space are derived using machine learning classifiers. Then, we pull back the data-space weights to the latent space to produce unweighted examples and employ the Latent Space Refinement (LASER) protocol using Hamiltonian Monte Carlo. An alternative approach is an augmented normalizing flow, which allows for different dimensions in the latent and target spaces. These methods are studied for various pre-processing strategies, including a new and general method for massive particles at hadron colliders that is a tweak on the widely-used RAMBO-on-diet mapping. We find that modified simulations can achieve sub-percent precision across a wide range of phase space.

Related papers

• CHARM: Creating Halos with Auto-Regressive Multi-stage networks [1.6987257996124416]
  CHARM is a novel method for creating mock halo catalogs. We show that the mock halo catalogs and painted galaxy catalogs have the same statistical properties as obtained from $N$-body simulations in both real space and redshift space.
  arXiv  Detail & Related papers  (2024-09-13T18:00:06Z)
• Spherinator and HiPSter: Representation Learning for Unbiased Knowledge Discovery from Simulations [0.0]
  We describe a new, unbiased, and machine learning based approach to obtain useful scientific insights from a broad range of simulations. Our concept is based on applying nonlinear dimensionality reduction to learn compact representations of the data in a low-dimensional space. We present a prototype using a rotational invariant hyperspherical variational convolutional autoencoder, utilizing a power distribution in the latent space, and trained on galaxies from IllustrisTNG simulation.
  arXiv  Detail & Related papers  (2024-06-06T07:34:58Z)
• A Multi-Grained Symmetric Differential Equation Model for Learning Protein-Ligand Binding Dynamics [73.35846234413611]
  In drug discovery, molecular dynamics (MD) simulation provides a powerful tool for predicting binding affinities, estimating transport properties, and exploring pocket sites. We propose NeuralMD, the first machine learning (ML) surrogate that can facilitate numerical MD and provide accurate simulations in protein-ligand binding dynamics. We demonstrate the efficiency and effectiveness of NeuralMD, achieving over 1K$times$ speedup compared to standard numerical MD simulations.
  arXiv  Detail & Related papers  (2024-01-26T09:35:17Z)
• Machine Learning methods for simulating particle response in the Zero Degree Calorimeter at the ALICE experiment, CERN [8.980453507536017]
  Currently, over half of the computing power at CERN GRID is used to run High Energy Physics simulations. The recent updates at the Large Hadron Collider (LHC) create the need for developing more efficient simulation methods. We propose an alternative approach to the problem that leverages machine learning.
  arXiv  Detail & Related papers  (2023-06-23T16:45:46Z)
• Towards Complex Dynamic Physics System Simulation with Graph Neural ODEs [75.7104463046767]
  This paper proposes a novel learning based simulation model that characterizes the varying spatial and temporal dependencies in particle systems. We empirically evaluate GNSTODE's simulation performance on two real-world particle systems, Gravity and Coulomb.
  arXiv  Detail & Related papers  (2023-05-21T03:51:03Z)
• Learning Controllable Adaptive Simulation for Multi-resolution Physics [86.8993558124143]
  We introduce Learning controllable Adaptive simulation for Multi-resolution Physics (LAMP) as the first full deep learning-based surrogate model. LAMP consists of a Graph Neural Network (GNN) for learning the forward evolution, and a GNN-based actor-critic for learning the policy of spatial refinement and coarsening. We demonstrate that our LAMP outperforms state-of-the-art deep learning surrogate models, and can adaptively trade-off computation to improve long-term prediction error.
  arXiv  Detail & Related papers  (2023-05-01T23:20:27Z)
• Fast emulation of cosmological density fields based on dimensionality reduction and supervised machine-learning [0.0]
  We show that it is possible to perform fast dark matter density field emulations with competitive accuracy using simple machine-learning approaches. New density cubes for different cosmological parameters can be estimated without relying directly on new N-body simulations.
  arXiv  Detail & Related papers  (2023-04-12T18:29:26Z)
• Quantum algorithm for collisionless Boltzmann simulation of self-gravitating systems [0.0]
  We propose an efficient quantum algorithm to solve the collisionless Boltzmann equation (CBE) We extend the algorithm to perform quantum simulations of self-gravitating systems, incorporating the method to calculate gravity. It will allow us to perform large-scale CBE simulations on future quantum computers.
  arXiv  Detail & Related papers  (2023-03-29T06:59:00Z)
• Sampling in Combinatorial Spaces with SurVAE Flow Augmented MCMC [83.48593305367523]
  Hybrid Monte Carlo is a powerful Markov Chain Monte Carlo method for sampling from complex continuous distributions. We introduce a new approach based on augmenting Monte Carlo methods with SurVAE Flows to sample from discrete distributions. We demonstrate the efficacy of our algorithm on a range of examples from statistics, computational physics and machine learning, and observe improvements compared to alternative algorithms.
  arXiv  Detail & Related papers  (2021-02-04T02:21:08Z)
• Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations [79.71184760864507]
  This article introduces a new physics-based method for rigid point set alignment called Fast Gravitational Approach (FGA) In FGA, the source and target point sets are interpreted as rigid particle swarms with masses interacting in a globally multiply-linked manner while moving in a simulated gravitational force field. We show that the new method class has characteristics not found in previous alignment methods.
  arXiv  Detail & Related papers  (2020-09-28T15:05:39Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.