Neural refinement of sample weights

Monte Carlo simulations are an essential tool in particle physics data analysis. Events are typically generated alongside weights that redistribute the cross section of the simulated process across the phase space. These weights can be negative, and several methods have been developed to eliminate or mitigate the negative values. All of these methods share the common strategy of approximating the average weight as a function of phase space. We introduce an alternative approach, which, instead of reweighting to the average, refines the initial weights with a scaling transformation, utilizing a phase space-dependent factor. Since this new refinement method does not need to model the full weight distribution, it can be more accurate. High-dimensional and unbinned phase space is processed using neural networks for the refinement method. In addition to the refinement method, we introduce a new resampling protocol, which can be used in conjunction with any weight transformation to not only preserve the average weight but also the statistical uncertainties of the initial distribution. Using both realistic and synthetic examples, we show that the new neural refinement method is able to match or exceed the accuracy of similar weight transformations and that the new resampling protocol is simpler in implementation than previous methods while exhibiting equivalent statistical properties.

Authors

Institutions

Publication Details

Journal
Physical review. D/Physical review. D.
Published
2025-11-07
DOI
https://doi.org/10.1103/yx16-h7n9
Citations
1
Primary Topic
Particle physics theoretical and experimental studies
Type
article
Field-Weighted Citation Impact
1.87
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Neural refinement of sample weights

Benjamin Nachman, D. Noll
1 citations
Physical review. D/Physical review. D.
Particle physics theoretical and experimental studies
1.87
article

Neural refinement of sample weights

Benjamin Nachman, D. Noll
article en
1 citations

Abstract

Monte Carlo simulations are an essential tool in particle physics data analysis. Events are typically generated alongside weights that redistribute the cross section of the simulated process across the phase space. These weights can be negative, and several methods have been developed to eliminate or mitigate the negative values. All of these methods share the common strategy of approximating the average weight as a function of phase space. We introduce an alternative approach, which, instead of reweighting to the average, refines the initial weights with a scaling transformation, utilizing a phase space-dependent factor. Since this new refinement method does not need to model the full weight distribution, it can be more accurate. High-dimensional and unbinned phase space is processed using neural networks for the refinement method. In addition to the refinement method, we introduce a new resampling protocol, which can be used in conjunction with any weight transformation to not only preserve the average weight but also the statistical uncertainties of the initial distribution. Using both realistic and synthetic examples, we show that the new neural refinement method is able to match or exceed the accuracy of similar weight transformations and that the new resampling protocol is simpler in implementation than previous methods while exhibiting equivalent statistical properties.

Physical review. D/Physical review. D.Vol. 112(9)
Lawrence Berkeley National Laboratory (US), SLAC National Accelerator Laboratory (US), Stanford University (US)
Openalex Percentile: Top 11%
Particle physics theoretical and experimental studies
1.87
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.