用神经算子解偏微分方程控制,训练与优化分离,提升效率。
Employing Deep Neural Operators for PDE control by decoupling training and optimization
- 训练一次神经算子,再通过优化求解不同控制目标。
- 对非线性、时变问题,速度比伴随法快4倍,精度相当。
- 适合非线性与时间依赖的控制问题,可复用模型避免重训。
神经网络常用于控制问题,通常将数据、微分方程残差和目标成本合并进训练损失,或引入额外架构组件。本文提出一种简化方法:将控制问题与训练过程解耦,无需复杂附加设计。分析与实验表明,仅需一次物理信息训练的简单神经算子(如DeepONet),配合无约束优化流程,即可解决追踪型偏微分方程(PDE)约束控制问题。通过在代价函数中加入基于方程残差的惩罚项,以惩罚违反PDE约束的偏差,实现通过自动微分在迭代优化中计算控制变量梯度,同时满足方程约束。模型训练完成后,可直接用于不同追踪目标,无需重新训练。我们在标量椭圆(泊松方程)、非线性输运(黏性伯格斯方程)和流体(斯托克斯方程)控制问题上进行了基准测试。对泊松与伯格斯问题,对比伴随法求解器:时变伯格斯问题中,该方法精度相当,迭代速度最高快4倍;线性泊松问题中,伴随法仍更精确,表明本方法更适合非线性与时变场景。流体控制问题中,通过参考前向求解器验证了优化控制的可行性。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。