CoChat

QCD-aware recursive neural networks for jet physics

Open access
Louppe, Gilles, Cho, Kyunghyun, Becot, Cyril, Cranmer, Kyle · 2019 · Journal of High Energy Physics

The DOI matches its Crossref record; 33 of the 37 references it cites were found in a registry or an index, and 4 are not checked yet.

Abstract

Recent progress in applying machine learning for jet physics has been built upon an analogy between calorimeters and images. In this work, we present a novel class of recursive neural networks built instead upon an analogy between QCD and natural languages. In the analogy, four-momenta are like words and the clustering history of sequential recombination jet algorithms is like the parsing of a sentence. Our approach works directly with the four-momenta of a variable-length set of particles, and the jet-based tree structure varies on an event-by-event basis. Our experiments highlight the flexibility of our method for building task-specific jet embeddings and show that recursive architectures are significantly more accurate and data efficient than previous image-based networks. We extend the analogy from individual jets (sentences) to full events (paragraphs), and show for the first time an event-level classifier operating on all the stable particles produced in an LHC event.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/jhep01(2019)057

Cites

33 of 37 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 37 references

Research works printed but not linked: 25

  1. R. Socher, C.C. Lin, C. Manning and A.Y. Ng, Parsing natural scenes and natural language with recursive neural networks, in Proceedings of the 28th international conference on machine learning (ICML-11), Bellevue U.S.A. (2011), pg. 129.
  2. R. Socher, J. Pennington, E.H. Huang, A.Y. Ng and C.D. Manning, Semi-supervised recursive autoencoders for predicting sentiment distributions, in Proceedings of the Conference on Empirical Methods in Natural Language Processing, Edinburgh U.K. (2011), pg. 151.
  3. K. Cho, B. van Merriënboer, D. Bahdanau and Y. Bengio, On the properties of neural machine translation: Encoder-decoder approaches, arXiv:1409.1259. · arXiv
  4. K. Cho et al., Learning phrase representations using rnn encoder-decoder for statistical machine translation, arXiv:1406.1078. · arXiv
  5. I. Goodfellow, Y. Bengio and A. Courville, Deep Learning, MIT Press, Cambridge U.S.A. (2016).
  6. V. Nair and G.E. Hinton, Rectified linear units improve restricted boltzmann machines, in Proceedings of the 27th international conference on machine learning (ICML-10), Haifa Israel (2010), pg. 807.
  7. D.P. Kingma and J. Ba, Adam: A Method for Stochastic Optimization, arXiv:1412.6980 [INSPIRE]. · arXiv
  8. S. R. Bowman, C. D. Manning and C. Potts, Tree-structured composition in neural networks without tree-structured architectures, arXiv:1506.04834. · arXiv
  9. S.R. Bowman, Modeling natural language semantics in learned representations, Ph.D. Thesis, Stanford University, Stanford U.S.A. (2016).
  10. G. Louppe, M. Kagan and K. Cranmer, Learning to Pivot with Adversarial Networks, arXiv:1611.01046 [INSPIRE]. · arXiv
  11. A.J. Larkoski, I. Moult and B. Nachman, Jet Substructure at the Large Hadron Collider: A Review of Recent Advances in Theory and Machine Learning, arXiv:1709.04464 [INSPIRE]. · arXiv
  12. M. Russell, Top quark physics in the Large Hadron Collider era, Ph.D. Thesis, Glasgow University, Glasgow U.K. (2017) [arXiv:1709.10508] [INSPIRE]. · arXiv
  13. S. Egan, W. Fedorko, A. Lister, J. Pearkes and C. Gay, Long Short-Term Memory (LSTM) networks with jet constituents for boosted top tagging at the LHC, arXiv:1711.09059 [INSPIRE]. · arXiv
  14. I. Henrion et al., Neural Message Passing for Jet Physics, in Proceedings of the Deep Learning for Physical Sciences Workshop at NIPS (2017), Long Beach U.S.A. (2017), https://dl4physicalsciences.github.io/files/nips dlps 2017 29.pdf. JHEP01(2019)057
  15. S. Choi, S.J. Lee and M. Perelstein, Infrared Safety of a Neural-Net Top Tagging Algorithm, arXiv:1806.01263 [INSPIRE]. · arXiv
  16. R.T. D'Agnolo and A. Wulzer, Learning New Physics from a Machine, arXiv:1806.02350 [INSPIRE]. · arXiv
  17. A. Andreassen, I. Feige, C. Frye and M.D. Schwartz, JUNIPR: a Framework for Unsupervised Machine Learning in Particle Physics, arXiv:1804.09720 [INSPIRE]. · arXiv
  18. S.R. Bowman, J. Gauthier, A. Rastogi, R. Gupta, C.D. Manning and C. Potts, A fast unified model for parsing and sentence understanding, arXiv:1603.06021. · arXiv
  19. D. Yogatama, P. Blunsom, C. Dyer, E. Grefenstette and W. Ling, Learning to compose words into sentences with reinforcement learning, arXiv:1611.09100. · arXiv
  20. J. Bruna, W. Zaremba, A. Szlam and Y. LeCun, Spectral networks and locally connected networks on graphs, arXiv:1312.6203. · arXiv
  21. Y. Li, D. Tarlow, M. Brockschmidt and R.S. Zemel, Gated graph sequence neural networks, arXiv:1511.05493. · arXiv
  22. M. Niepert, M. Ahmed and K. Kutzkov, Learning convolutional neural networks for graphs, arXiv:1605.05273. · arXiv
  23. M. Defferrard, X. Bresson and P. Vandergheynst, Convolutional neural networks on graphs with fast localized spectral filtering, arXiv:1606.09375. · arXiv
  24. T.N. Kipf and M. Welling, Semi-supervised classification with graph convolutional networks, arXiv:1609.02907. · arXiv
  25. T.N. Kipf and M. Welling, Semi-supervised classification with graph convolutional networks, arXiv:1609.02907. · arXiv

Cited by

See all 249

Metadata

Authors
Louppe, G., Cho, K., Becot, C., & Cranmer, K.
Affiliations
New York University (US)
Corresponding author
Cranmer, Kyle
Venue
Journal of High Energy Physics
Published
2019-01
Volume
2019
Issue
1
ISSN
1029-8479 (ISSN-L)
OpenAlex
W2586765566
Cited by
123
References
36
Citations by year
2026: 6 · 2025: 11 · 2024: 12 · 2023: 14 · 2022: 15 · 2021: 17 · 2020: 31 · 2019: 17
FWCI
10.38
Type
journal article
Language
en
Open access
Licence
Locations
  • Journal of High Energy Physics (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • ORBi (University of Liège) (submittedVersion, other-oa)
  • arXiv (Cornell University)
Funders
National Science Foundation (1505463, 1450310, 1205376)
Topics
  • Physical Sciences › Physics and Astronomy › Nuclear and High Energy Physics › Particle physics theoretical and experimental studies
  • Physical Sciences › Physics and Astronomy › Nuclear and High Energy Physics › High-Energy Particle Collisions Research
  • Physical Sciences › Physics and Astronomy › Nuclear and High Energy Physics › Particle Detector Development and Performance
Keywords
recursive neural networks, jet physics, QCD, four-momentum, jet clustering, data efficiency

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.