End-to-end event reconstruction for precision physics at future colliders

• URL: http://arxiv.org/abs/2603.04084v1
• Date: Wed, 04 Mar 2026 13:55:04 GMT
• Title: End-to-end event reconstruction for precision physics at future colliders
• Authors: Dolores Garcia, Lena Herrmann, Gregor Krzmanc, Michele Selvaggi,
• Abstract summary: Future collider experiments require unprecedented precision in measurements of Higgs, electroweak, and observable flavours.<n>Current particle flow algorithms rely on detector specific clustering, limiting flexibility during detector design.<n>Here we present an end-to-end global event reconstruction approach that maps charged particle tracks and calorimeter and muon hits directly to particle level objects.
• Score: 0.39998518782208786
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Future collider experiments require unprecedented precision in measurements of Higgs, electroweak, and flavour observables, placing stringent demands on event reconstruction. The achievable precision on Higgs couplings scales directly with the resolution on visible final state particles and their invariant masses. Current particle flow algorithms rely on detector specific clustering, limiting flexibility during detector design. Here we present an end-to-end global event reconstruction approach that maps charged particle tracks and calorimeter and muon hits directly to particle level objects. The method combines geometric algebra transformer networks with object condensation based clustering, followed by dedicated networks for particle identification and energy regression. Our approach is benchmarked on fully simulated electron positron collisions at FCC-ee using the CLD detector concept. It outperforms the state-of-the-art rule-based algorithm by 10--20\% in relative reconstruction efficiency, achieves up to two orders of magnitude reduction in fake-particle rates for charged hadrons, and improves visible energy and invariant mass resolution by 22\%. By decoupling reconstruction performance from detector-specific tuning, this framework enables rapid iteration during the detector design phase of future collider experiments.

Related papers

• CryoSplat: Gaussian Splatting for Cryo-EM Homogeneous Reconstruction [48.45613121595709]
  cryogenic electron microscopy (cryo-EM) facilitates the determination of macromolecular structures at near-atomic resolution.<n>The core computational task in single-particle cryo-EM is to reconstruct the 3D electrostatic potential of a molecule from noisy 2D projections acquired at unknown orientations.<n>We propose cryoSplat, a GMM-based method that integrates Gaussian splatting with the physics of cryo-EM image formation.
  arXiv  Detail & Related papers  (2025-08-06T23:24:43Z)
• Fine-tuning machine-learned particle-flow reconstruction for new detector geometries in future colliders [1.988691274281547]
  We demonstrate transfer learning capabilities in a machine-learned algorithm trained for particle-flow reconstruction in high energy particle colliders.<n>To our knowledge, this is the first full-simulation cross-detector transfer learning study for particle-flow reconstruction.
  arXiv  Detail & Related papers  (2025-02-28T19:16:01Z)
• Conditioned quantum-assisted deep generative surrogate for particle-calorimeter interactions [6.753162356016995]
  We propose a conditioned quantum-assisted deep generative model for Large Hadron Collider simulations.<n>Our model integrates a conditioned variational autoencoder (VAE) on the exterior with a conditioned Restricted Boltzmann Machine (RBM) in the latent space.<n>The RBM nodes and connections are meticulously engineered to enable the use of qubits and couplers on D-Wave's Pegasus-structured textitAdvantage quantum annealer (QA) for sampling.
  arXiv  Detail & Related papers  (2024-10-30T10:08:03Z)
• 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)
• Improved particle-flow event reconstruction with scalable neural networks for current and future particle detectors [1.4609888393206634]
  We study scalable machine learning models for event reconstruction in electron-positron collisions based on a full detector simulation. We compare a graph neural network and kernel-based transformer and demonstrate that we can avoid operations while achieving realistic reconstruction. The best graph neural network model shows improvement in the jet transverse momentum resolution by up to 50% compared to the rule-based algorithm.
  arXiv  Detail & Related papers  (2023-09-13T08:16:15Z)
• Interpretable Joint Event-Particle Reconstruction for Neutrino Physics at NOvA with Sparse CNNs and Transformers [124.29621071934693]
  We present a novel neural network architecture that combines the spatial learning enabled by convolutions with the contextual learning enabled by attention. TransformerCVN simultaneously classifies each event and reconstructs every individual particle's identity. This architecture enables us to perform several interpretability studies which provide insights into the network's predictions.
  arXiv  Detail & Related papers  (2023-03-10T20:36:23Z)
• Transformer with Implicit Edges for Particle-based Physics Simulation [135.77656965678196]
  Transformer with Implicit Edges (TIE) captures the rich semantics of particle interactions in an edge-free manner. We evaluate our model on diverse domains of varying complexity and materials.
  arXiv  Detail & Related papers  (2022-07-22T03:45:29Z)
• Green, Quantized Federated Learning over Wireless Networks: An Energy-Efficient Design [68.86220939532373]
  The finite precision level is captured through the use of quantized neural networks (QNNs) that quantize weights and activations in fixed-precision format. The proposed FL framework can reduce energy consumption until convergence by up to 70% compared to a baseline FL algorithm.
  arXiv  Detail & Related papers  (2022-07-19T16:37:24Z)
• End-to-end multi-particle reconstruction in high occupancy imaging calorimeters with graph neural networks [18.347013421412793]
  We present an end-to-end reconstruction algorithm to build particle candidates from detector hits in granular calorimeters. The algorithm exploits a distance-weighted graph neural network, trained with object condensation, a graph segmentation technique. This work is the first-ever example of single-shot calorimetric reconstruction of $cal O(1000)$ particles in high-luminosity conditions with 200 pileup to our knowledge.
  arXiv  Detail & Related papers  (2022-04-04T17:51:43Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Quantum speedup for track reconstruction in particle accelerators [51.00143435208596]
  We identify four fundamental routines present in every local tracking method and analyse how they scale in the context of a standard tracking algorithm. Although the found quantum speedups are mild, this constitutes to the best of our knowledge, the first rigorous evidence of a quantum advantage for a high-energy physics data processing task.
  arXiv  Detail & Related papers  (2021-04-23T13:32:14Z)
• 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)

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.