2024
DOI: 10.1007/s41781-024-00117-0
|View full text |Cite
|
Sign up to set email alerts
|

Real-Time Graph Building on FPGAs for Machine Learning Trigger Applications in Particle Physics

Marc Neu,
Jürgen Becker,
Philipp Dorwarth
et al.

Abstract: We present a design methodology that enables the semi-automatic generation of a hardware-accelerated graph building architectures for locally constrained graphs based on formally described detector definitions. In addition, we define a similarity measure in order to compare our locally constrained graph building approaches with commonly used k-nearest neighbour building approaches. To demonstrate the feasibility of our solution for particle physics applications, we implemented a real-time graph building approa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 53 publications
0
1
0
Order By: Relevance
“…The ability of DL-based methods to deal with very high-dimensional data and their flexibility in handling different structures and correlations in data allow them to learn useful representations of the data as they are trained, giving rise to improved performance over more traditional Multi-Variate-Analysis (MVA) and cutbased methods. Better tagging algorithms are critical in the success of current and future HEP experiments' goals -both for improving sensitivities in offline analysis [20][21][22][23][24][25][26][27] and for designing more efficient triggers for online operation [28][29][30][31][32][33]. Throughout run-2 of the LHC, for example, both ATLAS and CMS experiments implemented NN-based tagging algorithms as their new standard for jet-tagging tasks [16,17].…”
Section: Jinst 19 P07004mentioning
confidence: 99%
“…The ability of DL-based methods to deal with very high-dimensional data and their flexibility in handling different structures and correlations in data allow them to learn useful representations of the data as they are trained, giving rise to improved performance over more traditional Multi-Variate-Analysis (MVA) and cutbased methods. Better tagging algorithms are critical in the success of current and future HEP experiments' goals -both for improving sensitivities in offline analysis [20][21][22][23][24][25][26][27] and for designing more efficient triggers for online operation [28][29][30][31][32][33]. Throughout run-2 of the LHC, for example, both ATLAS and CMS experiments implemented NN-based tagging algorithms as their new standard for jet-tagging tasks [16,17].…”
Section: Jinst 19 P07004mentioning
confidence: 99%