Search arXiv⌕ Search

arXiv · 2610.09231

Reliable Uncertainty Estimation for Machine-Learned Multigroup Cross Sections Without Retraining

Abstract

Uncertainty quantification in machine learning models is essential for nuclear energy applications. While machine learning models can make both uncertainty and point predictions, these models are often significantly more difficult to train jointly than models that make point predictions alone. Split conformal prediction is a family of methods for computing distribution-free prediction intervals by calculating nonconformity scores corresponding to a target quantile in a calibration dataset. Although conformal prediction only guarantees marginal coverage, normalizing nonconformity scores enables predictive interval widths to be calculated on a per-sample basis, providing an approximation to conditional coverage. In this work, we connect uncertainty predicting neural networks to pre-trained networks that estimate shielding factors in multigroup neutron cross sections. We train the uncertainty models on the same OpenMC data used by the pre-trained models, whose weights and biases remain fixed. The outputs of the uncertainty models are the standard deviations of the residual, separated into contributions from the model and tally uncertainty. Their corresponding variances are combined in quadrature to provide a normalizing factor for conformal prediction, providing interval widths that are adaptive on a per-sample basis. Baselines for comparison are established using Mondrian conformal prediction, and by using the ground truth OpenMC uncertainties as normalizers in the conformal framework. We use predicted uncertainty interval widths and the severity of predictions that overshoot the interval widths as bases for comparing our normalizer with the baselines. We find that our method dramatically reduces both interval widths and the degree to which predictions fall outside these widths.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joshua Nichols, Andrew Osborne, Valerio Mascolino. 2026-10-06. Reliable Uncertainty Estimation for Machine-Learned Multigroup Cross Sections Without Retraining. https://arxiv.org/abs/2610.09231

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Convergence of Roberts flow dynamos in Eulerian and Lagrangian codes

Standard benchmark tests for numerical magnetohydrodynamics codes focus on one- and two-dimensional problems that ignore the possibility of dynamos, i.e., an exponential instability converting kinetic energy into magnetic energy. They also tend to ignore magnetic helicity conservation that can have dramatic effects in periodic domains. The existence of magnetic diffusion is crucial for dynamos, as was exemplified by the impossibility of finding dynamo solutions when using Euler potentials, which is a perfectly valid approach in the absence of magnetic diffusion. The Roberts flows~I, II, III, and IV are two-dimensional flows that support three-dimensional dynamos, all of which are also large-scale dynamos in the sense that their planar averages are of significant strengths, even though flow~II is pointwise non-helical. Here we demonstrate the numerical convergence properties of solutions obtained using discretisation schemes of second, sixth, and tenth order in the mesh width in the Pencil Code, compare the results with the SPH-based SWIFT code, and present a list of averaged quantities that facilitate their use in characterising the solutions as benchmarks. In addition, we present a procedure to obtain two-dimensional time-independent magnetic field visualisation for all Roberts flows, and perform per-pixel comparison between the Pencil and SWIFT codes. The rich combination of features makes Roberts flows an excellent dynamo benchmark for the direct numerical simulations of magnetohydrodynamics equations.

physics.comp-ph↗

Ghost tasking for parametrized Gaussian Processes solving linear differential equations

Physics-informed machine learning has gained significant attention in recent years. In regimes of limited data, parametrized Gaussian processes have become popular. Existing approaches, however, often face limitations, such as requiring parametrizable (also called controllable) systems or a large number of output tasks. In this work, we introduce a systematic procedure we call "ghost tasking", using auxiliary tasks to circumvent these limitations. We prove that such ghost tasks can render any non-parametrizable system effectively parametrizable, enabling algorithmic construction of parametrized Gaussian Processes while keeping the number of required tasks (i.e. output dimensions) and latent functions low. We find that ghost tasking performs especially well in an inverse problem setting, even with very few available data. We show the usage and power of ghost tasking in three experiments, providing systematic comparisons to the only other currently available method applicable to all experiments. We provide necessary syntax and explications for two computer algebra programs that compute parametrizations for systems with polynomial or rational coefficients. Our theoretical results extend to systems with meromorphic functions.

physics.comp-ph↗

Observations Regarding the Construction of Multipoint Kinetics Models from Observational Data

The multipoint kinetics (MPK) equations extend point kinetics models by tracking neutron populations in lumped reactor regions, offering improved spatial resolution at modest computational cost. However, determining the coupling coefficient matrix $K$ from transient data remains an open problem without established experimental procedures. This work provides some commentary on the task of recovering $K$ from observable forward flux measurements during reactor transients. Analytical solutions to the Kobayashi MPK formulation in the case of no precursors and with a single precursor family are derived in spectral form, enabling a mathematically rigorous investigation of eigenmode behavior and parameter observability. Coupling coefficient recoverability is investigated using modal sensitivity analysis and the Hessian condition number of the spectral recovery problem. The inclusion of delayed neutron precursors delays this eigenmode divergence but may be insufficient for enabling practical recovery of $K$ in many scenarios. In conclusion, capturing the behavior of nondominant eigenmodes without oversampling the dominant eigenmode is critical to the recoverability of $K$ through transient data.

physics.comp-ph↗