TL;DR
This paper introduces a supervised graph neural network approach for jet clustering that improves the identification of Lorentz-boosted $W$ bosons and enhances discrimination from quark jets by leveraging particle associations.
Contribution
It presents a novel supervised learning method using graph neural networks for jet clustering, specifically tailored for uncolored particles like $W$, $Z$, and Higgs bosons.
Findings
Graph jets better match simulated Lorentz-boosted $W$ boson properties.
Graph jets improve discrimination between $W$ jets and quark jets.
The method demonstrates the potential of machine learning to optimize jet construction.
Abstract
Jet clustering is traditionally an unsupervised learning task because there is no unique way to associate hadronic final states with the quark and gluon degrees of freedom that generated them. However, for uncolored particles like , , and Higgs bosons, it is possible to approximately (though not exactly) associate final state hadrons to their ancestor. By labeling simulated final state hadrons as descending from an uncolored particle, it is possible to train a supervised learning method to create boson jets. Such a method much operates on individual particles and identifies connections between particles originating from the same uncolored particle. Graph neural networks are well-suited for this purpose as they can act on unordered sets and naturally create strong connections between particles with the same label. These networks are used to train a supervised jet clustering…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
