arXiv subjects

Benjamin Nachman

Publications and source records attributed to Benjamin Nachman.

At least 19 recordsLinked to original sources

arXiv2026

Cross-Detector Transfer Learning with Parnassus: From ALEPH to SLD

Parnassus is a fast detector-simulation and reconstruction framework that maps truth-level particles directly to reconstructed particles. In this work, we investigate cross-detector transfer learning by adapting a Parnassus model for the ALEPH detector to the SLD detector. ALEPH and SLD have similar detector responses, as they were both targeting hadronic $Z$-pole $e^+e^-$ events, while differing substantially in the underlying detector technology, reconstruction, and archived data representation. We initialize the SLD particle model with weights learned on ALEPH, fine-tune it on SLD, and compare it with the same architecture trained directly on SLD. The ALEPH-initialized model gives substantially improved particle- and jet-level agreement with the SLD reference, including a factor of 5.2 improvement in the charged-particle angular response and an improvement in the jet angular resolution from $1.73$ to $1.15$ times the SLD reference. The results show that detector-response information learned on ALEPH can be reused when modeling SLD and motivate reusable pretrained Parnassus models for legacy $e^+e^-$ detectors, which is especially critical for experiments without access to the original software pipeline. With this paper, we also release an AI-ready version of simulated SLD $e^+e^-$ events.

physics.ins-det↗

arXiv2026

OmniCosmos: Transferring Particle Physics Knowledge Across the Cosmos

Foundation models build an effective representations of data that can be deployed on diverse downstream tasks. Previous research developed the OmniLearned foundation model for collider physics and showed that it could significantly advance discovery potential across collider experiments. In this paper we go beyond collider physics and show that Foundation Models trained on collider data can help improve the prediction of cosmological parameters and to predict halo and galaxy velocities in different datasets from CosmoBench. This is the first time a collider physics model is shown to generalize across scientific fields.

astro-ph.CO↗

arXiv2026

Generation of Imaging Air Cherenkov Telescope images using Diffusion Models

Substantial amounts of air-shower simulations are needed to derive the instrument response for analyzing Imaging Air Cherenkov Telescope (IACT) data. This process is both computationally intensive and requires repetition under varying observation conditions, due to detector aging, changes in the atmosphere, or the instrument hardware. Generative models offer an efficient alternative, significantly accelerating simulations while compactly storing extensive simulation libraries, and providing a differentiable surrogate model of the instrument. However, their applicability has so far been limited in gamma-ray astronomy, particularly for modeling hadronic showers that dominate the background and exhibit significant intrinsic fluctuations that are challenging to model. In this study, we present the first application of score-based diffusion models to generate monoscopic $γ$-ray and proton shower images with nearly 2,000 pixels and benchmark the performance against Wasserstein GANs using H.E.S.S. simulations. We examine quality using both low-level parameters and well-established shower-shape observables, and take the first step towards analysis readiness by investigating $γ$-hadron separation. While GAN-based approaches can reproduce $γ$-ray showers with high fidelity, they fail to generate proton events of comparable quality, leading to a measurable degradation in analysis performance. In contrast, score-based diffusion modles achieve significantly superior quality for $γ$-ray and proton showers, accurately reproducing high-level correlations and generating events that are statistically indistinguishable from simulations at the analysis level. These results establish diffusion-based models as the first analysis-ready surrogate model of a single IACT, opening new prospects for fast instrument response generation, detector optimization, and connected downstream tasks.

astro-ph.IM↗

arXiv2026

Cross-Domain Transfer with Particle Physics Foundation Models: From Jets to Neutrino Interactions

Future AI-based studies in particle physics will likely start from a foundation model to accelerate training and enhance sensitivity. As a step toward a general-purpose foundation model for particle physics, we investigate whether the OmniLearned and ParticleViT foundation models pretrained on diverse high-$Q^2$ simulated and real $pp$ and $ep$ collisions retain useful knowledge to a few-GeV fixed-target neutrino experiment. We process MINERvA neutrino--nucleus scattering events and evaluate pretrained models on two types of tasks: regression of available energy and binary classification of charged-current pion final states ($\mathrm{CC1π^{\pm}}$, $\mathrm{CCNπ^{\pm}}$, and $\mathrm{CC1π^{0}}$). Pretrained OmniLearned and ParticleViT models outperform similarly sized models trained from scratch at the same compute budget, with the largest gains for OmniLearned on regression and for ParticleViT on classification. When the same transformer architecture is instead initialized from unrelated text pretraining (BERT), this advantage appears only marginally for classification in terms of compute efficiency and not in any way for regression. These results suggest that particle-level foundation models acquire inductive biases that generalize across large differences in energy scale, detector technology, and underlying physics processes, pointing toward detector-agnostic inference in particle physics.

