A hybrid deep learning approach to vertexing

During the LHC Run 3, the instantaneous luminosity received by LHCb will be increased going from 1.1 to 5.6 expected visible Primary Vertices (PVs) per event. To face this challenge, the LHCb detector will be upgraded and will adopt a purely software trigger. This has fueled increased interest in alternative highly-parallel and GPU friendly algorithms for tracking and reconstruction. We will present a novel prototype algorithm for vertexing in the LHCb upgrade conditions. We use a custom kernel to transform the sparse 3D space of hits and tracks into a dense 1D dataset, and then apply Deep Learning techniques to find PV locations. By training networks on our kernels using several Convolutional Neural Network layers, we have achieved better than 90% efficiency with no more than 0.2 False Positives (FPs) per event. Beyond its physics performance, this algorithm also provides a rich collection of possibilities for visualization and study of 1D convolutional networks. We will discuss the design, performance, and future potential areas of improvement and study, such as possible ways to recover the full 3D vertex information.

Paper

References (6)

05Automatic differentiation2017 · PyTorch NIPS Autodiff Workshop
06Runnable with Conda on macOS and Linux Run: conda env create -f environment-gpu.yml Python 3.6+ and PyTorch used for machine learning codeGeneration now available too using the new Conda-Forge ROOT and Pythia8 packages Supported by: • NSF OAC-1836650: IRIS-HEP • NSF OAC-1740102: SI2:SSE • NSF OAC-1739772: SI2:SSE Questions for other experiments Backup • Beam width (x, y ): 40 µm for LHCb, what is yours? • Transverse resolution: 5-15 µ

Similar papers

© 2026 NYSGPT2525 LLC