arXiv:2510.07594hep-excs.LG2025-10中稿 · NeurIPS被引 1

用哈希加速粒子轨迹重建,推理速度提升至每事件28毫秒。

Locality-Sensitive Hashing-Based Efficient Point Transformer for Charged Particle Reconstruction

  • 基于局部敏感哈希设计高效注意力机制,计算规整适合硬件加速。
  • 在TrackML数据集上实现28毫秒/事件的端到端推理速度,跟踪效率保持竞争力。
  • 无需后处理聚类,适合实时高能物理实验中的快速轨迹重建。

带电粒子轨迹重建是对撞机实验中的基础任务,也是粒子重建的主要计算瓶颈。图神经网络(GNN)在此任务中表现优异,但其图构建成本高、计算不规则且内存访问模式随机,严重限制吞吐量。近期提出的基于哈希的高效点变换器(HEPT)通过局部敏感哈希(LSH)在注意力计算中实现了理论上近线性的复杂度,适用于大规模点云处理;然而其评估主要集中在嵌入质量,且依赖对象压缩流水线,需额外聚类步骤(如DBScan),可能主导运行时间。本文贡献有二:首先,在相同数据集与指标下,首次对HEPT与代表性GNN流水线进行了统一公平评估;其次,提出HEPTv2,在原基础上引入轻量解码器,移除聚类阶段,直接预测轨迹分配。该改进保留了HEPT的规整计算模式,实现超快端到端推理。在TrackML数据集上,优化后的HEPTv2在A100上实现约28毫秒/事件的推理速度,同时保持良好跟踪效率。结果表明,HEPTv2是快速轨迹重建中可实用、可扩展的GNN替代方案。

原文摘要 · Abstract (English)

Charged particle track reconstruction is a foundational task in collider experiments and the main computational bottleneck in particle reconstruction. Graph neural networks (GNNs) have shown strong performance for this problem, but costly graph construction, irregular computations, and random memory access patterns substantially limit their throughput. The recently proposed Hashing-based Efficient Point Transformer (HEPT) offers a theoretically guaranteed near-linear complexity for large point cloud processing via locality-sensitive hashing (LSH) in attention computations; however, its evaluations have largely focused on embedding quality, and the object condensation pipeline on which HEPT relies requires a post-hoc clustering step (e.g., DBScan) that can dominate runtime. In this work, we make two contributions. First, we present a unified, fair evaluation of physics tracking performance for HEPT and a representative GNN-based pipeline under the same dataset and metrics. Second, we introduce HEPTv2 by extending HEPT with a lightweight decoder that eliminates the clustering stage and directly predicts track assignments. This modification preserves HEPT's regular, hardware-friendly computations while enabling ultra-fast end-to-end inference. On the TrackML dataset, optimized HEPTv2 achieves approximately 28 ms per event on an A100 while maintaining competitive tracking efficiency. These results position HEPTv2 as a practical, scalable alternative to GNN-based pipelines for fast tracking.

粒子重建点云处理哈希加速端到端推理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。