hep-ex↗

arXiv2026

Predict before you train: Scaling Laws for particle physics foundation models

The largest machine learning models in particle physics are also the most expensive to train, yet the return on scaling a given architecture cannot be estimated before that compute is spent. Scaling laws have been fit for jets, but none has yet been shown to predict the performance of models it was not fit on. We show that, for a generic transformer pretrained on collider jets, it can be forecast. Fitting a joint model-and-data scaling law on small models alone, spanning three orders of magnitude of training compute, we predict the loss of models trained afterward with more than one hundred times more compute to within one percent. We then connect the forecast to downstream physics performance: across two standard tagging benchmarks, lower pretraining loss yields systematically lower fine-tuning loss and higher background rejection after fine-tuning. Within this model family and these tasks, a compute budget can therefore be translated into expected physics performance before any large model is trained. The final frontier model is consistent with the published numbers for current state-of-the-art physics-aware foundation models trained on the same corpus, on accuracy, AUC, and quark/gluon rejection, with a residual edge for the physics-aware model only in the high-purity tail of top tagging. We release five pretrained models spanning multiple sizes, together with the complete training recipe and code.

hep-ex↗

arXiv2026

Differentiable Parametric Simulation and Reconstruction Models in Parnassus

Parnassus is a framework for fast detector simulation and reconstruction, directly mapping truth-level particles onto reconstructed objects. Such models can be built from deep generative networks trained on paired samples, which are fit automatically to a target detector, or from parametric prescriptions of the kind used by Delphes, which are constructed by hand. We remove this asymmetry by making the parametric models fully differentiable so that their parameters can be fit to a target sample by gradient descent. We demonstrate closure by fitting a parametric model to samples from a known configuration of itself, recovering the generating parameters and characterizing the degeneracies among them, and we present a first fit to CMS full simulation. The resulting models are interpretable, inexpensive, and run in the standard Parnassus pipeline which is fully Python based and GPU enabled.

hep-ex↗

arXiv2026

An AI-based Detector Simulation and Reconstruction Model for the ALEPH Experiment at LEP

We present the application of Parnassus, a generative model for full detector simulation and reconstruction, to the ALEPH detector at the Large Electron-Positron Collider (LEP). Training on simulated $e^+e^-$ to Z to qqbar events processed through the ALEPH detector simulation and reconstruction, we demonstrate that Parnassus faithfully reproduces the detector response at the event, jet, and particle levels, with substantially better agreement than the Delphes fast simulation. The clean $e^+e^-$ environment, free of pileup and characterized by simple event topologies, provides a well-controlled benchmark for evaluating the generative model's fidelity. Our results demonstrate that modern neural-network-based generative simulation approaches, developed primarily for LHC experiments, generalize naturally to historical collider experiments with distinct detector geometries and physics environments. This work shows that Parnassus can be applied beyond the LHC context and serves as an important tool for legacy data analysis where archival software tools are challenging to resurrect.

physics.ins-det↗

arXiv2026

Pre-Training for Simulation-Based Science: A Study on Jet Foundation Model Training Objectives

