mlsanityData to 7 Oct 2026

Hierarchical Graph Neural Networks for Particle Track Reconstruction

arXiv 2303.01640 ↗First posted 3 Mar 2023hep-ex cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 6 of its 21 references that are in the map. First posted on arXiv 3 Mar 2023.

Builds on

6 of 21 references.

References · 6

  1. 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
  2. 2019Graph U-Netscited by 489
  3. 2019Self-Attention Graph Poolingcited by 421
  4. 2019Learning representations of irregular particle-detector geometry with distance-weighted graph networkscited by 43
  5. 2021Performance of a Geometric Deep Learning Pipeline for HL-LHC Particle Trackingcited by 29
  6. 2021Hierarchical graph neural nets can capture long-range interactionscited by 12

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 3; 2026: 1.

7 papers.