- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The authors proposed to learn low dimensional representation on the spatially and temporal control functions collected from previous optimization task. For a new task, they optimize latent variables and decode them into control functions. They suggests that this low dimensional would make the search of control function in a new task easier as the manifold contains the structures of control. The method is evaluated on eight benchmarks covering static and time-dependent problems, distributed and boundary controls, and regular and irregular meshes. Burgers uses receding-horizon execution. They show that similar order of objective values can be achieved in less time. They validate the methodology by comparing different types of low-dimensional representations, such as DCT and PCA, with a nonlinear autoencoder. For irregular meshes, they using the linear representations like DCT/PCA/GFT followed by autoencoder and show gains in performance.
Critical strengths
The strength of the paper lies in its diverse and extensive empirical studies, which cover uniform-grid and nonuniform-grid problems, time-dependent and static optimization problems, and the use of different optimizers.
Critical weaknesses
The benefit of learning a latent control representation over using a fixed basis is unclear. Distributed controls can already be parameterized using Gaussian or sine/cosine functions, making optimization more manageable. Although the paper includes DCT and PCA baselines, the additional benefit of the autoencoder needs clearer justification. Searching directly over a very high-dimensional control space may make the raw-space baseline unnecessarily difficult. Figures 6 and 7 show substantial differences between the target and optimized states, including for traditional optimization. The authors should clarify whether this mismatch comes from restrictions in the problem formulation or limitations of the optimization method. Table 2 shows that performance depends on the optimization algorithm. It would help to clarify how much improvement comes from the learned representation and how much depends on the optimizer. Is the available data sufficient to learn a useful control manifold? Since historical optimized controls are already available, a comparison with imitation learning would help establish when learning a control search space is preferable to learning a policy.
Questions for authors
Does representing control functions using a fixed basis, such as Gaussian or sine/cosine functions, improve optimization algorithms in general? Would learning a low-dimensional manifold still provide any benefits?
Why were the PDE control benchmark problems presented in PDE Gym and other works on PDE backstepping and differentiable predictive control of PDEs not used? Would your methodology work on one of these example problems?
Given that you have a history of optimization results, would imitation learning work here? Why or why not? Showing imitation-learning results would help establish the usefulness of learning a low-dimensional space.
7 comments
Dear Reviewer - Response to NhhY (2/6): Physical Reachability in Figures 6 and 7
2. Why do the optimized states in Figures 6 and 7 still differ visibly from their targets?
Thank you for examining these visualizations so carefully and raising this important question.
In PDE-constrained control, a target state need not be physically attainable under the admissible controls. The optimizer seeks the closest state permitted by the governing PDE, boundary conditions, and control constraints.
Figures 6 and 7 illustrate precisely these limits of physical reachability.
For Heat2D in Figure 6, the desired temperature field varies across both space and time, while the admissible actuation is only a spatially uniform scalar heat source . At each instant, one source intensity acts throughout the domain; the controller cannot independently heat different spatial locations. Reproducing an arbitrary target field would generally require a source that varies with both position and time, which this benchmark does not allow. Moreover, Figure 6 displays only the snapshot at , whereas the tracking objective is evaluated over the full space-time domain. The visual difference at a single instant therefore does not represent the entire optimization objective.
For Poisson in Figure 7, the source control is confined to the central circular region . The state must satisfy on the outer boundary and on the boundaries of four interior holes. The cosine target remains positive near those holes, so the desired field is not fully compatible with these prescribed boundary values. The optimizer cannot remove this incompatibility by changing a source restricted to .
To distinguish physical unattainability from optimizer error more directly, we additionally constructed specialized convex QP reference solutions for the exact target tasks depicted in these two figures, and verified the resulting controls using the original numerical PDE solvers.
For the official Heat2D target, the verified QP objective is 0.036331, closely matching the adjoint reference of approximately 0.0363 displayed in Figure 6. For the Poisson cosine target, the verified QP objective is 3.668484, consistent with the adjoint-FEM result of approximately 3.669 in Figure 7. Both specialized references retain nonzero tracking error even after optimization.
Thus, a substantial part of the visible mismatch arises from the states that the available actuation and boundary conditions can physically reach, rather than simply from insufficient optimization by the learned manifold. This distinction matters when interpreting the figures: a visible target-state gap does not, by itself, establish that the search procedure has failed.
Your observation helped us recognize that these physical constraints needed to be explained more clearly. We have therefore added explicit reachability discussions in Appendix B, immediately before Figures 6 and 7, covering the control restrictions, boundary conditions, the scope of the Heat2D tracking objective, and the solver-verified QP references. These explanations help readers interpret the visualized states in light of the actual PDE-control problems.
We sincerely appreciate your careful attention to these figures, which has helped us make their physical meaning and numerical evidence clearer.
Dear Reviewer - Response to NhhY (3/6): Search Representation vs. Optimizer Contributions
###3. How do we separate the contributions of the search representation and the optimizer?
We sincerely thank you for raising this important question. It is precisely why our framework separates the search representation, optimizer, and evaluator into distinct design choices.
An optimization method may find better controls because it uses a more effective search algorithm, or because it searches in a more promising region of the control space from the outset. We want to understand these two contributions separately.
In fact, the original manuscript already included two complementary controlled comparisons.
In Section 4.3 and Figure 3, we fix the optimizer, evaluator, and search budget within each benchmark, changing only the control representation among Raw, DCT, PCA, SWAE, and other applicable structured coordinates. Thus, differences in the resulting objectives isolate the effect of choosing where to search.
In Section 4.4 and Table 3, we instead fix the learned search manifold and compare Dual Annealing, CMA-ES, DANTE, and DANTE-GSA. This examines how different algorithms explore the same search space, separating the optimizer's contribution from the representation itself.
The original Appendix F.2 also repeated the representation comparison using a second optimizer, independently fixed for each benchmark. These results appear in Table 23 of the revised manuscript. For example, with DANTE fixed on NS2inlets, the mean FEM-verified objectives for DCT, PCA, and SWAE are 0.0466, 0.0399, and 0.0332, respectively.
This shows that the benefit of changing the search representation is not confined to one particular optimizer. Even when the search algorithm changes, the structure of the control space exposed to it continues to affect which solutions can be found.
The additional experiments in this revision strengthen this distinction from two further directions. Our new Gaussian/Fourier comparisons on NS2inlets keep the optimizer and evaluation procedure fixed while comparing prescribed and learned search coordinates. Our exact-PDE-only experiments on Heat2D and Poisson remove the surrogate entirely, so every candidate is evaluated by the numerical PDE solver. These comparisons provide further evidence that the search representation has an effect independent of both the choice of optimizer and the surrogate's prediction accuracy.
Search representation and optimizer are therefore not competing explanations. The representation determines which control structures the optimizer can explore; the optimizer determines how that space is explored. Each can influence the final result independently, and the two can also work together.
We have made the connections among these comparisons more explicit in the revised Section 4.1 and Sections 4.3–4.4. The complementary second-optimizer results remain in Appendix F.2 (Table 23), while the new exact-PDE comparison is reported in Section 4.3 (Table 2) and the fixed-basis studies in Appendix F.3–F.4.
We sincerely appreciate your question. It helps us highlight a central methodological point of this work: learning where to search is a research problem in its own right, distinct from designing the algorithm that searches there.
Dear Reviewer - Response to NhhY (1/6): Fixed Bases and Learned Search Manifolds
We sincerely thank you for your careful review and thoughtful comments!
We especially appreciate your attention to novelty and what learned search representations offer beyond standard low-dimensional parameterizations. Your questions about Gaussian and sine/cosine bases, optimizers, and direct control prediction point to a fundamental question: What can past optimization experience provide for new tasks beyond generic dimensionality reduction?
Your comments clarified our research motivation and led us to add fixed-basis comparisons and examine physical constraints, representations, and optimizers more carefully. We respond in turn.
1. Are fixed Gaussian or Fourier bases sufficient? Why learn a search manifold?
Thank you for raising this key question. Gaussian, sine/cosine, and other fixed low-dimensional bases are valuable in PDE control: they reduce variables and have clear structure.
Our key distinction is that we are not simply proposing another dimensionality-reduction method. Reduction is a means of searching; we study whether experience from solving related optimization tasks can become a learned, reusable search capability.
Reducing the dimension and learning which controls are worth searching are different problems. Fixed Gaussian or Fourier bases specify the function shapes that can be combined. We instead also learn from high-quality controls found on previous tasks: how control variables co-vary, which combinations repeatedly yield effective solutions, and how to organize this experience into a continuous search space.
A nonlinear decoder can capture correlated changes among valuable control structures beyond prespecified linear basis combinations. But the real test is improved optimization, not just better reconstruction. Following your suggestion, we added direct comparisons.
On nonlinear NS2inlets, we represent 62 free inlet controls with 16-dimensional Gaussian-RBF, Fourier, DCT, PCA, AE, and SWAE coordinates, plus full-space Raw search. Gaussian widths, basis conditioning, and search bounds are calibrated from historical controls, not test targets. All share a frozen DeepONet, Dual Annealing, 200 surrogate evaluations, and top-3 fine-FEM selection.
Mean FEM-verified objectives over three search seeds, for a=0,0.16,0.32,0.48. All use the same surrogate search and top-3 FEM selection. Raw includes the original mean-control penalty.
SWAE gives the lowest mean objective among all 16-dimensional representations for the first three targets. In-range, it reaches 0.02603 versus 0.03476 for the best linear representation, PCA: a 25.1% improvement. Its improvements over PCA remain 17.2% at the training boundary and 17.7% at the first out-of-range target.
At the strongest shift, PCA performs better. This is revealing: historical experience focuses search, but representations cover different control structures, and their advantages can change as new tasks depart from past experience.
We also increased Gaussian and Fourier bases to 32 dimensions and tested prespecified in-range and strongest-shift targets. Larger bases reconstruct historical controls better, yet do not improve final optimization under the same 200-evaluation budget.
Expressing more control shapes does not necessarily make good controls easier to find under a finite budget. This is why learned search manifolds merit study: a good representation should both express valuable controls and make them accessible to optimization.
We additionally compared Gaussian bases on Heat2D and Poisson, where every candidate is scored by the exact numerical PDE solver. These experiments also show search gains from historically learned representations within the tested budgets.
In future work, we hope to combine PCA, Gaussian, and Fourier structures with nonlinear learning, bringing physical priors and historical optimization experience together.
Thank you again for this suggestion. It helped us clarify our contribution: we learn not just lower-dimensional control coordinates, but reusable search structure from past optimization. These results and protocols appear in Appendix E.1–E.2 and Appendix F.3–F.4 (Tables 24–26) of the revised manuscript.