arXiv subjects

Anja Butter

Publications and source records attributed to Anja Butter.

At least 19 recordsLinked to original sources

arXiv2026

Know What You Don't Flow

Calibrated learned uncertainties are a key requirement also for generative neural networks in LHC physics. For a toy model with an explicit likelihood we show how a heteroscedastic and a Bayesian normalizing flow learn the systematic and statistical uncertainties on the underlying phase space density. Without an explicit likelihood we train the heteroscedastic loss on a classifier-reweighted approximate generative network. We illustrate our comprehensive approach for top pair events and show how a conditional heteroscedastic flow propagates calibrated uncertainties to all phase space directions.

hep-ph↗

arXiv2026

Local Conformal Predictions for Calibrated Surrogates

Neural network surrogates for LHC scattering amplitudes require trustworthy uncertainty estimates, a challenging task given the non-Gaussian systematics. We target it using conformal prediction, a distribution-free post-processing to complement trained surrogates with calibrated uncertainties. We find that standard conformal predictions struggle to provide locally calibrated uncertainties. This leads us to introduce FALCON, a novel conformal prediction method that learns locally calibrated confidence intervals. Our simple examples illustrate the power of distribution-free uncertainty quantification for ultra-fast event generation at the LHC.

hep-ph↗

arXiv2026

Scaling laws for amplitude surrogates

Scaling laws describing the dependence of neural network performance on the amount of training data, the spent compute, and the network size have emerged across a huge variety of machine learning task and datasets. In this work, we systematically investigate these scaling laws in the context of amplitude surrogates for particle physics. We show that the scaling coefficients are connected to the number of external particles of the process. Our results demonstrate that scaling laws are a useful tool to achieve desired precision targets.

hep-ph↗

arXiv2025

Generative Unfolding of Jets and Their Substructure

Unfolding, for example of distortions imparted by detectors, provides suitable and publishable representations of LHC data. Many methods for unbinned and high-dimensional unfolding using machine learning have been proposed, but no generative method scales to the several hundred dimensions necessary to fully characterize LHC collisions. This paper proposes a 3-stage generative unfolding framework that is capable of unfolding several hundred dimensions. It is effective to unfold the jet-level kinematics as well as the full substructure of light-flavor jets and of top jets, and is the first generative unfolding study to achieve high precision on high-dimensional jet substructure.

hep-ph↗

arXiv2025

Iterative HOMER with uncertainties

We present iHOMER, an iterative version of the HOMER method to extract Lund fragmentation functions from experimental data. Through iterations, we address the information gap between latent and observable phase spaces and systematically remove bias. To quantify uncertainties on the inferred weights, we use a combination of Bayesian neural networks and uncertainty-aware regression. We find that the combination of iterations and uncertainty quantification produces well-calibrated weights that accurately reproduce the data distribution. A parametric closure test shows that the iteratively learned fragmentation function is compatible with the true fragmentation function.

hep-ph↗

arXiv2025

Analysis-ready Generative Unfolding

Machine Learning (ML)-based unfolding methods have enabled high-dimensional and unbinned differential cross section measurements. While a suite of such methods has been proposed, most focus exclusively on the challenge of statistically removing resolution effects. In practice, unfolding methods must also account for impurities and finite acceptance and efficiency effects. In this paper, we extend a class of unfolding methods based on generative ML to include the full suite of effects relevant for cross section measurements. Our new methods include fully generative solutions as well as generative-discriminative hybrid approaches (GenFoldG and GenFoldC). We demonstrate these new techniques in both Gaussian and simulated LHC examples. Overall, we find that both methods are able to accommodate all effects, thus adding a complementary and analysis-ready method to the unfolding toolkit.

hep-ph↗

arXiv2025

Simulation-Prior Independent Neural Unfolding Procedure

Machine learning allows unfolding high-dimensional spaces without binning at the LHC. The new SPINUP method extracts the unfolded distribution based on a neural network encoding the forward mapping, making it independent of the prior from the simulated training data. It is made efficient through neural importance sampling, and ensembling can be used to estimate the effect of information loss in the forward process. We showcase SPINUP for unfolding detector effects on jet substructure observables and for unfolding to parton level of associated Higgs and single-top production.

hep-ph↗

arXiv2024

Extrapolating Jet Radiation with Autoregressive Transformers

Generative networks are an exciting tool for fast LHC event fixed number of particles. Autoregressive transformers allow us to generate events containing variable numbers of particles, very much in line with the physics of QCD jet radiation, and offer the possibility to generalize to higher multiplicities. We show how transformers can learn a factorized likelihood for jet radiation and extrapolate in terms of the number of generated jets. For this extrapolation, bootstrapping training data and training with modifications of the likelihood loss can be used.

hep-ph↗

arXiv2024

Generative Unfolding with Distribution Mapping

Machine learning enables unbinned, highly-differential cross section measurements. A recent idea uses generative models to morph a starting simulation into the unfolded data. We show how to extend two morphing techniques, Schr\"odinger Bridges and Direct Diffusion, in order to ensure that the models learn the correct conditional probabilities. This brings distribution mapping to a similar level of accuracy as the state-of-the-art conditional generative unfolding methods. Numerical results are presented with a standard benchmark dataset of single jet substructure as well as for a new dataset describing a 22-dimensional phase space of Z + 2-jets.

hep-ph↗

arXiv2024

The Landscape of Unfolding with Machine Learning

Recent innovations from machine learning allow for data unfolding, without binning and including correlations across many dimensions. We describe a set of known, upgraded, and new methods for ML-based unfolding. The performance of these approaches are evaluated on the same two datasets. We find that all techniques are capable of accurately reproducing the particle-level spectra across complex observables. Given that these approaches are conceptually diverse, they offer an exciting toolkit for a new class of measurements that can probe the Standard Model with an unprecedented level of detail and may enable sensitivity to new phenomena.

