Edge Machine Learning for Cluster Counting in Next-Generation Drift Chambers
- URL: http://arxiv.org/abs/2511.10540v2
- Date: Sun, 16 Nov 2025 17:00:27 GMT
- Title: Edge Machine Learning for Cluster Counting in Next-Generation Drift Chambers
- Authors: Deniz Yilmaz, Liangyu Wu, Julia Gonski, Dylan Rankin, Christian Herwig,
- Abstract summary: Machine learning at the "edge", or in cell-level readout, can dramatically reduce the off-detector data rate for high-granularity drift chambers.<n>We present machine learning algorithms for cluster counting in real-time readout of future drift chambers.
- Score: 0.028193358315036943
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Drift chambers have long been central to collider tracking, but future machines like a Higgs factory motivate higher granularity and cluster counting for particle ID, posing new data processing challenges. Machine learning (ML) at the "edge", or in cell-level readout, can dramatically reduce the off-detector data rate for high-granularity drift chambers by performing cluster counting at-source. We present machine learning algorithms for cluster counting in real-time readout of future drift chambers. These algorithms outperform traditional derivative-based techniques based on achievable pion-kaon separation. When synthesized to FPGA resources, they can achieve latencies consistent with real-time operation in a future Higgs factory scenario, thus advancing both R&D for future collider detectors as well as hardware-based ML for edge applications in high energy physics.
Related papers
- Knowledge is Overrated: A zero-knowledge machine learning and cryptographic hashing-based framework for verifiable, low latency inference at the LHC [0.6825664914747622]
Low latency event-selection (trigger) algorithms are essential components of Large Hadron Collider (LHC) operation.<n>Modern machine learning (ML) models have shown great offline performance as classifiers.<n>Inference on such large models does not satisfy the $40textMHz$ online latency constraint at the LHC.
arXiv Detail & Related papers (2025-11-16T13:31:35Z) - Enhancing Dropout-based Bayesian Neural Networks with Multi-Exit on FPGA [20.629635991749808]
This paper proposes an algorithm and hardware co-design framework that can generate field-programmable gate array (FPGA)-based accelerators for efficient BayesNNs.
At the algorithm level, we propose novel multi-exit dropout-based BayesNNs with reduced computational and memory overheads.
At the hardware level, this paper introduces a transformation framework that can generate FPGA-based accelerators for the proposed efficient BayesNNs.
arXiv Detail & Related papers (2024-06-20T17:08:42Z) - A conditional latent autoregressive recurrent model for generation and forecasting of beam dynamics in particle accelerators [46.348283638884425]
We propose a two-step unsupervised deep learning framework named as Latent Autoregressive Recurrent Model (CLARM) for learning dynamics of charged particles in accelerators.
The CLARM can generate projections at various accelerator sampling modules by capturing and decoding the latent space representation.
The results demonstrate that the generative and forecasting ability of the proposed approach is promising when tested against a variety of evaluation metrics.
arXiv Detail & Related papers (2024-03-19T22:05:17Z) - Efficient Asynchronous Federated Learning with Sparsification and
Quantization [55.6801207905772]
Federated Learning (FL) is attracting more and more attention to collaboratively train a machine learning model without transferring raw data.
FL generally exploits a parameter server and a large number of edge devices during the whole process of the model training.
We propose TEASQ-Fed to exploit edge devices to asynchronously participate in the training process by actively applying for tasks.
arXiv Detail & Related papers (2023-12-23T07:47:07Z) - Improved particle-flow event reconstruction with scalable neural networks for current and future particle detectors [1.4609888393206634]
We study scalable machine learning models for event reconstruction in electron-positron collisions based on a full detector simulation.
We compare a graph neural network and kernel-based transformer and demonstrate that we can avoid operations while achieving realistic reconstruction.
The best graph neural network model shows improvement in the jet transverse momentum resolution by up to 50% compared to the rule-based algorithm.
arXiv Detail & Related papers (2023-09-13T08:16:15Z) - Fast Neural Network Inference on FPGAs for Triggering on Long-Lived
Particles at Colliders [0.0]
We present two machine-learning algorithms for selecting events where neutral long-lived particles decay within the detector volume.
The proposed new algorithms are proven efficient for the considered benchmark physics scenario and their accuracy is found to not degrade when accelerated on the FPGA cards.
arXiv Detail & Related papers (2023-07-11T10:17:57Z) - End-to-end codesign of Hessian-aware quantized neural networks for FPGAs
and ASICs [49.358119307844035]
We develop an end-to-end workflow for the training and implementation of co-designed neural networks (NNs)
This makes efficient NN implementations in hardware accessible to nonexperts, in a single open-sourced workflow.
We demonstrate the workflow in a particle physics application involving trigger decisions that must operate at the 40 MHz collision rate of the Large Hadron Collider (LHC)
We implement an optimized mixed-precision NN for high-momentum particle jets in simulated LHC proton-proton collisions.
arXiv Detail & Related papers (2023-04-13T18:00:01Z) - Long-Range Zero-Shot Generative Deep Network Quantization [46.67334554503704]
Quantization approximates a deep network model with floating-point numbers by the one with low bit width numbers.
We propose a novel deep network quantizer, dubbed Long-Range Zero-Shot Generative Deep Network Quantization (LRQ)
arXiv Detail & Related papers (2022-11-13T04:43:52Z) - Graph Neural Networks for Charged Particle Tracking on FPGAs [2.6402980149746913]
The determination of charged particle trajectories in collisions at the CERN Large Hadron Collider (LHC) is an important but challenging problem.
Graph neural networks (GNNs) are a type of geometric deep learning algorithm that has successfully been applied to this task.
We introduce an automated translation workflow, integrated into a broader tool called $textthls4ml$, for converting GNNs into firmware for field-programmable gate arrays (FPGAs)
arXiv Detail & Related papers (2021-12-03T17:56:10Z) - Adaptive Machine Learning for Time-Varying Systems: Low Dimensional
Latent Space Tuning [91.3755431537592]
We present a recently developed method of adaptive machine learning for time-varying systems.
Our approach is to map very high (N>100k) dimensional inputs into the low dimensional (N2) latent space at the output of the encoder section of an encoder-decoder CNN.
This method allows us to learn correlations within and to track their evolution in real time based on feedback without interrupts.
arXiv Detail & Related papers (2021-07-13T16:05:28Z) - Adaptive Latent Space Tuning for Non-Stationary Distributions [62.997667081978825]
We present a method for adaptive tuning of the low-dimensional latent space of deep encoder-decoder style CNNs.
We demonstrate our approach for predicting the properties of a time-varying charged particle beam in a particle accelerator.
arXiv Detail & Related papers (2021-05-08T03:50:45Z) - MLPF: Efficient machine-learned particle-flow reconstruction using graph
neural networks [0.0]
In general-purpose particle detectors, the particle-flow algorithm may be used to reconstruct a particle-level view of the event.
We introduce a novel, end-to-end trainable, machine-learned particle-flow algorithm based on parallelizable, scalable, and graph neural networks.
We report the physics and computational performance of the algorithm on a Monte Carlo dataset of top quark-antiquark pairs produced in proton-proton collisions.
arXiv Detail & Related papers (2021-01-21T12:47:54Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.