arXiv subjects

Benjamin Nachman

Publications and source records attributed to Benjamin Nachman.

At least 37 records · Page 2Linked to original sources

arXiv2026

Parnassus: A GPU-enabled, Python-based Package for Fast Particle Detector Simulation and Reconstruction

We present the public software release of Parnassus, a Python/PyTorch, GPU-compatible framework for fast detector simulation and reconstruction in particle and nuclear physics. Parnassus provides a user-friendly framework with interchangeable detector models: neural models can emulate computationally expensive Geant4-based detector simulation and reconstruction chains, while parametric models provide PyTorch implementations of selected Delphes-style detector responses. This initial release includes two models of the CMS detector: one based on a flow-matching neural network architecture and one based on a PyTorch implementation of the Delphes CMS card (parametric bias and smearing). PyTorch versions of the ATLAS and ALEPH Delphes cards are also available, together with a flow-matching neural model of the ALEPH detector that extends the framework to the e+e- LEP environment. All detector-specific backends share the same process-agnostic and detector-agnostic API: users select a detector card - analogous to choosing a detector card in Delphes - and the same tool can be applied to new physics processes without retraining the released detector model. There are native interfaces to the event generator Pythia and the event clustering package FastJet. Unlike previous C++/ROOT-based tools, Parnassus provides GPU-capable PyTorch detector-response backends and requires no ROOT installation. We describe the installation, command-line and Python API, configuration system, and demonstrate the framework on Standard Model and BSM processes.

hep-ex↗

arXiv2026

Look everywhere effects in anomaly detection

Machine learning-based anomaly detection methods are able to search high-dimensional spaces for hints of new physics with much less theory bias than traditional searches. However, by searching in many directions all at once, the statistical power of these search strategies is diluted by a variant of the look elsewhere effect. We examine this challenge in detail, focusing on weakly supervised methods. We find that training and testing on the same data results in badly miscalibrated $p$-values due to the anomaly detector searching everywhere in the data and overfitting on statistical fluctuations. However, if these $p$-values can be calibrated, they may offer the best sensitivity to anomalies, since this approach uses all of the data. Conversely, training on half of the data and testing on the other half results in perfectly calibrated $p$-values, but at the cost of reduced sensitivity to anomalies. Similarly, regularization methods such as early stopping can help with $p$-value calibration but also possibly at the expense of sensitivity. Finally, we find that k-folding strikes an effective balance between calibration and sensitivity. Our findings are supported by numerical studies with Gaussian random variables as well as from collider physics using the LHC Olympics benchmark anomaly detection dataset.

hep-ph↗

arXiv2026

Ultra Fast Calorimeter Simulation with Generative Machine Learning on FPGAs

Computationally expensive, high-accuracy detector simulations are a major bottleneck for many particle physics experiments such as those at the Large Hadron Collider (LHC) as well as those planned for future colliders. This challenge has motivated the development of fast generative machine learning based surrogates. We present a hardware-aware variational autoencoder model for fast calorimeter simulation that is designed specifically for field programmable gate array (FPGA) deployment, offering faster and lower power inference capability. Quantization aware training and other compression techniques are applied to respect the resource constraints of a single FPGA. The synthesized implementation of the VAE decoder achieves sub-millisecond latency, resulting in a substantial speed up compared to a traditional GPU implementation with only a small performance drop. This feasibility study demonstrates the potential of utilizing existing FPGA architecture at the LHC and other facilities for efficient offline computing using online resources.

physics.ins-det↗

arXiv2026

Reweighting Adversarial Networks for Unbinned Unfolding

Differential cross sections are the currency of scientific exchange in particle and nuclear physics. Recently, machine learning methods have enabled unbinned and high-dimensional cross section measurements through new approaches to unfolding. A key challenge with unfolding is that it is a bi-level optimization problem where constraints are available at the detector level while the target is at the particle level, linked by a stochastic detector response. Further complications arise when the particle-level and detector-level distributions have non-overlapping or only partially overlapping support, which can destabilize training and degrade unfolding performance. In this paper, we introduce a new unbinned unfolding technique called the Reweighting Adversarial Network (RAN), which can be viewed as a generalization of the Moment Unfolding protocol to accommodate full phase-space unfolding. RANs address the bi-level optimization problem through a particle-level reweighting function steered by a Wasserstein critic at the detector level. RANs do not require overlapping support at the detector level, nor multiple iterations of training. We evaluate the performance of RANs with Gaussian data and jet substructure studies, including cases specifically designed to stress test the method under vanishing support overlap. We demonstrate that RANs outperform state-of-the-art methods in accuracy and have a lower computational overhead.

hep-ph↗

