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

[2506.04742] Employing Deep Neural Operators for PDE control by decoupling training and optimization Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Mathematics > Optimization and Control arXiv:2506.04742 (math) [Submitted on 5 Jun 2025 ( v1 ), last revised 9 Apr 2026 (this version, v3)] Title: Employing Deep Neural Operators for PDE control by decoupling training and optimization Authors: Oliver G. S. Lundqvist , Fabricio Oliveira View a PDF of the paper titled Employing Deep Neural Operators for PDE control by decoupling training and optimization, by Oliver G. S. Lundqvist and Fabricio Oliveira View PDF HTML (experimental) 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. Subjects: Optimization and Control (math.OC) ; Artificial Intelligence (cs.AI) Cite as: arXiv:2506.04742 [math.OC] (or arXiv:2506.04742v3 [math.OC] for this version) https://doi.org/10.48550/arXiv.2506.04742 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Oliver Lundqvist [ view email ] [v1] Thu, 5 Jun 2025 08:22:16 UTC (1,023 KB) [v2] Mon, 22 Sep 2025 13:30:04 UTC (340 KB) [v3] Thu, 9 Apr 2026 07:22:01 UTC (800 KB) Full-text links: Access Paper: View a PDF of the paper titled Employing Deep Neural Operators for PDE control by decoupling training and optimization, by Oliver G. S. Lundqvist and Fabricio Oliveira View PDF HTML (experimental) TeX Source view license Current browse context: math.OC < prev | next > new | recent | 2025-06 Change to browse by: cs cs.AI math References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• MENO: Memory-Efficient Neural Operator#1064283
• Deep Learning for Singular PDEs: A Weighted Neural Network Approach#1013932
• Warm-starting PDE solvers with any-dimensional machine learning#1143517
• Tensor-Train Compressed Separable PINNs: A Curvature-Aware Optimization Framework for Parametric PDEs in High Dimensions#1131007
• Continuous control with deep reinforcement learning#7158