Machine Learning Templates for QCD Factorization in the Search for Physics Beyond the Standard Model

Abstract

High-multiplicity all-hadronic final states are an important, but difficult final state for searching for physics beyond the Standard Model. A powerful search method is to look for large jets with accidental substructure due to multiple hard partons falling within a single jet. One way for estimating the background in this search is to exploit an approximate factorization in quantum chromodynamics whereby the jet mass distribution is determined only by its kinematic properties. Traditionally, this approach has been executed using histograms constructed in a background-rich region. We propose a new approach based on Generative Adversarial Networks (GANs). These neural network approaches are naturally unbinned and can be readily conditioned on multiple jet properties. In addition to using vanilla GANs for this purpose, a modification to the traditional WGAN approach has been investigated where weight clipping is replaced with a naturally compact set (in this case, the circle). Both the vanilla and modified WGAN approaches significantly outperform the histogram method, especially when modeling the dependence on features not used in the histogram construction. These results can be useful for enhancing the sensitivity of LHC searches to high-multiplicity final states involving many quarks and gluons and serve as a useful benchmark where GANs may have immediate benefit to the HEP community.

17 pages, 6 figures. v2: Updated to journal version

References in corpus (14)

• PYTHIA 6.4 Physics and Manual
• PYTHIA 6.2 Physics and Manual
• The anti-k_t jet clustering algorithm
• FastJet user manual
• DELPHES 3, A modular framework for fast simulation of a generic collider experiment
• Jet Trimming
• Learning Particle Physics by Example: Location-Aware Generative Adversarial Networks for Physics Synthesis
• Accelerating Science with Generative Adversarial Networks: An Application to 3D Particle Showers in Multi-Layer Calorimeters
• Precise simulation of electromagnetic calorimeter showers using a Wasserstein Generative Adversarial Network
• Fast and accurate simulation of particle detectors using generative adversarial networks
• Controlling Physical Attributes in GAN-Accelerated Simulation of Electromagnetic Calorimeters
• Jet Substructure by Accident
• Learning How to Count: A High Multiplicity Search for the LHC
• Jet Substructure Templates: Data-driven QCD Backgrounds for Fat Jet Searches

Cited by in corpus (18)

• Anomaly Detection with Density Estimation
• Classifying Anomalies THrough Outer Density Estimation (CATHODE)
• Invertible Networks or Partons to Detector and Back Again
• CaloFlow: Fast and Accurate Generation of Calorimeter Showers with Normalizing Flows
• Understanding Event-Generation Networks via Uncertainties
• GANplifying Event Samples
• A Neural Resampler for Monte Carlo Reweighting with Preserved Uncertainties
• Searches for the BSM scenarios at the LHC using decision tree based machine learning algorithms: A comparative study and review of Random Forest, Adaboost, XGboost and LightGBM frameworks
• A guide for deploying Deep Learning in LHC searches: How to achieve optimality and account for uncertainty
• Phase Space Sampling and Inference from Weighted Events with Autoregressive Flows
• DCTRGAN: Improving the Precision of Generative Models with Reweighting
• Combine and Conquer: Event Reconstruction with Bayesian Ensemble Neural Networks
• How to GAN Event Subtraction
• A Novel Scenario in the Semi-constrained NMSSM
• Parameter Estimation using Neural Networks in the Presence of Detector Effects
• Non-resonant Anomaly Detection with Background Extrapolation
• How to GAN Event Unweighting
• Data driven background estimation in HEP using Generative Adversarial Networks