Foundation models (FMs) trained on large datasets and fine-tuned on downstream tasks have emerged as a powerful paradigm in AI for science. Industrial FMs are typically trained using self-supervision with masking due to the lack of labels. In many scientific domains, accurate simulations are plentiful and facilitate large, labeled datasets. This opens up new possibilities for pre-training. We present a systematic comparison of pre-training methods using the OmniLearned High Energy Physics FM framework. We test supervised classification, flow-matching generation, and self-supervised masked particle modeling. All models are pre-trained on the JetClass dataset and fine-tuned on two representative downstream tasks, top jet classification and JetNet conditional generation. Among other observations, for classification tasks, we find that pure classifier pre-training is optimal when downstream labels and model capacity are plentiful, but combining it with self-supervised masked particle modeling (MPM) is uniquely powerful in the low-finetuning label regime. Flow matching-based generative pre-training seems to provide little benefit for downstream classification, and interestingly, for downstream generation, we find that flow matching must be in the pre-training objective to see a significant finetuning advantage, hinting at the orthogonality of classification and generation tasks. That is, for a model to transfer to both generative and classification downstream tasks, it must be pre-trained on both. This study provides a template for controlled scaling analysis of pre-training objectives for foundation models in simulation-based sciences.

hep-ph↗

arXiv2026

The Living Guide of Machine Learning for Particle Physics

We started the Living Review of Machine Learning for Particle Physics (HEP-ML Living Review) in 2020 as a community-maintained, near-comprehensive bibliography of machine learning in particle physics. The field was then growing faster than any single researcher could follow, finding the relevant papers was hard, and a structured, continuously updated reference paid off immediately. Since then the literature has grown by more than an order of magnitude, the methods reach far beyond the classification and generation tasks of the early years, and the community has built its own ecosystem of topic-specific reviews, benchmark papers, and software frameworks. The original model no longer serves this field well, and we can no longer sustain it. We therefore change direction. We freeze the Living Review as an archival reference covering the literature up to 1 June 2026, where it remains a stable record of the first phase of HEP-ML. A new resource, the HEP-ML Living Guide, replaces it. It does not list everything. It curates, it annotates, and it points readers to foundational and representative work, so that researchers can find their way into a mature and rapidly diversifying field. In this article we explain why we make this change and how the new resource works.

hep-ph↗

arXiv2026

Explicit or Implicit? Encoding Physics at the Precision Frontier

High-performance machine learning tools in particle physics rest on two complementary directions: encoding symmetries explicitly in the architecture, and implicitly learning the structure of the data through large-scale (pre-) training. We compare the performance of the representative L-GATr and OmniLearn models on three especially challenging tasks: reweighting-based unfolding, likelihood-ratio estimation, and weakly supervised anomaly detection. Across all benchmarks, both methods achieve comparable performance given the statistical precision of the finetuning datasets, suggesting that the significant efficiency gains from encoding known particle physics structures are largely method-independent.

hep-ph↗

arXiv2026

The Well-Tempered Likelihood: Honest Confidence Intervals for Misspecified Models

Likelihood-based inference in particle physics, and in the physical sciences more broadly, relies on the assumption that the model accurately describes the data. When the model is misspecified, though, standard confidence intervals shrink to zero width with increasing data, producing overconfident and potentially misleading constraints. We propose the well-tempered likelihood, which divides the likelihood-ratio test statistic by a goodness-of-fit (GOF) statistic evaluated at the best-fit point. Under correct specification, the GOF is $\mathcal{O}(1)$ and standard inference is recovered. Under misspecification, both the likelihood and the GOF scale as $\mathcal{O}(N)$ for $N$ data points, so their ratio remains $\mathcal{O}(1)$ and the resulting well-tempered confidence interval self-limits at a floor determined by the model's inadequacy, essentially reducing the effective sample size. In other words, \textit{all models are correct, as long as your dataset is small enough}. We present binned and unbinned formulations of the well-tempered likelihood---the latter based on a classifier two-sample test---and demonstrate our method on a Gaussian example and on a measurement of the strong coupling constant using synthetic electron-positron collisions.

stat.ME↗

arXiv2026

Towards anomaly detection searches for new physics signatures including Higgs bosons with weakly supervised machine learning

The Higgs boson, with its universal coupling to mass, provides a broadly applicable portal to sectors beyond the Standard Model and is therefore a natural anchor for anomaly detection (AD) at collider experiments. The Higgs And X Anomaly Detection (HAXAD) strategy offers a principled approach to searching for such anomalies occurring in association with a Higgs boson by combining machine-learning-based feature embedding, background estimation, and weakly supervised classification. This work extends the previous HAXAD approach towards the level of maturity required for application to recorded collider data. A major addition is the introduction and comparison of two new embedding strategies, which in turn shape the background estimation and classification. In addition, a new inference framework is developed, yielding signal-agnostic and signal-specific cross section limits and thereby completing the statistical machinery needed for future AD analyses built on HAXAD. The set of investigated signal models is also significantly expanded, allowing for the evaluation of sensitivity on a much broader phase space. Improvements to the method increase signal sensitivity with respect to the original method, and when benchmarked against an example cut-based search on the same final state, HAXAD matches or exceeds the best individual cut-based limits for a wide variety of considered signal models. These developments strengthen the case for HAXAD as a viable and compelling AD-based search strategy with novel discovery potential at colliders.

