Neural-network-assisted binary template optimization for online pattern matching of the STCF main drift chamber
- 1Hunan University of Science and Technology
Abstract
The Super Tau-Charm Facility (STCF), with a designed center-of-mass energy range of 2–7 GeV, a peak luminosity exceeding 0.5× 1035 cm−2s−1, a total trigger rate of about 400 kHz, and a total data rate of about 30 GB/s, will impose stringent requirements for fast track finding and data reduction and compression algorithms in the High-Level Trigger. Local track segment finding in the Main Drift Chamber (MDC) underpins subsequent segment combination and full track reconstruction, yet high background rates and limited detection efficiency can significantly increase the risk of false triggers and signal loss in pattern matching algorithms. This paper presents a neural-network-assisted framework for constructing binary template libraries used in matrix-based pattern matching for MDC local track segment finding. The framework formulates template construction as a differentiable multi-objective optimization problem, employing a neural network to jointly learn template parameters under multiple constraints. After training, only binary template pairs are exported and deployed into the existing bitwise pattern matching routine, requiring no neural network inference at runtime and thus preserving the deterministic, fast, and parallelizable nature of the online algorithm. Experimental results based on simulation samples demonstrate that, under limited detection efficiency, the resulting template library maintains relatively high signal retention across different transverse momentum ranges and background levels, and can be flexibly tailored to adjust the coverage range according to practical requirements. The proposed approach combines offline neural-network optimization with a deterministic, fast conventional online algorithm, enabling artificial-intelligence-enhanced online data processing in high-luminosity particle collider experiments.
Related
- Fast Template Matching for Quantum Circuits Using Hypergraph
- Batched pattern search for QAOA parameter optimization on cloud-accessed quantum hardware
- Hierarchical emergence of network bursting in a four-cell central pattern generator model
- An Algorithm for computing Three- and Four-Body Density Matrices from CASCI Wavefunction and AI-Assisted Code Optimization
- Explainable AI-assisted optimization for Feynman integral reduction
BibTeX
@article{guo2026neuralnetworkassisted,
title = {{Neural-network-assisted binary template optimization for online pattern matching of the STCF main drift chamber}},
author = {Zhaoli Guo and Qingyu Li and Baolin Zhang and Jiarui Zhao and Aonan Zhu and Liang Peng and Huilin Li},
journal = {The European Physical Journal C},
year = {2026},
month = nov,
doi = {10.1140/epjc/s10052-026-16477-3},
url = {https://link.springer.com/article/10.1140/epjc/s10052-026-16477-3},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Neural-network-assisted binary template optimization for online pattern matching of the STCF main drift chamber
AU - Zhaoli Guo
AU - Qingyu Li
AU - Baolin Zhang
AU - Jiarui Zhao
AU - Aonan Zhu
AU - Liang Peng
AU - Huilin Li
PY - 2026
DA - 2026/11/03
JO - The European Physical Journal C
DO - 10.1140/epjc/s10052-026-16477-3
UR - https://link.springer.com/article/10.1140/epjc/s10052-026-16477-3
AB - The Super Tau-Charm Facility (STCF), with a designed center-of-mass energy range of 2–7 GeV, a peak luminosity exceeding 0.5× 10^35 cm^−2s^−1, a total trigger rate of about 400 kHz, and a total data rate of about 30 GB/s, will impose stringent requirements for fast track finding and data reduction and compression algorithms in the High-Level Trigger. Local track segment finding in the Main Drift Chamber (MDC) underpins subsequent segment combination and full track reconstruction, yet high background rates and limited detection efficiency can significantly increase the risk of false triggers and signal loss in pattern matching algorithms. This paper presents a neural-network-assisted framework for constructing binary template libraries used in matrix-based pattern matching for MDC local track segment finding. The framework formulates template construction as a differentiable multi-objective optimization problem, employing a neural network to jointly learn template parameters under multiple constraints. After training, only binary template pairs are exported and deployed into the existing bitwise pattern matching routine, requiring no neural network inference at runtime and thus preserving the deterministic, fast, and parallelizable nature of the online algorithm. Experimental results based on simulation samples demonstrate that, under limited detection efficiency, the resulting template library maintains relatively high signal retention across different transverse momentum ranges and background levels, and can be flexibly tailored to adjust the coverage range according to practical requirements. The proposed approach combines offline neural-network optimization with a deterministic, fast conventional online algorithm, enabling artificial-intelligence-enhanced online data processing in high-luminosity particle collider experiments.
SN - 1434-6052
ER -