pith. sign in

arxiv: 2512.07074 · v3 · pith:DN7DFTR6new · submitted 2025-12-08 · 📊 stat.AP · hep-ex· hep-ph· physics.data-an· stat.ML

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

classification 📊 stat.AP hep-exhep-phphysics.data-anstat.ML
keywords unfoldingalgorithmdatamachinenuisanceomnifoldparameterscross
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Reweighting Adversarial Networks for Unbinned Unfolding

    hep-ph 2026-06 unverdicted novelty 7.0

    RANs generalize moment unfolding to full phase-space unbinned unfolding via detector-level Wasserstein critics without requiring support overlap or multiple iterations.