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 $10^5$ 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.
Monte Carlo simulations are used extensively in high-energy particle physics analyses. However, an incomplete description of the underlying physics can lead to significant discrepancies between observables measured in simulated and collision data. To mitigate potential biases arising from such mismodelling, it is essen...
Detailed Geant4 simulation of calorimeter showers is the largest single computing cost of collider experiments, and the High-Luminosity LHC will need about ten times more simulated events than are currently produced. We summarise recent progress in generative point cloud fast simulation for highly granular calorimeters...
Thorsten Buss, H. Day-hall, F. Gaede et al.· 0 citations
Charged particle track reconstruction at the High-Luminosity Large Hadron Collider is challenged by dense hit environments and combinatorial ambiguities. Existing graph-based and Transformer approaches commonly rely on static geometric neighbourhoods, which cannot adapt as track-level representations evolve. We propose...
Chen-Xiu Ou, Yan Wang, Ming-Jiang Liang et al.· 0 citations
The proposed empirical Bayes framework offers a general solution for training heteroscedastic neural models in situations where manual hyperparameter tuning is impractical, and it is anticipated that this framework can be applied to other domains that encounter comparable computational limitations.
Yousra El-Bachir, F. F. Van der Veken, D. Di Croce et al.· 0 citations
Nii-MALA is introduced, a high-performance C implementation of the Metropolis-Adjusted Langevin Algorithm, which leverages Message Passing Interface for parallelization and incorporates automatic differentiation backends for gradient evaluation and benchmark it against several other codes using radial velocity data fro...
Jia-Men Jiao, Sheng Jin, Wen-Xin Jiang et al.· Publications of the Astronom...· 0 citations
This work represents every object in a jet in a single shared token vocabulary and train one model to map any subset of these modalities to any other, with the autoregressive model particularly faithful to output from Geant4.
Nilotpal Kakati, D. Murnane, B. Hashemi et al.· 3 citations
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.