hep-ex↗

arXiv2026

A Scientific Human-Agent Reproduction Pipeline

Reproducing scientific analyses is essential for preserving knowledge, building extensible codebases, and deepening researcher understanding - yet the effort often outweighs its academic recognition. We argue that the reproduction of scientific data analyses is fundamentally a translation task: converting human-readable knowledge (papers, documentation) into machine-readable analysis code. This makes it uniquely well-suited for AI agents. We present SHARP (Scientific Human-Agent Reproduction Pipeline), a structured framework for reproducing scientific analyses through human-agent collaboration. SHARP decomposes a reproduction task into discrete steps, which an AI agent executes autonomously using specialized subagents for code generation, testing, and quality assurance. At defined checkpoints, the researcher reviews progress, provides feedback, and steers the analysis - keeping the human firmly in control of scientific judgment while the agent handles implementation. We demonstrate SHARP by reproducing a jet classification task in particle physics from a published paper. We evaluate the reproduction along three axes: analysis performance against the original results, code quality and faithfulness, and the nature of the human-agent conversation. The latter is evaluated with a novel framework for characterizing human-agent interactions. Our work highlights a practical model for AI-assisted scientific reproduction where the researcher's role shifts from writing code to understanding, evaluating, and directing - elevating human understanding rather than replacing it.

hep-ph↗

arXiv2026

Towards Engineering Scaling Laws with Pretraining Data Composition

Neural scaling laws describe how model performance improves as a power law in compute, model size, and dataset size. While well-established for large language models, these relationships are emerging for large models in particle physics. As with language, empirical studies show that the performance scales as a power law. However, unlike natural language or image domains, fundamental physics has high-fidelity simulators that produce synthetic data cheaply. This favors scaling regimes where additional data is cheaper than additional parameters, and allows the pretraining dataset itself to be engineered to influence the scaling. For the task of classifying hadronic jets produced in collisions of high-energy particle beams, we show that the scaling behavior can be engineered towards requiring more data rather than larger models by inclusion of pretraining data which is more diverse and better aligned with the downstream classification task.

hep-ex↗

arXiv2026

Optimal Transport Event Representation for Anomaly Detection

We introduce optimal transport (OT) as a physics-based intermediate event representation for weakly supervised anomaly detection. With only $0.5\%$ injection of resonant signals in the LHC Olympics benchmark datasets, the OT-augmented feature set achieves nearly twice the significance improvement of the standard high-level observables using an idealized setup, while end-to-end deep learning on low-level four-momenta is less effective in this low-signal regime. The observed gains persist across signal types and classifiers considered in this study, suggesting that structured, physics-informed representations can provide a useful complement to existing approaches for anomaly detection.

hep-ph↗

arXiv2026

Machine Learning-based Unfolding for Cross Section Measurements in the Presence of Nuisance Parameters

Statistically correcting measured cross sections for detector effects is an important step across many applications. In particle physics, this inverse problem is known as unfolding. In cases with complex instruments, the distortions they introduce are often known only implicitly through simulations of the detector. Modern machine learning has enabled efficient simulation-based approaches for unfolding high-dimensional data. Among these, one of the first methods successfully deployed on experimental data is the OmniFold algorithm, a classifier-based Expectation-Maximization procedure. In practice, however, the forward model is only approximately specified, and the corresponding uncertainty is encoded through nuisance parameters. Building on the well-studied OmniFold algorithm, we show how to extend machine learning-based unfolding to incorporate nuisance parameters. Our new algorithm, called Profile OmniFold, is demonstrated using a Gaussian example as well as a particle physics case study using simulated data from the CMS Experiment at the Large Hadron Collider.

stat.AP↗

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↗