Optimized Multilevel Sampling Methods under Resource Constraints

We present recent developments in multilevel sampling methods under resource constraints. Over the past 15 years, multilevel methods have become widely used for uncertainty quantification. However, scaling them to high-dimensional problems and high-performance computing (HPC) environments remains challenging. In this work, we discuss two algorithms designed to address these issues: the budgeted Multilevel Monte Carlo (MLMC) method and the Multilevel Stochastic Gradient Descent (MLSGD) method. We demonstrate their effectiveness on HPC systems under consideration of the available computational resources for applications in forward uncertainty quantification (UQ) and optimal control (OC) under uncertainty.

Source: arXiv:2608.25958v1 - http://arxiv.org/abs/2608.25958v1 PDF: https://arxiv.org/pdf/2608.25958v1 Original Link: http://arxiv.org/abs/2608.25958v1