- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies a new framework for multi-objective control under known physical dynamics and constraints denoted Geometric Pareto Control. The idea is to amortize constrained optimization though generation of scalarized Pareto-relevant control solutions offline and use them to learn a latent representation. Such a latent representation is then decoded and produces the control actions. During deployment, urgency weights (which are dependent on the state) specify the current objectives, while local correction and feasibility checks are used to adapt the responses.
Dual-encoder representation learning, rollout-aware supervision, and domain-specific online refinement are part of the proposed methodology. For the optimal power flow setting, the authors also introduce a Riemannian energy-gradient flow with RK2 integration and a Lie-local correction. Furthermore, they establish conditional feasibility and non-cumulative matched-action error bounds. The proposed framework shows favorable online efficiency, constraint satisfaction, and objective performance when evaluated on analytical control, multi-agent navigation, and AC optimal power flow experiment.
Critical strengths
1. Strong empirical performance and practical motivation.
The reported results are promising across different control domains. In particular, GPC achieves objective values comparable to MPC in the IEEE 30-bus OPF experiments while substantially reducing online computation time. The navigation experiments also shows strong safety and task-completion performance. Overall these results provide meaningful evidence for the practical value of amortizing constrained control optimization with a similar framework.
2. Integration of physical constraints and an explicit theoretical analysis.
The proposed framework combines offline constrained optimization, learned response representations, and online physical correction. The authors also provide a detailed analysis of feasibility and matched-action error, including the effects of localization, decoder sensitivity, and final output transformations.
Critical weaknesses
1. Limited comparison with closely related approaches and fairness for baselines evaluation
GPC is closely related to amortized constrained optimization, as it relies on offline numerical solutions to supervise a learned control-response map. However, the experimental evaluation lacks a closely matched supervised amortized-optimization baseline, such as a preference-conditioned neural solution map with equivalent training information, online refinement, and feasibility correction. This makes it difficult to determine whether the reported improvements arise from the proposed framework or from the more general benefit of amortizing expensive optimization procedures. Moreover, since the method already incorporates differentiable physical rollouts during its second training stage, a comparison with differentiable predictive control (DPC) would be informative. Such a comparison could help clarify the motivation for relying on optimizer-generated supervision rather than directly optimizing control objectives through differentiable dynamics.
The interpretation of the existing comparisons is confounded by differences in computational budgets and training information. Whole the authors address (at least partially) candidate-count fairness in navigation, GPC receives perturbation-aware training and network parameter descriptors that are not provided equivalently to the RL baselines in the perturbed OPF experiment. These differences limit the conclusions that can be drawn about comparative robustness and the advantages of the proposed learning framework.
2. Insufficient experimental isolation of the proposed geometric components
Even if the overall effectiveness of GPC is well established by the reported results, the numerical experiments do not convincingly define how much of the performance improvement can be attributed to the learned Pareto geometry, Riemannian metric, and Lie-local correction, as opposed to supervised optimization and subsequent online refinement.
The authors provide an auxiliary RK2-versus-RK2+Lie comparison in Appendix J.4, but the highlighted improvement in objective value seems to be modest, since both variants achieve full recorded feasibility in the auxiliary experiments. Moreover the navigation experiments rely on learned plan correction and finite candidate refinement rather than the explicit RK2/Lie update, making it hard to attribute their strong performance to the proposed Riemannian navigation mechanism.
More systematic component-level ablations, particularly comparisons between Euclidean and metric-preconditioned updates, with and without Lie-local corrections, and with and without geometric representation regularization, would make more clear the contribution of every single component. As currently presented, the results demonstrate the effectiveness of the complete pipeline more convincingly than the incremental value of its geometric mechanisms.
3. Limited connection between the theoretical geometric and feasibility claims and their empirical verification
While the paper introduces a continuous latent homotopy representation of Pareto-relevant control responses, the mathematical properties of this representation are not sufficiently characterized. In particular, the proposed representation losses encourage local continuity without establishing that the learned representation preserves the topology of the constrained solution family or provides continuous transitions between distinct Pareto-optimal responses. This distinction is especially important in nonconvex control problems, where feasible solution families may contain disconnected branches.
Similarly, the main feasibility theorem relies on uniform Lipschitz bounds, positive constraint margins, and bounded localization and update errors. Although the theoretical argument is valid under the stated assumptions, it remains unclear to what extent these conditions are quantitatively verified for the evaluated controllers. This is particularly relevant when optimal solutions lie on active constraint boundaries, where strict feasibility margins may vanish, or when the deployed controller incorporates potentially discontinuous candidate-selection operations.
Consequently, while the theoretical analysis provides useful conditional guarantees, stronger evidence connecting its assumptions to the implemented controllers would be a great addition to properly establish their practical applicability and to really substantiate the claimed geometric interpretation.
Questions for authors
- Comparison with amortized optimization and differentiable predictive control. Given that GPC uses offline optimizer-generated supervision and differentiable physical rollouts, how would it compare against a preference-conditioned amortized optimizer or an end-to-end differentiable predictive controller? A comparison using matched model capacity, physical information, training resources, and final feasibility mechanisms would materially clarify the contribution of the geometric representation.
- Contribution of the geometric components. Could the authors provide a more systematic ablation of the latent geometry, Riemannian metric, and Lie-local correction? The auxiliary RK2/Lie results are useful, but it remains unclear whether these components provide substantial improvements over simpler latent gradient updates or non-geometric learned response correction.
- Fairness and computational accounting. Could the authors clarify the performance under matched end-to-end online computation budgets, beyond matched candidate counts? In addition, how sensitive are the OPF comparisons to the different training information available to GPC and the RL baselines? Reporting total offline reference-generation and training costs would also help quantify the practical amortization trade-off.
5 comments
2. What do the latent geometry, Riemannian metric, and Lie-local correction each contribute?
Reviewer comment — Critical Weaknesses 2:
Insufficient experimental isolation of the proposed geometric components....
Reviewer comment — Questions For Authors 2:
Contribution of the geometric components. Could the authors provide a more systematic ablation of the latent geometry, Riemannian metric, and Lie-local correction? The auxiliary RK2/Lie results are useful, but it remains unclear whether these components provide substantial improvements over simpler latent gradient updates or non-geometric learned response correction.
Authors’ response.
We verified the contribution of each component by varying it alone, and the results below confirm that each one improves the controller; the dual representation gives the largest gain.
| Component varied alone | Result | Source |
|---|---|---|
| Dual representation | Stage-I objective 3.8210% (static) and 3.4929% (moving) worse without it | new, Table 9 (p. 43) |
| Riemannian metric | Conditional gap 0.269712% → 0.227032% | new, Table 20 (p. 50) |
| Lie-local correction | Conditional gap 0.227032% → 0.221944% | new, Table 20 (p. 50) |
| Lie-local correction | Post-Newton AC mismatch below → below | in the submission, Appendix J (p. 36) |
| Lie coefficient | 60/60 feasible steps at every value tested | new, Table 21 (p. 51) |
| Rollout-aware stages | Moving scenes: 19/20 → 20/20 safe successes; cost 2521.99 → 2400.54 | new, Table 12 (p. 44) |
The metric and Lie rows are measured in OPF, where the RK2/Lie flow runs online. All of GPC's OPF results in the paper were produced with this flow running online, including the Lie-local term: with it, the executed dispatch reaches the tolerance of the IPOPT solver, whereas without it the maximum AC mismatch stays an order of magnitude higher (below ). Navigation decodes its plans from the learned response geometry, whose contribution is the dual-representation row. The comparison with and without locality regularization is in Appendix M.4.
Evidence: Table 9 (p. 43); Table 20 (p. 50); Appendix J (p. 36); Table 12 (p. 44).
3. How do online computation, OPF training information, and offline cost affect the comparisons?
Reviewer comment — Critical Weaknesses 1 (second part):
The interpretation of the existing comparisons is confounded by differences in ....
Reviewer comment — Questions For Authors 3:
Fairness and computational accounting. Could the authors clarify the performance under matched end-to-end online computation budgets, beyond matched candidate counts? In addition, how sensitive are the OPF comparisons to the different training information available to GPC and the RL baselines? Reporting total offline reference-generation and training costs would also help quantify the practical amortization trade-off.
Authors’ response.
They do not change the conclusions. Every method is now timed over its complete decision path, and the RL baselines receive GPC's per-step information. Offline cost is reported as the workload of every stage, with a break-even point of about 3,050 decisions per hour of offline computation.
-
Online computation (new in the revision). Navigation times include projection, safety templates, and final refinement (Table 10). In Case118, median end-to-end time including final correction is 35.5 ms for GPC versus 1,615.2 ms for NMO-OPF (IPOPT).
-
Training information (new in the revision). With GPC's per-step weights and an AC-PF correction, TD3 reaches reference gaps of 0.5046% / 10.4191% and CPO-style PPO-Lagrangian 5.5193% / 9.2208% (nominal / perturbed), versus 0.3011% / 0.2496% for GPC.
-
Descriptors (new in the revision). On 4,994 validation paths, the network descriptor carries structured information that GPC uses without requiring exact matching:
Descriptor input Change in Stage-I objective Held nominal +0.022015% Shuffled +0.027539% Removed (zero) +386.134358% -
Offline cost (new in the revision). Navigation uses 60,000 static and 120,000 moving-scene labels, and the nominal OPF references cover 5000 loads × 50 weights. With the Case30 decision times in Table 2 (1193.8 ms for LRH-MPC, 12.3 ms for GPC), each hour of offline computation is recovered after about 3,050 decisions.
Evidence: Table 10 (p. 43); Table 17 (p. 48); Table 14 (p. 46); Table 15 (p. 46); Table 22 (p. 51); Appendix M.13 (p. 52).
1. How does GPC compare with a preference-conditioned amortized optimizer and differentiable predictive control?
Reviewer comment — Critical Weaknesses 1 (first part):
Reviewer comment — Questions For Authors 1:
Authors’ response.
With the physics, projection, safety templates, and 4,096-candidate refinement shared, all three reach 100% success in moving scenes, and GPC attains a lower mean cost than the supervised map when priorities change externally (3988.25 versus 4045.59).
New in the revision. To the best of our knowledge, no existing method performs amortized optimization for Pareto-optimal control with priorities that change online, so we built the two closest controls ourselves:
Neither includes GPC's dual encoder, measurement-based localization, or latent updates. Results for every scene and priority setting, with mean decision times over the complete decision path, are in Tables 10–11.
What GPC adds. All three amortize optimization and share the final mechanisms. GPC represents the response across priorities and links it to localization, accepted updates, and feasibility margins, so that the validity of the response can be checked as conditions change. The representation itself is tested separately (new in the revision):
Why optimizer supervision rather than DPC alone. DPC optimizes the objective directly through the rollout. Optimizer supervision gives GPC verified reference responses across priorities. In the submission, localization and the feasibility margins of Theorem 1 are defined with respect to these references, and Proposition 4 obtains the margins from verified anchor responses.
Evidence: Table 10 (p. 43); Table 11 (p. 43); Table 9 (p. 43); Proposition 4 (p. 18).