Employing Deep Neural Operators for PDE control by decoupling training and optimization

TL;DR

This paper introduces a decoupled neural operator approach for PDE control that separates training from optimization, enabling efficient reuse across different targets without retraining.

Contribution

It proposes a simple neural operator method combined with an unconstrained optimization routine, simplifying PDE control by decoupling training and control phases.

Findings

The method achieves competitive accuracy on nonlinear PDE control problems.

It offers faster iteration times compared to adjoint-based solvers for certain problems.

The approach is effective for nonlinear and time-dependent PDE control tasks.

Abstract

Neural networks have been applied to control problems, typically by combining data, differential equation residuals, and objective costs in the training loss or by incorporating auxiliary architectural components. Instead, we propose a streamlined approach that decouples the control problem from the training process, rendering these additional layers of complexity unnecessary. In particular, our analysis and computational experiments demonstrate that a simple neural operator architecture, such as DeepONet, coupled with an unconstrained optimization routine, can solve tracking-type partial differential equation (PDE) constrained control problems with a single physics-informed training phase and a subsequent optimization phase. We achieve this by adding a penalty term to the cost function based on the differential equation residual to penalize deviations from the PDE constraint. This allows gradient computations with respect to the control using automatic differentiation through the trained neural operator within an iterative optimization routine, while satisfying the PDE constraints. Once trained, the same neural operator can be reused across different tracking targets without retraining. We benchmark our method on scalar elliptic (Poisson's equation), nonlinear transport (viscous Burgers' equation), and flow (Stokes equation) control problems. For the Poisson and Burgers problems, we compare against adjoint-based solvers: for the time-dependent Burgers problem, the approach achieves competitive accuracy with iteration times up to four times faster, while for the linear Poisson problem, the adjoint method retains superior accuracy, suggesting the approach is best suited to nonlinear and time-dependent settings. For the flow control problem, we verify the feasibility of the optimized control through a reference forward solver.