mlsanityData to 14 Oct 2026

Fast and Precise Learned Charged-Particle Trajectory Regression at the Large Hadron Collider

arXiv 2609.32479 ↗First posted 26 Sep 2026cs.LG hep-ex hep-phcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose a training recipe that treats charged-particle trajectory parameter regression on high-energy physics detector data as a sequence-modeling task. Kalman filters and linearized least-squares fits have been the classical standard approach for this task: they are optimal estimators for sparsely sampled linear-Gaussian data and are commonly used for trajectory parameter regression (fitting). The classical fitting techniques implemented for this domain reach a final precision of one part in 105 through detailed modeling of detector geometry, material, detection effects and precise numerical integration of the equations of motion through the detector's inhomogeneous magnetic field. With this study, we demonstrate that using a bidirectional gated linear recurrent encoder, one is able to reproduce the full precision of classical track fitting techniques. Using a custom kernel, we also achieve significantly higher throughput during GPU inference, compared to classical fitting software running on similarly priced multi-core CPU servers representing typically employed hardware. Such a speedup would lead to considerable cost savings for the pattern recognition at the Large Hadron Collider. To our knowledge, this is the first end-to-end learned track fit to reach the full precision and, at the same time, offer the opportunity to reduce the computing costs.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 35 references that are in the map. First posted on arXiv 26 Sep 2026.

Builds on

11 of 35 references.

References · 11

  1. 2017Attention Is All You Needcited by 60,361
  2. 2019Root Mean Square Layer Normalizationcited by 1,480
  3. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
  4. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
  5. 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 723
  6. 2021E(3)-Equivariant Graph Neural Networks for Data-Efficient and Accurate Interatomic Potentialscited by 708
  7. 2023Symbolic Discovery of Optimization Algorithmscited by 434
  8. 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 135
  9. 2020On the Generalization Benefit of Noise in Stochastic Gradient Descentcited by 82
  10. 2024Were RNNs All We Needed?cited by 38
  11. 2025ColliderML: The First Release of an OpenDataDetector High-Luminosity Physics Benchmark Datasetcited by 3

Built on by

Not cited yet.