Scalable multi-task learning for particle collision event reconstruction with heterogeneous graph neural networks

Abstract The growing luminosity frontier at the Large Hadron Collider is challenging the reconstruction and analysis of particle collision events. Increased particle multiplicities are straining latency and storage requirements at the data acquisition stage, while new complications are emerging, including higher background levels and more frequent particle vertex misassociations. This in turn necessitates the development of more holistic and scalable reconstruction methods that take advantage of recent advances in machine learning. We propose a novel heterogeneous graph neural network (HGNN) architecture featuring unique representations for diverse particle collision relationships and integrated graph pruning layers for scalability. Trained with a multi-task paradigm in an environment mimicking the LHCb experiment, this HGNN significantly improves the beauty hadron reconstruction performance. Notably, it concurrently performs particle vertex association and graph pruning within a single framework. We quantify the reconstruction and pruning performance, demonstrate enhanced inference time scaling with event complexity, and mitigate potential performance loss using a weighted message passing scheme.

Authors

Institutions

Publication Details

Journal
Machine Learning Science and Technology
Published
2025-11-21
DOI
https://doi.org/10.1088/2632-2153/ae22be
Citations
2
Primary Topic
High-Energy Particle Collisions Research
Type
article
Field-Weighted Citation Impact
3.74
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Scalable multi-task learning for particle collision event reconstruction with heterogeneous graph neural networks

M. Calvi, S. Capelli, J. García Pardiñas, W. Sutcliffe et al.
2 citations
Machine Learning Science and Technology
High-Energy Particle Collisions Research
3.74
article

Scalable multi-task learning for particle collision event reconstruction with heterogeneous graph neural networks

M. Calvi, S. Capelli, J. García Pardiñas, W. Sutcliffe, Jonas Nathanael Eschle, N. Serra, Abhijit Mathad, Azusa Uzuki
article en
2 citations

Abstract

Abstract The growing luminosity frontier at the Large Hadron Collider is challenging the reconstruction and analysis of particle collision events. Increased particle multiplicities are straining latency and storage requirements at the data acquisition stage, while new complications are emerging, including higher background levels and more frequent particle vertex misassociations. This in turn necessitates the development of more holistic and scalable reconstruction methods that take advantage of recent advances in machine learning. We propose a novel heterogeneous graph neural network (HGNN) architecture featuring unique representations for diverse particle collision relationships and integrated graph pruning layers for scalability. Trained with a multi-task paradigm in an environment mimicking the LHCb experiment, this HGNN significantly improves the beauty hadron reconstruction performance. Notably, it concurrently performs particle vertex association and graph pruning within a single framework. We quantify the reconstruction and pruning performance, demonstrate enhanced inference time scaling with event complexity, and mitigate potential performance loss using a weighted message passing scheme.

Machine Learning Science and TechnologyVol. 6(4)
University of Zurich (CH), Istituto Nazionale di Fisica Nucleare, Sezione di Milano Bicocca (IT), Massachusetts Institute of Technology (US), University of Milano-Bicocca (IT), European Organization for Nuclear Research (CH)
Openalex Percentile: Top 6%
High-Energy Particle Collisions Research
3.74
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.