BIP: Boost Invariant Polynomials for Efficient Jet Tagging

• URL: http://arxiv.org/abs/2207.08272v1
• Date: Sun, 17 Jul 2022 19:46:42 GMT
• Title: BIP: Boost Invariant Polynomials for Efficient Jet Tagging
• Abstract summary: We present a novel, versatile and transparent framework for jet representation. It achieves high accuracy on jet tagging benchmarks while being orders of magnitudes faster to train and evaluate.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deep Learning approaches are becoming the go-to methods for data analysis in High Energy Physics (HEP). Nonetheless, most physics-inspired modern architectures are computationally inefficient and lack interpretability. This is especially the case with jet tagging algorithms, where computational efficiency is crucial considering the large amounts of data produced by modern particle detectors. In this work, we present a novel, versatile and transparent framework for jet representation; invariant to Lorentz group boosts, which achieves high accuracy on jet tagging benchmarks while being orders of magnitudes faster to train and evaluate than other modern approaches for both supervised and unsupervised schemes.

Related papers

• JetParticle-JEPA: An Efficient Self-Supervised Representation Learning method for Jet Tagging in High-Energy Physics [4.231181719953953]
  We introduce JetParticle-JEPA (JP-JEPA), a self-supervised Joint-Embedding Predictive Architecture.<n>It learns physically meaningful jet representations directly from continuous particle clouds without tokenization or reconstruction of raw inputs.<n>Built on a Particle Transformer backbone, JP-JEPA predicts latent representations of masked particles while preserving fine-grained kinematic correlations.
  arXiv  Detail & Related papers  (2026-06-12T08:25:47Z)
• Improving Matrix Exponential for Generative AI Flows: A Taylor-Based Approach Beyond Paterson--Stockmeyer [1.228544477050145]
  The matrix exponential is a fundamental operator in scientific computing and system simulation.<n>This paper presents a Taylor-based algorithm for the matrix exponential, specifically designed for the high- throughput requirements of generative AI flows.
  arXiv  Detail & Related papers  (2025-12-23T21:25:40Z)
• Gradient Descent as a Perceptron Algorithm: Understanding Dynamics and Implicit Acceleration [67.12978375116599]
  We show that the steps of gradient descent (GD) reduce to those of generalized perceptron algorithms.<n>This helps explain the optimization dynamics and the implicit acceleration phenomenon observed in neural networks.
  arXiv  Detail & Related papers  (2025-12-12T14:16:35Z)
• FlightKooba: A Fast Interpretable FTP Model [10.508683081749341]
  This paper introduces FlightKooba, a novel modeling approach designed to extract underlying dynamics analytically.<n>FlightKooba delivers competitive prediction accuracy while reducing trainable parameters by several orders of magnitude.<n>In summary, FlightKooba offers a powerful, efficient, and interpretable new alternative for time series analysis, particularly in resource-constrained environments.
  arXiv  Detail & Related papers  (2025-06-24T04:53:49Z)
• Preconditioned Additive Gaussian Processes with Fourier Acceleration [2.292881746604941]
  We introduce a matrix-free method to achieve nearly linear complexity in the multiplication of kernel matrices and their derivatives. To address high-dimensional problems, we propose an additive kernel approach. Each sub- Kernel captures lower-order feature interactions, allowing for the efficient application of the NFFT method.
  arXiv  Detail & Related papers  (2025-04-01T07:14:06Z)
• Quantum Rationale-Aware Graph Contrastive Learning for Jet Discrimination [1.927711700724334]
  In high-energy physics, particle jet tagging plays a pivotal role in distinguishing quark from gluon jets.<n>Existing contrastive learning frameworks struggle to leverage rationale-aware augmentations effectively.<n>We show that integrating a quantum rationale generator within our proposed Quantum Rationale-aware Graph Contrastive Learning framework significantly enhances jet discrimination performance.
  arXiv  Detail & Related papers  (2024-11-03T17:36:05Z)
• Sample-efficient Bayesian Optimisation Using Known Invariances [56.34916328814857]
  We show that vanilla and constrained BO algorithms are inefficient when optimising invariant objectives. We derive a bound on the maximum information gain of these invariant kernels. We use our method to design a current drive system for a nuclear fusion reactor, finding a high-performance solution.
  arXiv  Detail & Related papers  (2024-10-22T12:51:46Z)
