Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A case study of sending graph neural networks back to the test bench for applications in high-energy particle physics (2402.17386v1)

Published 27 Feb 2024 in hep-ph, cs.AI, and hep-ex

Abstract: In high-energy particle collisions, the primary collision products usually decay further resulting in tree-like, hierarchical structures with a priori unknown multiplicity. At the stable-particle level all decay products of a collision form permutation invariant sets of final state objects. The analogy to mathematical graphs gives rise to the idea that graph neural networks (GNNs), which naturally resemble these properties, should be best-suited to address many tasks related to high-energy particle physics. In this paper we describe a benchmark test of a typical GNN against neural networks of the well-established deep fully-connected feed-forward architecture. We aim at performing this comparison maximally unbiased in terms of nodes, hidden layers, or trainable parameters of the neural networks under study. As physics case we use the classification of the final state X produced in association with top quark-antiquark pairs in proton-proton collisions at the Large Hadron Collider at CERN, where X stands for a bottom quark-antiquark pair produced either non-resonantly or through the decay of an intermediately produced Z or Higgs boson.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (26)
  1. Measurement of the Positive Muon Anomalous Magnetic Moment to 0.20 ppm. Phys. Rev. Lett., 131(16):161802, 2023.
  2. Equation of State Calculations by Fast Computing Machines. The Journal of Chemical Physics, 21(6):1087, 2004.
  3. M. Rosenbluth. Genesis of the Monte Carlo Algorithm for Statistical Mechanics. AIP Conference Proceedings, 690(1):22, 2003.
  4. The ATLAS Experiment at the CERN Large Hadron Collider. JINST, 3:S08003, 2008.
  5. The CMS Experiment at the CERN LHC. JINST, 3:S08004, 2008.
  6. G. Salam. Towards Jetography. Eur.Phys.J., C67:637–686, 2010.
  7. Performance of missing transverse momentum reconstruction in proton-proton collisions at s=𝑠absent\sqrt{s}=square-root start_ARG italic_s end_ARG = 13 TeV using the CMS detector. JINST, 14(07):P07004, 2019.
  8. R. Feynman. The theory of positrons. Phys. Rev., 76:749–759, Sep 1949.
  9. The graph neural network model. IEEE Transactions on Neural Networks, 20(1):61–80, 2009.
  10. A. Micheli. Neural network for graphs: A contextual constructive approach. IEEE Transactions on Neural Networks, 20(3):498–511, 2009.
  11. T. Kipf and M. Welling. Semi-Supervised Classification with Graph Convolutional Networks. arXiv e-prints, page arXiv:1609.02907, September 2016.
  12. Inductive representation learning on large graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems, NIPS’17, page 1025–1035, Red Hook, NY, USA, 2017. Curran Associates Inc.
  13. Graph Attention Networks. International Conference on Learning Representations, 2018.
  14. Graph Neural Networks in Particle Physics. 7 2020.
  15. Search for t⁢t¯⁢Ht¯tH\mathrm{t}\overline{\mathrm{t}}\mathrm{H}roman_t over¯ start_ARG roman_t end_ARG roman_H production in the H→b⁢b¯→Hb¯b\mathrm{H}\to\mathrm{b}\overline{\mathrm{b}}roman_H → roman_b over¯ start_ARG roman_b end_ARG decay channel with leptonic t⁢t¯t¯t\mathrm{t}\overline{\mathrm{t}}roman_t over¯ start_ARG roman_t end_ARG decays in proton-proton collisions at s=13𝑠13\sqrt{s}=13square-root start_ARG italic_s end_ARG = 13 TeV. JHEP, 03:026, 2019.
  16. Review of Particle Physics. PTEP, 2022:083C01, 2022.
  17. Identification of heavy-flavour jets with the CMS detector in pp collisions at 13 TeV. JINST, 13(05):P05011, 2018.
  18. The automated computation of tree-level and next-to-leading order differential cross sections, and their matching to parton shower simulations. JHEP, 07:079, 2014.
  19. MadGraph 5 : Going Beyond. JHEP, 06:128, 2011.
  20. An introduction to PYTHIA 8.2. Comput. Phys. Commun., 191:159–177, 2015.
  21. DELPHES 3, A modular framework for fast simulation of a generic collider experiment. JHEP, 02:057, 2014.
  22. The anti-ktsubscript𝑘𝑡k_{t}italic_k start_POSTSUBSCRIPT italic_t end_POSTSUBSCRIPT jet clustering algorithm. JHEP, 04:063, 2008.
  23. M. Fey and J. Lenssen. Fast graph representation learning with pytorch geometric, 2019.
  24. Pytorch: An imperative style, high-performance deep learning library, 2019.
  25. D. Kingma and J. Ba. Adam: A Method for Stochastic Optimization. 12 2014.
  26. Weisfeiler and leman go neural: Higher-order graph neural networks. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01):4602–4609, Jul. 2019.
Citations (1)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com