arXiv2026

Searching for Anomalies with Foundation Models

Foundation models have the potential to extend the discovery reach for anomaly detection searches. When studying the large OmniLearned foundation model on data from the CMS experiment, unexpected behavior was observed in a mass sideband. The purpose of this paper is to perform a full analysis, including a complete background estimate, on the phase space picked out by the large model. We find that the background estimation describes the data well in validation regions, but is unable to accurately model the signal region. We invite further scrutiny of these events and our methods.

hep-ex↗

arXiv2026

An AI-ready, Polarized Electron-Positron Collision Dataset

We present a modernized, AI-ready release of reconstructed data from the SLD experiment at the SLAC Linear Collider (SLC). The dataset comprises approximately 660{,}000 reconstructed events collected at $\sqrt{s}\approx 91.2$~GeV with a highly polarized electron beam from 1996--1998. The data have been translated from legacy formats into modern, widely-used file formats with the help of AI agents. The release also includes a corpus of newly digitized SLD internal documentation. We describe the contents of both components and provide physics validation demonstrations along with illustrations of their utility for physics and machine learning research in particle physics.

hep-ex↗

arXiv2026

OmniMol: Transferring Particle Physics Knowledge to Molecular Dynamics with Point-Edge Transformers

We present OmniMol, a state-of-the-art all-to-all transformer-based small molecule machine-learned interatomic potential (MLIP). OmniMol is built by adapting Omnilearned, a foundation model for particle jets found in high-energy physics (HEP) experiments such as at the Large Hadron Collider (LHC). Omnilearned is built with a Point-Edge-Transformer (PET) and pre-trained using a diverse set of one billion particle jets. It includes an interaction-matrix attention bias that injects pairwise sub-nuclear (HEP) or atomic (molecular-dynamics) physics directly into the transformer's attention logits, steering the network toward physically meaningful neighborhoods without sacrificing expressivity. We demonstrate OmniMol using the oMol dataset and find excellent performance even with relatively few examples for fine-tuning. Further, due to architectural transfer from Omnilearned, we demonstrate uniquely fast inference. This study lays the foundation for building interdisciplinary connections given datasets represented as collections of point clouds.

physics.chem-ph↗

arXiv2026

Unfolding with a Wasserstein Loss

Data unfolding -- the removal of noise or artifacts from measurements -- is a fundamental task across the experimental sciences. Of particular interest are applications in physics, where the dominant approach is Richardson-Lucy (RL) deconvolution. The classical RL approach aims to find denoised data that, once passed through the noise model, is as close as possible to the measured data in terms of Kullback-Leibler (KL) divergence. This requires that the support of the measured data overlaps with the output of the noise model, a hypothesis typically enforced by binning, which introduces numerical error. As a counterpoint, the present work studies an alternative formulation using a Wasserstein loss. We establish sharp conditions for existence and uniqueness of optimizers, answering open questions of Li, et al., regarding necessary conditions for uniqueness in the case of transport map noise models. We then develop a provably convergent generalized Sinkhorn algorithm to compute approximate optimizers. Our algorithm requires only empirical observations of the noise model and measured data and scales with the size of the data, rather than the ambient dimension. Numerical experiments on one- and two-dimensional problems inspired by jet mass unfolding in particle physics demonstrate that the optimal transport approach offers robust, accurate performance compared to classical RL deconvolution, particularly when binning artifacts are significant.

math.OC↗

arXiv2026

FAIR Universe Weak Lensing ML Uncertainty Challenge: Handling Uncertainties and Distribution Shifts for Precision Cosmology

Weak gravitational lensing, the correlated distortion of background galaxy shapes by foreground structures, is a powerful probe of the matter distribution in our universe and allows accurate constraints on the cosmological model. In recent years, high-order statistics and machine learning (ML) techniques have been applied to weak lensing data to extract the nonlinear information beyond traditional two-point analysis. However, these methods typically rely on cosmological simulations, which poses several challenges: simulations are computationally expensive, limiting most realistic setups to a low training data regime; inaccurate modeling of systematics in the simulations create distribution shifts that can bias cosmological parameter constraints; and varying simulation setups across studies make method comparison difficult. To address these difficulties, we present the first weak lensing benchmark dataset with several realistic systematics and launch the FAIR Universe Weak Lensing Machine Learning Uncertainty Challenge. The challenge focuses on measuring the fundamental properties of the universe from weak lensing data with limited training set and potential distribution shifts, while providing a standardized benchmark for rigorous comparison across methods. Organized in two phases, the challenge will bring together the physics and ML communities to advance the methodologies for handling systematic uncertainties, data efficiency, and distribution shifts in weak lensing analysis with ML, ultimately facilitating the deployment of ML approaches into upcoming weak lensing survey analysis.