hep-ph↗

arXiv2023

Kicking it Off(-shell) with Direct Diffusion

Off-shell effects in large LHC backgrounds are crucial for precision predictions and, at the same time, challenging to simulate. We present a novel method to transform high-dimensional distributions based on a diffusion neural network and use it to generate a process with off-shell kinematics from the much simpler on-shell one. Applied to a toy example of top pair production at LO we show how our method generates off-shell configurations fast and precisely, while reproducing even challenging on-shell features.

hep-ph↗

arXiv2023

Event-by-event Comparison between Machine-Learning- and Transfer-Matrix-based Unfolding Methods

The unfolding of detector effects is a key aspect of comparing experimental data with theoretical predictions. In recent years, different Machine-Learning methods have been developed to provide novel features, e.g. high dimensionality or a probabilistic single-event unfolding based on generative neural networks. Traditionally, many analyses unfold detector effects using transfer-matrix--based algorithms, which are well established in low-dimensional unfolding. They yield an unfolded distribution of the total spectrum, together with its covariance matrix. This paper proposes a method to obtain probabilistic single-event unfolded distributions, together with their uncertainties and correlations, for the transfer-matrix--based unfolding. The algorithm is first validated on a toy model and then applied to pseudo-data for the $pp\rightarrow Z\gamma \gamma$ process. In both examples the performance is compared to the Machine-Learning--based single-event unfolding using an iterative approach with conditional invertible neural networks (IcINN).

physics.data-an↗

arXiv2023

Precision-Machine Learning for the Matrix Element Method

The matrix element method is the LHC inference method of choice for limited statistics. We present a dedicated machine learning framework, based on efficient phase-space integration, a learned acceptance and transfer function. It is based on a choice of INN and diffusion networks, and a transformer to solve jet combinatorics. We showcase this setup for the CP-phase of the top Yukawa coupling in associated Higgs and single-top production.

hep-ph↗

arXiv2023

Jet Diffusion versus JetGPT -- Modern Networks for the LHC

We introduce two diffusion models and an autoregressive transformer for LHC physics simulations. Bayesian versions allow us to control the networks and capture training uncertainties. After illustrating their different density estimation methods for simple toy models, we discuss their advantages for Z plus jets event generation. While diffusion networks excel through their precision, the transformer scales best with the phase space dimensionality. Given the different training and evaluation speed, we expect LHC physics to benefit from dedicated use cases for normalizing flows, diffusion models, and autoregressive transformers.

hep-ph↗

arXiv2023

Searching for dark matter subhalos in the Fermi-LAT catalog with Bayesian neural networks

About a third of the $\gamma$-ray sources detected by the Fermi Large Area Telescope (Fermi-LAT) remain unidentified, and some of these could be exotic objects such as dark matter subhalos. We present a search for these sources using Bayesian neural network classification methods applied to the latest 4FGL-DR3 Fermi-LAT catalog. We first simulate the $\gamma$-ray properties of dark matter subhalos using models from N-body simulations and semi-analytical approaches to the subhalo distribution. We then assess the detectability of this sample in the 4FGL-DR3 catalog using the Fermi-LAT analysis tools. We train our Bayesian neural network to identify candidate dark matter subhalos among the unidentified sources in the 4FGL-DR3 catalog. Our results allow us to derive conservative bounds on the dark matter annihilation cross section by excluding unidentified sources classified as astrophysical-like by our networks. We estimate the number of candidate dark matter subhalos for different dark matter masses and provide a publicly available list for further investigation. Our bounds on the dark matter annihilation cross section are comparable to previous results and become particularly competitive at high dark matter masses.

astro-ph.HE↗

arXiv2022

Performance versus Resilience in Modern Quark-Gluon Tagging

Discriminating quark-like from gluon-like jets is, in many ways, a key challenge for many LHC analyses. First, we use a known difference in Pythia and Herwig simulations to show how decorrelated taggers would break down when the most distinctive feature is aligned with theory uncertainties. We propose conditional training on interpolated samples, combined with a controlled Bayesian network, as a more resilient framework. The interpolation parameter can be used to optimize the training evaluated on a calibration dataset, and to test the stability of this optimization. The interpolated training might also be useful to track generalization errors when training networks on simulation.

hep-ph↗

arXiv2022

An unfolding method based on conditional Invertible Neural Networks (cINN) using iterative training

The unfolding of detector effects is crucial for the comparison of data to theory predictions. While traditional methods are limited to representing the data in a low number of dimensions, machine learning has enabled new unfolding techniques while retaining the full dimensionality. Generative networks like invertible neural networks~(INN) enable a probabilistic unfolding, which map individual events to their corresponding unfolded probability distribution. The accuracy of such methods is however limited by how well simulated training samples model the actual data that is unfolded. We introduce the iterative conditional INN~(IcINN) for unfolding that adjusts for deviations between simulated training samples and data. The IcINN unfolding is first validated on toy data and then applied to pseudo-data for the $pp \to Z \gamma \gamma$ process.

hep-ph↗

arXiv2022

MadNIS -- Neural Multi-Channel Importance Sampling

Theory predictions for the LHC require precise numerical phase-space integration and generation of unweighted events. We combine machine-learned multi-channel weights with a normalizing flow for importance sampling, to improve classical methods for numerical integration. We develop an efficient bi-directional setup based on an invertible network, combining online and buffered training for potentially expensive integrands. We illustrate our method for the Drell-Yan process with an additional narrow resonance.

hep-ph↗