HackerPapers

arXiv:2002.02534physics.comp-ph

Fast inference of Boosted Decision Trees in FPGAs for particle physics

Sioni Summers, Giuseppe Di Guglielmo, Javier Duarte, Philip Harris, Duc Hoang, Sergo Jindariani, Edward Kreinar, Vladimir Loncar, Jennifer Ngadiuba, Maurizio Pierini, Dylan Rankin, Nhan Tran, Zhenbin Wu

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We describe the implementation of Boosted Decision Trees in the hls4ml library, which allows the translation of a trained model into FPGA firmware through an automated conversion process. Thanks to its fully on-chip implementation, hls4ml performs inference of Boosted Decision Tree models with extremely low latency. With a typical latency less than 100 ns, this solution is suitable for FPGA-based real-time processing, such as in the Level-1 Trigger system of a collider experiment. These developments open up prospects for physicists to deploy BDTs in FPGAs for identifying the origin of jets, better reconstructing the energies of muons, and enabling better selection of rare signal processes.

arXiv comments
Journal reference
JINST 15 P05026 (2020)
DOI
doi:10.1088/1748-0221/15/05/p05026
Subjects
physics.comp-phComputational Physics astro-ph.IMInstrumentation and Methods for Astrophysics cs.LGMachine Learning hep-exHigh Energy Physics, Experiment

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jun 2021 to Jun 2021.

Comments linking this paper, per year.

Discussed in comments1 thread

    • > I have yet to see a real world production pipeline where GBDT provides enough improvement over Logistic Regression Not my field at all, so "I know nooothing". Are GBDT's very different from "plain" binary decision trees? I've seen the latter a lot in the context of particle…

      magicalhippoView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.