astro-ph.CO↗

arXiv2026

Generalizable Foundation Models for Calorimetry via Mixtures-of-Experts and Parameter Efficient Fine Tuning

Modern particle physics experiments face an increasing demand for high-fidelity detector simulation as luminosities rise and computational requirements approach the limits of available resources. Deep generative models have emerged as promising surrogates for traditional Monte Carlo simulation, with recent advances drawing inspiration from large language models (LLM) and next-token prediction paradigms. In this work, we introduce a generalizable foundation model for calorimetry built on next-token transformer backbones, designed to support modular adaptation across materials, particle species, and detector configurations. Our approach combines Mixture-of-Experts pre-training with parameter-efficient fine-tuning strategies to enable controlled, additive model expansion without catastrophic forgetting. A pre-trained backbone is trained to generate electromagnetic showers across multiple absorber materials, while new materials are incorporated through the addition and tuning of lightweight expert modules. Extensions to new particle types are achieved via parameter-efficient fine-tuning and modular vocabularies, preserving the integrity of the base model. This design enables efficient, incremental knowledge integration as new simulation datasets become available, a critical requirement in realistic detector-development workflows. In addition, we demonstrate that next-token calorimeter models are computationally competitive with standard generative approaches under established LLM optimization procedures. These results establish next-token architectures as a viable path toward extensible, physics-aware foundation models for calorimetry and future high-energy physics experiments.

physics.ins-det↗

arXiv2026

Signal-Aware Contrastive Latent Spaces for Anomaly Detection

High-dimensional feature spaces in particle physics events pose a fundamental challenge to density-estimation-based weakly supervised anomaly detection, whose fidelity degrades rapidly with an increasing number of dimensions. We propose a signal-aware latent space construction using supervised contrastive learning trained on simulated Standard Model backgrounds and a diverse set of hypothesized Beyond the Standard Model (BSM) signals. The resulting latent space is low-dimensional, regularized, and signal-sensitive, enabling high-fidelity density estimation for downstream weakly supervised anomaly detection. We demonstrate the approach in a diphoton final state, testing sensitivity across a broad range of BSM scenarios including supersymmetry models, extended Higgs sectors, heavy neutral resonances, and flavor-changing neutral currents. For signals represented in the contrastive training data, the method can elevate discovery sensitivity from previously inaccessible levels to the discovery regime. Critically, the approach retains sensitivity to BSM models not present during training: interpolation and extrapolation to unseen signal topologies yield substantial improvements in expected significance compared to a background-only baseline. By bridging supervised latent space embedding with weakly supervised anomaly detection, this strategy offers a viable path toward anomaly detection in high-dimensional feature spaces at the LHC and beyond.

hep-ph↗

arXiv2026

OmniLearned: A Foundation Model Framework for All Tasks Involving Jet Physics

Foundation models use large datasets to build an effective representation of data that can be deployed on diverse downstream tasks. Previous research developed the OmniLearn foundation model for jet physics, using unique properties of particle physics, and showed that it could significantly advance discovery potential across collider experiments. This paper introduces a major upgrade, resulting in the OmniLearned framework. This framework has three new elements: (1) updates to the model architecture and training, (2) using over one billion jets used for training, and (3) providing well-documented software for accessing all datasets and models. We demonstrate OmniLearned with three representative tasks: top-quark jet tagging with the community Delphes-based benchmark dataset, b-tagging with ATLAS full simulation, and anomaly detection with CMS experimental data. In each case, OmniLearned is the state of the art, further expanding the discovery potential of past, current, and future collider experiments.

hep-ph↗

arXiv2026

Fair Universe Higgs Uncertainty Challenge

This competition in high-energy physics (HEP) and machine learning was the first to strongly emphasise uncertainties in $(H \rightarrow τ^+ τ^-)$ cross-section measurement. Participants were tasked with developing advanced analysis techniques capable of dealing with uncertainties in the input training data and providing credible confidence intervals. The accuracy of these intervals was evaluated using pseudo-experiments to assess correct coverage. The dataset is now published in Zenodo, and the winning submissions are fully documented.

hep-ph↗

arXiv2026

EveNet: A Foundation Model for Particle Collision Data Analysis

