Hovedsiden > The Tracking Machine Learning challenge : Throughput phase |
Article | |
Report number | arXiv:2105.01160 |
Title | The Tracking Machine Learning challenge : Throughput phase |
Related title | The Tracking Machine Learning Challenge: Throughput Phase |
Author(s) | Amrouche, Sabrina (Geneva U.) ; Basara, Laurent (LRI, Paris 11 ; INRIA, Saclay) ; Calafiura, Paolo (LBL, Berkeley ; UC, Berkeley (main) ; UC, Berkeley) ; Emeliyanov, Dmitry (Rutherford) ; Estrade, Victor (LRI, Paris 11 ; INRIA, Saclay) ; Farrell, Steven (LBL, Berkeley ; UC, Berkeley (main) ; UC, Berkeley) ; Germain, Cécile (LRI, Paris 11 ; INRIA, Saclay) ; Gligorov, Vladimir Vava (LPNHE, Paris) ; Golling, Tobias (Geneva U.) ; Gorbunov, Sergey (Goethe U., Frankfurt (main)) ; Gray, Heather (LBL, Berkeley ; UC, Berkeley (main) ; UC, Berkeley) ; Guyon, Isabelle (Unlisted, US, CA ; INRIA, Saclay) ; Hushchyn, Mikhail (Higher Sch. of Economics, Moscow ; Yandex Sch. Data Anal., Moscow) ; Innocente, Vincenzo (CERN) ; Kiehn, Moritz (Geneva U.) ; Kunze, Marcel (U. Heidelberg (main)) ; Moyse, Edward (Massachusetts U., Amherst) ; Rousseau, David (IJCLab, Orsay) ; Salzburger, Andreas (CERN) ; Ustyuzhanin, Andrey (Higher Sch. of Economics, Moscow ; Yandex Sch. Data Anal., Moscow) ; Vlimant, Jean-Roch (Caltech) ; Yilmaz, Yetkin (IJCLab, Orsay) |
Publication | 2023-02-13 |
Imprint | 2021-05-03 |
Number of pages | 19 |
In: | Comput. Softw. Big Sci. 7 (2023) 1 |
DOI | 10.1007/s41781-023-00094-w |
Subject category | hep-ex ; Particle Physics - Experiment ; cs.LG ; Computing and Computers |
Abstract | This paper reports on the second "Throughput" phase of the Tracking Machine Learning (TrackML) challenge on the Codalab platform. As in the first "Accuracy" phase, the participants had to solve a difficult experimental problem linked to tracking accurately the trajectory of particles as e.g. created at the Large Hadron Collider (LHC): given O($10^5$) points, the participants had to connect them into O($10^4$) individual groups that represent the particle trajectories which are approximated helical. While in the first phase only the accuracy mattered, the goal of this second phase was a compromise between the accuracy and the speed of inference. Both were measured on the Codalab platform where the participants had to upload their software. The best three participants had solutions with good accuracy and speed an order of magnitude faster than the state of the art when the challenge was designed. Although the core algorithms were less diverse than in the first phase, a diversity of techniques have been used and are described in this paper. The performance of the algorithms are analysed in depth and lessons derived. |
Copyright/License | publication: © 2023-2024 The Author(s) (License: CC-BY-4.0) preprint: (License: CC BY 4.0) |