Hierarchical Graph Neural Networks for Particle Track Reconstruction
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ZWARJWTUrecord.jsonopen to challenge →
read the original abstract
We introduce a novel variant of GNN for particle tracking called Hierarchical Graph Neural Network (HGNN). The architecture creates a set of higher-level representations which correspond to tracks and assigns spacepoints to these tracks, allowing disconnected spacepoints to be assigned to the same track, as well as multiple tracks to share the same spacepoint. We propose a novel learnable pooling algorithm called GMPool to generate these higher-level representations called "super-nodes", as well as a new loss function designed for tracking problems and HGNN specifically. On a standard tracking problem, we show that, compared with previous ML-based tracking algorithms, the HGNN has better tracking efficiency performance, better robustness against inefficient input graphs, and better convergence compared with traditional GNNs.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Physics-Informed Graph Neural Networks for Transverse Momentum Estimation in CMS Trigger Systems
Physics-informed GNNs with four detector-aware graph constructions and a custom message passing layer achieve MAE 0.8525 for pT estimation on CMS trigger data with over 55% fewer parameters than baselines.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.