While deep learning is transforming data analysis in high-energy physics, computational challenges limit its potential. We address these challenges in the context of collider physics by introducing EveNet, an event-level foundation model pretrained on 500 million simulated collision events using a hybrid objective of self-supervised learning and physics-informed supervision. By leveraging a shared particle-cloud representation, EveNet outperforms state-of-the-art baselines across diverse tasks, including searches for heavy resonances and exotic Higgs decays, and demonstrates exceptional data efficiency in low-statistics regimes. Crucially, we validate the transferability of the model to experimental data by rediscovering the $Υ$ meson in CMS Open Data and show its capacity for precision physics through the robust extraction of quantum correlation observables stable against systematic uncertainties. These results indicate that EveNet can successfully encode the fundamental physical structure of particle interactions, which offers a unified and resource-efficient framework to accelerate discovery at current and future colliders.

hep-ex↗

arXiv2025

CaloChallenge 2022: A Community Challenge for Fast Calorimeter Simulation

We present the results of the "Fast Calorimeter Simulation Challenge 2022" - the CaloChallenge. We study state-of-the-art generative models on four calorimeter shower datasets of increasing dimensionality, ranging from a few hundred voxels to a few tens of thousand voxels. The 31 individual submissions span a wide range of current popular generative architectures, including Variational AutoEncoders (VAEs), Generative Adversarial Networks (GANs), Normalizing Flows, Diffusion models, and models based on Conditional Flow Matching. We compare all submissions in terms of quality of generated calorimeter showers, as well as shower generation time and model size. To assess the quality we use a broad range of different metrics including differences in 1-dimensional histograms of observables, KPD/FPD scores, AUCs of binary classifiers, and the log-posterior of a multiclass classifier. The results of the CaloChallenge provide the most complete and comprehensive survey of cutting-edge approaches to calorimeter fast simulation to date. In addition, our work provides a uniquely detailed perspective on the important problem of how to evaluate generative models. As such, the results presented here should be applicable for other domains that use generative AI and require fast and faithful generation of samples in a large phase space.

physics.ins-det↗

arXiv2025

SEAL - A Symmetry EncourAging Loss for High Energy Physics

Physical symmetries provide a strong inductive bias for constructing functions to analyze data. In particular, this bias may improve robustness, data efficiency, and interpretability of machine learning models. However, building machine learning models that explicitly respect symmetries can be difficult due to the dedicated components required. Moreover, real-world experiments may not exactly respect fundamental symmetries at the level of finite granularities and energy thresholds. In this work, we explore an alternative approach to create symmetry-aware machine learning models. We introduce soft constraints that allow the model to decide the importance of added symmetries during the learning process instead of enforcing exact symmetries. We investigate two complementary approaches, one that penalizes the model based on specific transformations of the inputs and one inspired by group theory and infinitesimal transformations of the inputs. Using top quark jet tagging and Lorentz equivariance as examples, we observe that the addition of the soft constraints leads to more robust performance while requiring negligible changes to current state-of-the-art models.

hep-ph↗

arXiv2025

Unbinned measurement of thrust in $e^+e^-$ collisions at $\sqrt{s}$ = 91.2 GeV with ALEPH archived data

The strong coupling constant ($α_{S}$) is a fundamental parameter of quantum chromodynamics (QCD), the theory of the strong force. Some of the earliest precise constraints on $α_{S}$ came from measurements of event shape observables, such as thrust ($T$), using hadronic $Z$ boson decays produced in $e^+e^-$ collisions. However, recent work has revealed discrepancies between event-shape-based extractions of $α_{S}$ and values determined using other experimental methods. This work reexamines archived $e^+e^-$ data collected at a collision energy of $\sqrt{s}=91.2$ GeV by the ALEPH detector at the Large Electron-Positron Collider. Modern machine learning techniques are used to correct for detector effects in an unbinned manner, allowing the $T$ distribution to be measured with higher granularity than previous ALEPH measurements. The new measurement reveals a small but systematic shift towards larger values of $τ=1-T$, and the potential implications of this shift for $α_{S}$ extractions are illustrated by comparing to state-of-the-art theoretical calculations. In addition, the region of $-6<\logτ<-2$, where poorly-understood non-perturbative effects are large, is compared to modern parton shower Monte Carlo simulations. This measurement provides unique new inputs for $α_{S}$ extractions and also improves constraints on phenomenological models of QCD dynamics such as parton fragmentation and hadronization.

hep-ex↗

arXiv2025

Unbinned Inference with Correlated Events

Modern machine learning has enabled parameter inference from event-level data without the need to first summarize all events with a histogram. All of these unbinned inference methods make use of the fact that the events are statistically independent so that the log likelihood is a sum over events. However, this assumption is not valid for unbinned inference on unfolded data, where the deconvolution process induces a correlation between events. We explore the impact of event correlations on downstream inference tasks in the context of the OmniFold unbinned unfolding method. We find that uncertainties may be significantly underestimated when event correlations are excluded from uncertainty quantification.

physics.data-an↗