Solving Combinatorial Problems at Particle Colliders Using Machine Learning

Abstract

High-multiplicity signatures at particle colliders can arise in Standard Model processes and beyond. With such signatures, difficulties often arise from the large dimensionality of the kinematic space. For final states containing a single type of particle signature, this results in a combinatorial problem that hides underlying kinematic information. We explore using a neural network that includes a Lorentz Layer to extract high-dimensional correlations. We use the case of squark decays in $R$-Parity-violating Supersymmetry as a benchmark, comparing the performance to that of classical methods. With this approach, we demonstrate significant improvement over traditional methods.

6 pages, 5 figures, published in PRD

References in corpus (8)

• PYTHIA 6.4 Physics and Manual
• The automated computation of tree-level and next-to-leading order differential cross sections, and their matching to parton shower simulations
• An Introduction to PYTHIA 8.2
• Beyond the Minimal Supersymmetric Standard Model: from theory to phenomenology
• Search for heavy particles decaying into a top-quark pair in the fully hadronic final state in $pp$ collisions at $\sqrt{s}=13$ TeV with the ATLAS detector
• Lorentz Boost Networks: Autonomous Physics-Inspired Feature Engineering
• Search for three-jet resonances in pp collisions at sqrt(s) = 7 TeV
• Resolving Combinatorial Ambiguities in Dilepton $t\bar{t}$ Event Topologies with Neural Networks