Fast Regression of the Tritium Breeding Ratio in Fusion Reactors
Petr Mánek, Graham Van Goffrier, Vignesh Gopakumar, Nikolaos Nikolaou, Jonathan Shimwell, Ingo Waldmann
TL;DR
The paper addresses the computational bottleneck of evaluating the Tritium Breeding Ratio (TBR) in fusion reactor design by developing fast surrogate estimates of a Monte Carlo neutronics model (Paramak/OpenMC). It systematically compares nine surrogate families under decoupled and adaptive training regimes, introducing Quality-Adaptive Surrogate Sampling (QASS) to selectively augment training data. The results show that deep neural networks can achieve near-perfect regression accuracy with astonishing speedups (e.g., $R^2=0.998$ and a mean prediction time of about $1.12~\text{μs}$, yielding ~$6.92\times 10^6$ relative speedup), while tree-based ensembles remain competitive, especially on smaller training sets. The work demonstrates that substantial computational gains are achievable for rapid reactor-parameter exploration, with open-source tooling and a demonstrated adaptive sampling pathway enabling broader deployment of fast TBR surrogates.
Abstract
The tritium breeding ratio (TBR) is an essential quantity for the design of modern and next-generation D-T fueled nuclear fusion reactors. Representing the ratio between tritium fuel generated in breeding blankets and fuel consumed during reactor runtime, the TBR depends on reactor geometry and material properties in a complex manner. In this work, we explored the training of surrogate models to produce a cheap but high-quality approximation for a Monte Carlo TBR model in use at the UK Atomic Energy Authority. We investigated possibilities for dimensional reduction of its feature space, reviewed 9 families of surrogate models for potential applicability, and performed hyperparameter optimisation. Here we present the performance and scaling properties of these models, the fastest of which, an artificial neural network, demonstrated $R^2=0.985$ and a mean prediction time of $0.898\ μ\mathrm{s}$, representing a relative speedup of $8\cdot 10^6$ with respect to the expensive MC model. We further present a novel adaptive sampling algorithm, Quality-Adaptive Surrogate Sampling, capable of interfacing with any of the individually studied surrogates. Our preliminary testing on a toy TBR theory has demonstrated the efficacy of this algorithm for accelerating the surrogate modelling process.
