Permutationless Many-Jet Event Reconstruction with Symmetry Preserving Attention Networks

• URL: http://arxiv.org/abs/2010.09206v6
• Date: Thu, 14 Jul 2022 20:31:19 GMT
• Title: Permutationless Many-Jet Event Reconstruction with Symmetry Preserving Attention Networks
• Authors: Michael James Fenton, Alexander Shmakov, Ta-Wei Ho, Shih-Chieh Hsu, Daniel Whiteson, Pierre Baldi
• Abstract summary: Top quarks, produced in large numbers at the Large Hadron Collider, have a complex detector signature and require special reconstruction techniques. We present a novel approach to this class of problem, based on neural networks using a generalized attention mechanism, that we call Symmetry Preserving Attention Networks (SPA-Net) We train one such network to identify the decay products of each top quark unambiguously and without explosion as an example of the power of this technique.
• Score: 62.45440485315577
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Top quarks, produced in large numbers at the Large Hadron Collider, have a complex detector signature and require special reconstruction techniques. The most common decay mode, the "all-jet" channel, results in a 6-jet final state which is particularly difficult to reconstruct in $pp$ collisions due to the large number of permutations possible. We present a novel approach to this class of problem, based on neural networks using a generalized attention mechanism, that we call Symmetry Preserving Attention Networks (SPA-Net). We train one such network to identify the decay products of each top quark unambiguously and without combinatorial explosion as an example of the power of this technique.This approach significantly outperforms existing state-of-the-art methods, correctly assigning all jets in $93.0%$ of $6$-jet, $87.8%$ of $7$-jet, and $82.6%$ of $\geq 8$-jet events respectively.

Related papers

• Reconstruction of boosted and resolved multi-Higgs-boson events with symmetry-preserving attention networks [39.81062177256674]
  We introduce a generalization to the SPA-Net approach to simultaneously consider both boosted and resolved reconstruction possibilities. Considering both boosted and resolved topologies, our SPA-Net approach increases the Higgs boson reconstruction purity by 57--62%.
  arXiv  Detail & Related papers  (2024-12-05T02:24:52Z)
• Quantum-annealing-inspired algorithms for multijet clustering [0.0]
  We introduce novel quantum-annealing-inspired algorithms for clustering multiple jets in electron-positron collision events. One of these quantum-annealing-inspired algorithms, ballistic simulated bifurcation, overcomes problems previously observed in multijet clustering with quantum-annealing approaches.
  arXiv  Detail & Related papers  (2024-10-18T07:31:04Z)
• $C^2M^3$: Cycle-Consistent Multi-Model Merging [27.845750236662575]
  We present a novel data-free method for merging neural networks in weight space. We enforce cycle consistency of the permutations when merging $N geq 3$ models.
  arXiv  Detail & Related papers  (2024-05-28T07:18:45Z)
• "Lossless" Compression of Deep Neural Networks: A High-dimensional Neural Tangent Kernel Approach [49.744093838327615]
  We provide a novel compression approach to wide and fully-connected emphdeep neural nets. Experiments on both synthetic and real-world data are conducted to support the advantages of the proposed compression scheme.
  arXiv  Detail & Related papers  (2024-03-01T03:46:28Z)
• Reconstruction of Unstable Heavy Particles Using Deep Symmetry-Preserving Attention Networks [40.56234804431537]
  Anapproach based on a generalized attention mechanism, symmetry preserving attention networks (SPA-NET) has been previously applied to top quark pair decays at the Large Hadron Collider. We extend the SPA-NET architecture to consider multiple input object types, such as leptons, as well as global event features, such as the missing transverse momentum. We find significant improvements in the power of three representative studies: a search for ttH, a measurement of the top quark mass, and a search for a heavy Z' decaying to top quark pairs.
  arXiv  Detail & Related papers  (2023-09-05T01:40:01Z)
• Neural Inverse Kinematics [72.85330210991508]
  Inverse kinematic (IK) methods recover the parameters of the joints, given the desired position of selected elements in the kinematic chain. We propose a neural IK method that employs the hierarchical structure of the problem to sequentially sample valid joint angles conditioned on the desired position.
  arXiv  Detail & Related papers  (2022-05-22T14:44:07Z)
• A quantum algorithm for training wide and deep classical neural networks [72.2614468437919]
  We show that conditions amenable to classical trainability via gradient descent coincide with those necessary for efficiently solving quantum linear systems. We numerically demonstrate that the MNIST image dataset satisfies such conditions. We provide empirical evidence for $O(log n)$ training of a convolutional neural network with pooling.
  arXiv  Detail & Related papers  (2021-07-19T23:41:03Z)
• SPANet: Generalized Permutationless Set Assignment for Particle Physics using Symmetry Preserving Attention [62.43586180025247]
  Collisions at the Large Hadron Collider produce variable-size sets of observed particles. Physical symmetries of decay products complicate assignment of observed particles to decay products. We introduce a novel method for constructing symmetry-preserving attention networks.
  arXiv  Detail & Related papers  (2021-06-07T18:18:20Z)
• ESPN: Extremely Sparse Pruned Networks [50.436905934791035]
  We show that a simple iterative mask discovery method can achieve state-of-the-art compression of very deep networks. Our algorithm represents a hybrid approach between single shot network pruning methods and Lottery-Ticket type approaches.
  arXiv  Detail & Related papers  (2020-06-28T23:09:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.