TL;DR
This paper presents MLPF, a novel graph neural network-based particle-flow reconstruction algorithm that enhances physics performance and computational scalability in high-pileup conditions expected at the high-luminosity LHC.
Contribution
Introduction of MLPF, an end-to-end trainable, scalable graph neural network algorithm for particle-flow reconstruction optimized for high-luminosity collider environments.
Findings
Improves physics response over rule-based algorithms.
Demonstrates computational scalability in high-pileup scenarios.
Effective on simulated top quark-antiquark events.
Abstract
In general-purpose particle detectors, the particle-flow algorithm may be used to reconstruct a comprehensive particle-level view of the event by combining information from the calorimeters and the trackers, significantly improving the detector resolution for jets and the missing transverse momentum. In view of the planned high-luminosity upgrade of the CERN Large Hadron Collider (LHC), it is necessary to revisit existing reconstruction algorithms and ensure that both the physics and computational performance are sufficient in an environment with many simultaneous proton-proton interactions (pileup). Machine learning may offer a prospect for computationally efficient event reconstruction that is well-suited to heterogeneous computing platforms, while significantly improving the reconstruction quality over rule-based algorithms for granular detectors. We introduce MLPF, a novel,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
