REVIEW 2 cited by
Hierarchical Graph Neural Networks for Particle Track Reconstruction
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 2 Pith papers
-
Transformer-Based Approach to Enhance Positron Tracking Performance in MEG II
A Transformer-based hit classifier improves MEG II positron tracking efficiency and resolution, yielding an expected ~10% gain in μ→eγ sensitivity.
-
Track reconstruction as a service for collider physics
Running the Patatrack and Exa.TrkX tracking algorithms through NVIDIA Triton as a remote service gives near-local GPU throughput while letting one GPU serve many more CPU clients.
Discussion (0). Continue with ORCID to comment.