mlsanityData to 7 Oct 2026

PASCL: Supervised Contrastive Learning with Perturbative Augmentation for Particle Decay Reconstruction

arXiv 2402.11538 ↗First posted 18 Feb 2024hep-ph cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

In high-energy physics, particles produced in collision events decay in a format of a hierarchical tree structure, where only the final decay products can be observed using detectors. However, the large combinatorial space of possible tree structures makes it challenging to recover the actual decay process given a set of final particles. To better analyse the hierarchical tree structure, we propose a graph-based deep learning model to infer the tree structure to reconstruct collision events. In particular, we use a compact matrix representation termed as lowest common ancestor generations (LCAG) matrix, to encode the particle decay tree structure. Then, we introduce a perturbative augmentation technique applied to node features, aiming to mimic experimental uncertainties and increase data diversity. We further propose a supervised graph contrastive learning algorithm to utilize the information of inter-particle relations from multiple decay processes. Extensive experiments show that our proposed supervised graph contrastive learning with perturbative augmentation (PASCL) method outperforms state-of-the-art baseline models on an existing physics-based dataset, significantly improving the reconstruction accuracy. This method provides a more effective training strategy for models with the same parameters and makes way for more accurate and efficient high-energy particle physics data analysis.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 27 of its 56 references that are in the map. First posted on arXiv 18 Feb 2024.

Builds on

27 of 56 references.

References · 27

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  5. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  6. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  7. 2020Supervised Contrastive Learningcited by 2,803
  8. 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,220
  9. 2019Contrastive Multiview Codingcited by 1,297
  10. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  11. 2018Deep Graph Infomaxcited by 1,101
  12. 2019EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Taskscited by 800
15 more
  1. 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
  2. 2020Deep Graph Contrastive Representation Learningcited by 535
  3. 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
  4. 2020Supervised Contrastive Learning for Pre-trained Language Model Fine-tuningcited by 275
  5. 2020Robust Optimization as Data Augmentation for Large-scale Graphscited by 58
  6. 2020VideoMix: Rethinking Data Augmentation for Video Classificationcited by 55
  7. 2021Local Augmentation for Graph Neural Networkscited by 52
  8. 2018Machine Learning in High Energy Physics Community White Papercited by 48
  9. 2021Simple GNN Regularisation for 3D Molecular Property Prediction & Beyondcited by 44
  10. 2021Performance of a Geometric Deep Learning Pipeline for HL-LHC Particle Trackingcited by 29
  11. 2020Permutationless Many-Jet Event Reconstruction with Symmetry Preserving Attention Networkscited by 22
  12. 2019Factorised Neural Relational Inference for Multi-Interaction Systemscited by 14
  13. 2023Topological Reconstruction of Particle Physics Processes using Graph Neural Networkscited by 8
  14. 2023Progress towards an improved particle flow algorithm at CMS with machine learningcited by 7
  15. 2022Learning Tree Structures from Leaves For Particle Decay Reconstructioncited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 0; 2026: 1.

3 papers.