TrackSorter: A Transformer-based sorting algorithm for track finding in High Energy Physics
Not on the map. Why?
Abstract (arXiv)
Track finding in particle data is a challenging pattern recognition problem in High Energy Physics. It takes as inputs a point cloud of space points and labels them so that space points created by the same particle have the same label. The list of space points with the same label is a track candidate. We argue that this pattern recognition problem can be formulated as a sorting problem, of which the inputs are a list of space points sorted by their distances away from the collision points and the outputs are the space points sorted by their labels. In this paper, we propose the TrackSorter algorithm: a Transformer-based algorithm for pattern recognition in particle data. TrackSorter uses a simple tokenization scheme to convert space points into discrete tokens. It then uses the tokenized space points as inputs and sorts the input tokens into track candidates. TrackSorter is a novel end-to-end track finding algorithm that leverages Transformer-based models to solve pattern recognition problems. It is evaluated on the TrackML dataset and has good track finding performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 14 references that are in the map. First posted on arXiv 31 Jul 2024.
Builds on
7 of 14 references.
References · 7
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2017Neural Discrete Representation Learningcited by 4,712
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2024Masked Particle Modeling on Sets: Towards Self-Supervised High Energy Physics Foundation Modelscited by 46
- 2024A Language Model for Particle Trackingcited by 10
Built on by
Not cited yet.