- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
Summary
The paper proposes PDE-OP (Optimization Proxy), a learning-based framework that solves spatiotemporal PDE-constrained optimal control problems in real time. It replaces slow, iterative test-time optimization (such as MPC or Adjoint Methods) with an amortized single-pass neural rollout. The system consists of two neural networks trained in two stages:
-
Dynamic Predictor (): A discrete-time Neural Operator (inspired by DeepONet) trained offline on arbitrary forward PDE simulations to model system state transitions.
-
Surrogate Controller (): A policy network trained on-the-fly via self-supervised primal-dual learning to output spatial basis coefficients for control actions. It unrolls predictions through the frozen while dynamically penalizing physical and actuator constraint violations via Lagrange multipliers.
Main Contributions
-
Dual-Network Architecture: Integrates a learned discrete-time neural operator with a proxy controller for real-time control rollouts.
-
Discrete-Time Neural Operator: Models direct state-transition maps without requiring numerical time-integration schemes.
-
Label-Free Primal-Dual Training: Uses self-supervised Lagrangian relaxation to enforce dynamics, boundary conditions, and actuator bounds during training without needing precomputed optimal control.
-
Significant Computational Acceleration: Achieves decision quality comparable to classical solvers while offering orders-of-magnitude faster inference.
Validation
The framework was evaluated on three optimal control benchmarks across open-loop and closed-loop settings:
-
1D Voltage Equation (Linear Reaction-Diffusion): Evaluated under open-loop control. Achieved comparable accuracy to Direct and Adjoint methods while running in 0.035s (~ faster than the Direct Method).
-
2D Heat Equation (Linear Reaction-Diffusion): Evaluated under closed-loop control on 2D spatial domains. Matched LMPC and Adjoint tracking accuracy while running in 0.031s (~ to speedup).
-
1D Viscous Burgers' Equation (Nonlinear Advection-Diffusion): Evaluated under closed-loop control. Produced state trajectories comparable to NMPC and Adjoint methods while running in 0.062s (~ faster than NMPC and ~ faster than Adjoint).
Critical strengths
1. Remarkable Computational Acceleration for Real-Time Execution
The dual-network architecture replaces iterative numerical optimization at test time with an amortized, single-pass neural rollout. Across diverse benchmark tasks—including 1D reaction-diffusion voltage dynamics, 2D heat equations, and 1D viscous Burgers' equations—PDE-OP achieves solution quality comparable to state-of-the-art classical baselines (e.g., Adjoint-Sensitivity Methods and Nonlinear MPC) while providing computational speedups of up to three to four orders of magnitude (e.g., running in 0.062s versus 878.67s for NMPC on 1D Burgers' equation).
2. Self-Supervised Primal-Dual Training Without Optimal Decision Labels
To train the surrogate controller, the framework employs a self-supervised primal-dual formulation based on Lagrangian duality. It updates Lagrange multipliers () iteratively during training to dynamically penalize violations of initial/boundary conditions, system dynamics, and control bounds. Crucially, this allows the controller to be optimized end-to-end through differentiable rollouts of the neural operator without requiring precalculated optimal control.
Critical weaknesses
Weakness 1: Inflexibility to Changes in Objective Functions () and Hyperparameters
The surrogate controller is trained via self-supervised primal-dual optimization using a fixed, hardcoded objective function .
Equation (4) defines as a mapping
.
It does not take the weights/parameters of the cost functional (such as running cost weight , control effort penalty , or terminal weight) as inputs.
Weakness 2: Two-Stage Training vs. Misleading "End-to-End" Framing
In Section 4 (and abstract/contributions), the paper presents the method as an "end-to-end" learning-based framework / differentiable surrogate. However, the actual pipeline is strictly two-stage:
-
is trained offline on synthetic ground-truth numerical PDE trajectories using supervised learning (Eq. 7) and then frozen.
-
is trained on-the-fly through differentiable rollouts of the frozen (Eq. 8, 10).
Weakness 3: Overbroad Title and Mismatched Scope vs. Missing Related Work
The paper is titled "Learning Fast Approximate Solvers for PDE-Constrained Optimization". However, the proposed framework, formulation, and benchmark experiments focus strictly on spatiotemporal PDE-constrained optimal control problems (e.g., tracking target profiles via time-stepping control trajectories ). Optimal control is only a specific subset of the broader field of PDE-constrained optimization, which encompasses parameter identification, shape optimization, and topology design.
If the authors insist on positioning the paper under the broad umbrella of general PDE-constrained optimization, the literature review is substantially inadequate. Crucial foundational and recent work on learning-based PDE-constrained optimization—such as self-supervised operator learning for parametric optimization (Wang et al., 2021) and exact gradient-accelerated operator surrogates for PDE optimization (Cheng et al., ICML 2025)—is entirely missing.
[1] Wang, S., Bhouri, M. A., and Perdikaris, P. 2021. Fast pdeconstrained optimization via self-supervised operator learning.
[2] Ze Cheng, Zhuoyu Li, Wang Xiaoqiang, Jianing Huang, Zhizhou Zhang, Zhongkai Hao, and Hang Su. 2025. Accelerating PDE-Constrained Optimization by the Derivative of Neural Operators. In International Conference on Machine Learning. PMLR, 10090–10105.
Questions for authors
N.A.
6 comments
Authors' response (2/2)
Response. We thank the reviewer for this observation and agree that the scope of our work should be stated more precisely. PDE-OP specifically addresses PDE-constrained optimal control, which represents an important class of PDE-constrained optimization problems. We therefore propose the more precise title Learning Fast Approximate Solvers for PDE-Constrained Optimal Control and have clarified this scope throughout the revised manuscript.
We also thank the reviewer for highlighting the works of Wang et al. (2021) and Cheng et al. (2025), which we have incorporated into the Related Work discussion. Both studies demonstrate the potential of neural operators for accelerating PDE-constrained optimization. However, while these approaches employ learned operators to accelerate numerical optimization, PDE-OP learns a surrogate controller that directly predicts control decisions for unseen problem instances, avoiding instance-specific optimization at inference time.
We emphasize that our contribution is not the use of neural operators for PDE-constrained optimization itself, but their integration with self-supervised primal–dual controller training to enable fast, amortized solutions to PDE-constrained optimal control problems.
Proposed manuscript addition
Revised title.
Learning Fast Approximate Solvers for PDE-Constrained Optimal Control.
Related Work clarification.
Wang et al. (2021) leverage physics-informed neural operators as differentiable surrogates for PDE-constrained optimization, while Cheng et al. (2025) improve neural-operator derivative accuracy and combine learned surrogates with numerical optimization. In contrast, PDE-OP focuses on amortized PDE-constrained optimal control, learning a controller through differentiable dynamics predictions and self-supervised primal–dual training. Once trained, the controller directly predicts control actions for unseen instances without requiring numerical optimization at inference time.
Authors' comment
Thank you again for your review. We wanted to follow up on our clarification that PDE-OP uses two-stage training, addresses PDE-constrained optimal control, and learns a controller for fixed objective weights in the current setting. We revised the title and related-work discussion accordingly and explained how PDE-OP differs from approaches that use learned operators within instance-specific numerical optimization. We also identified conditioning on objective parameters as a possible extension. Please let us know if any part of these scope and training clarifications needs further explanation. If these responses address your concerns, we would appreciate it if you would reconsider your rating in light of the revised manuscript.
Authors' response (1/2)
We thank the reviewer for their detailed assessment of our work, constructive feedback, and recognition of the computational efficiency and self-supervised learning contributions of PDE-OP. We address each of the raised concerns below and clarify the scope and methodological contributions of our framework.
Weaknesses.
Response. We thank the reviewer for this observation. PDE-OP is designed to learn an approximate solver for a given PDE-constrained optimal control problem, where the objective weights are fixed while initial conditions and target profiles vary across instances.
Nevertheless, the framework can naturally accommodate families of control problems with varying objectives by including the corresponding objective parameters (e.g., running-cost and control-effort weights) as additional inputs to the controller, similarly to how it is conditioned on the target profile and system state. The controller could then be trained over a distribution of objective parameters using the same self-supervised primal–dual formulation, without requiring optimal-control labels. This represents an interesting direction for future works.
Response. We thank the reviewer for this observation. Our use of the term end-to-end was intended to emphasize that both the dynamics surrogate and the controller are differentiable, allowing gradients of the control objective to propagate through the learned PDE dynamics during controller training.
As correctly noted by the reviewer, PDE-OP adopts a two-stage training procedure: the neural operator Yθ is first trained on numerical PDE trajectories and subsequently frozen, while the controller Uω is trained through differentiable rollouts of the pretrained operator. This separation allows the dynamics model to be learned independently and subsequently used for self-supervised controller optimization without requiring optimal-control labels.
We appreciate the opportunity to clarify this distinction. The revised manuscript now explicitly describes PDE-OP as a two-stage training framework with end-to-end differentiable controller optimization, rather than implying joint training of both networks.