cs.AISep 30, 2026

PTNO: Training Neural Operators with Noisy Monte Carlo Estimates for Particle Transport Problems

Authors: Yubo Cao, Xi Deng, Mengqi Xia, Vignesh Gopakumar, Ander Gray, Anima Anandkumar

Organizations: California Institute of Technology · Yale University · UK Atomic Energy Authority · LIX, CNRS, École polytechnique

Abstract

Particle transport under multiple scattering is central to radiative transfer and plasma physics, yet high-fidelity Monte Carlo (MC) simulations must trace prohibitively many particles. Learning-based surrogates can amortize this cost, but typically train on expensive, well-converged MC solutions. We propose the Particle Transport Neural Operator (PTNO), a neural operator that learns particle transport surrogates directly from noisy, low-cost MC labels. Such labels pose two challenges: (1) high variance, which destabilizes standard supervised learning, and (2) a high dynamic range (HDR) spanning many orders of magnitude. For the first, we learn the solution operator from noisy labels of many configurations, amortizing MC cost and generalizing to unseen configurations. Because MC labels are unbiased, we show that the squared loss on them shares its minimizer with the loss on converged solutions, and our budget-allocation study over training scenes MM, MC samples per render NN, and independent renders per scene KK shows that many noisy scenes beat fewer converged ones. For the second, a nonlinear transform such as the logarithm biases noisy supervision. Instead, PTNO keeps labels in physical space and enforces positivity with a softplus output layer that represents small values effectively. We further train with a pointwise relative L2L_2 loss (PRelL2), the stop-gradient relative loss of HDR denoising and neural rendering, which normalizes each residual by the stop-gradient prediction instead of the noisy label. We demonstrate PTNO on neutron transport in fusion reactors and radiative transfer in participating media. On the two neutronics tasks, PTNO is 10410^4-105×10^5\times faster than converged MC on the same CPU and 10310^3-105×10^5\times cheaper than MC at matched accuracy; on the two radiative-transfer tasks, MC at matched accuracy costs 0.80.8-11×11\times as much as PTNO.

Figures & tables

Appendix figures & tables26 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Operator Boosting Produces Pareto-Efficient PDE Surrogates

    Jun 16, 2026Lennon J. ShikhmanNeural OperatorsNeural Partial Differential Equation Solvers

  2. MoNo: Multiscale Optimal Transport Neural Operator for Solving PDEs on General Geometries

    Aug 10, 2026Zijiang Yang, Xiaomeng Wu, Dongmei FuNeural OperatorsNeural Partial Differential Equation Solvers

  3. Martingale Neural Operators: Learning Stochastic Marginals via Doob-Meyer Factorization

    May 15, 2026Kai HidajatNeural OperatorsStochastic Differential Equations