Learning Optimal Robust-Pathwise Control of Elliptic Equations with Random Coefficients
Abstract
Conventional control approaches to optimization problems under uncertainty entail a practical compromise: deterministic controls offer robustness at the expense of pathwise accuracy while stochastic controls can adapt to individual realizations but suffer from the curse of dimensionality. To achieve both robustness and adaptivity, a neural operator-based approach is proposed in this paper for distributed elliptic optimal control problems with high-dimensional random inputs. A data-driven training algorithm is first established to learn the mapping from coefficient realizations directly to their optimal pathwise controls. To bypass the burden of generating training data pairs, a physics-informed training algorithm is then proposed and recast as weakly supervised learning using pseudo label targets produced by standard adjoint-based control updates. Numerical experiments with rough coefficients are conducted to validate the effectiveness and efficiency of our robust-pathwise controls, which outperforms the benchmark robust deterministic control on unseen coefficient realizations owing to the generalization capability and fast inference of trained models.
Related
- Pathwise uniqueness for degenerate stochastic differential equations with Hölder continuous coefficients
- Sharp maximum estimates for linear uniformly elliptic equations with measurable coefficients
- Geometric sets of elliptic equations with Dini coefficients
- Almost Lipschitz regularity for solutions of elliptic equations with discontinuous coefficients
- A Preconditioned Semismooth Newton Method for Box-Constrained Elliptic Optimal Control Problems with Random Coefficients
BibTeX
@misc{sun2026learning,
title = {{Learning Optimal Robust-Pathwise Control of Elliptic Equations with Random Coefficients}},
author = {Qi Sun and Yanhan Cui and Ling Guo and Lili Ju},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.14658},
eprint = {2610.14658},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.14658},
}
RIS
TY - UNPB
TI - Learning Optimal Robust-Pathwise Control of Elliptic Equations with Random Coefficients
AU - Qi Sun
AU - Yanhan Cui
AU - Ling Guo
AU - Lili Ju
PY - 2026
DA - 2026/10/10
PB - arXiv
DO - 10.48550/arxiv.2610.14658
UR - https://arxiv.org/abs/2610.14658
AB - Conventional control approaches to optimization problems under uncertainty entail a practical compromise: deterministic controls offer robustness at the expense of pathwise accuracy while stochastic controls can adapt to individual realizations but suffer from the curse of dimensionality. To achieve both robustness and adaptivity, a neural operator-based approach is proposed in this paper for distributed elliptic optimal control problems with high-dimensional random inputs. A data-driven training algorithm is first established to learn the mapping from coefficient realizations directly to their optimal pathwise controls. To bypass the burden of generating training data pairs, a physics-informed training algorithm is then proposed and recast as weakly supervised learning using pseudo label targets produced by standard adjoint-based control updates. Numerical experiments with rough coefficients are conducted to validate the effectiveness and efficiency of our robust-pathwise controls, which outperforms the benchmark robust deterministic control on unseen coefficient realizations owing to the generalization capability and fast inference of trained models.
ER -