• No Train No Gain: Revisiting Efficient Training Algorithms For Transformer-based Language Models [31.080446886440757]
  In this work, we revisit three categories of such algorithms: dynamic architectures (layer stacking, dropping), batch selection (selective backprop, RHO loss), and efficient layers (Lion, Sophia) We find that their training, validation, and downstream gains vanish compared to a baseline with a fully-decayed learning rate. We define an evaluation protocol that enables machines to be done on arbitrary computation by mapping all computation time to a reference machine which we call reference system time.
  arXiv  Detail & Related papers  (2023-07-12T20:10:14Z)
• Hardware Acceleration of Explainable Artificial Intelligence [5.076419064097733]
  We propose a simple yet efficient framework to accelerate various XAI algorithms with existing hardware accelerators. Our proposed approach can lead to real-time outcome interpretation.
  arXiv  Detail & Related papers  (2023-05-04T19:07:29Z)
• Improving robustness of jet tagging algorithms with adversarial training [56.79800815519762]
  We investigate the vulnerability of flavor tagging algorithms via application of adversarial attacks. We present an adversarial training strategy that mitigates the impact of such simulated attacks.
  arXiv  Detail & Related papers  (2022-03-25T19:57:19Z)
• Efficient Few-Shot Object Detection via Knowledge Inheritance [62.36414544915032]
  Few-shot object detection (FSOD) aims at learning a generic detector that can adapt to unseen tasks with scarce training samples. We present an efficient pretrain-transfer framework (PTF) baseline with no computational increment. We also propose an adaptive length re-scaling (ALR) strategy to alleviate the vector length inconsistency between the predicted novel weights and the pretrained base weights.
  arXiv  Detail & Related papers  (2022-03-23T06:24:31Z)
• Towards Structured Dynamic Sparse Pre-Training of BERT [4.567122178196833]
  We develop and study a straightforward, dynamic always-sparse pre-training approach for BERT language modeling task. We demonstrate that training remains FLOP-efficient when using coarse-grained block sparsity, making it particularly promising for efficient execution on modern hardware accelerators.
  arXiv  Detail & Related papers  (2021-08-13T14:54:26Z)
• Self Normalizing Flows [65.73510214694987]
  We propose a flexible framework for training normalizing flows by replacing expensive terms in the gradient by learned approximate inverses at each layer. This reduces the computational complexity of each layer's exact update from $mathcalO(D3)$ to $mathcalO(D2)$. We show experimentally that such models are remarkably stable and optimize to similar data likelihood values as their exact gradient counterparts.
  arXiv  Detail & Related papers  (2020-11-14T09:51:51Z)
• Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations [79.71184760864507]
  This article introduces a new physics-based method for rigid point set alignment called Fast Gravitational Approach (FGA) In FGA, the source and target point sets are interpreted as rigid particle swarms with masses interacting in a globally multiply-linked manner while moving in a simulated gravitational force field. We show that the new method class has characteristics not found in previous alignment methods.
  arXiv  Detail & Related papers  (2020-09-28T15:05:39Z)
• Active learning of deep surrogates for PDEs: Application to metasurface design [30.731619528075214]
  We present an active learning algorithm that reduces the number of training points by more than an order of magnitude for a neural-network surrogate model of optical-surface components. Results show that the surrogate evaluation is over two orders of magnitude faster than a direct solve, and we demonstrate how this can be exploited to accelerate large-scale engineering optimization.
  arXiv  Detail & Related papers  (2020-08-24T17:14:13Z)
• Towards High Performance Relativistic Electronic Structure Modelling: The EXP-T Program Package [68.8204255655161]
  We present a new implementation of the FS-RCC method designed for modern parallel computers. The performance and scaling features of the implementation are analyzed. The software developed allows to achieve a completely new level of accuracy for prediction of properties of atoms and molecules containing heavy and superheavy nuclei.
  arXiv  Detail & Related papers  (2020-04-07T20:08:30Z)

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.