Quantifying the performance of jet algorithms at LHC
Juan Rojo

TL;DR
This paper introduces a method to evaluate the effectiveness of jet clustering algorithms at the LHC, focusing on reconstructing heavy particle decays and optimizing algorithm choices.
Contribution
It presents a new strategy for quantifying jet algorithm performance, including robustness against pileup, with applications to hypothetical heavy particle decays.
Findings
Optimal jet algorithm parameters identified for Z' and Higgs decays.
Performance estimates remain stable under high-luminosity pileup.
Method provides a systematic way to compare jet algorithms.
Abstract
In the present contribution we introduce a strategy to quantify the performance of modern infrared and collinear safe jet clustering algorithms in processes which involve the reconstruction of heavy object decays. We determine optimal choices for fictional narrow and over a range of masses, providing examples of simple quark-jet and gluon-jet samples respectively. We show also that our estimates are robust against the presence of high-luminosity pileup.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParticle physics theoretical and experimental studies · High-Energy Particle Collisions Research · Advanced Data Storage Technologies
