- Rating
- 3
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper studies inverse problems with auxiliary calibration channels that only observe shared nuisance variables. It shows the benefit of calibration is governed by paired nuisance geometry rather than individual channel quality, derives minimax rates and critical sample complexity, and reveals that calibration timing drastically changes sample requirements for dynamical parabolic systems. It further proposes target-oriented resource allocation distinct from nuisance-optimal allocation.
Critical strengths
Existing modular dynamical‑system learning methods either impose modular structure during training, or require expensive retraining for every candidate partition. MODEC works as a post‑hoc tool: given one monolithic fitted model, it scores all candidate module boundaries by re‑using cached ridge statistics. This avoids repetitive full retraining, which is a major practical pain‑point for networked physical‑system modelling.
Critical weaknesses
-
MODEC is limited to coupling-additive models, where predictions are linear within predefined coupling blocks. It cannot directly handle arbitrary nonlinear interactions in general neural networks, particularly cross-group interactions not explicitly modeled. The paper should discuss how model misspecification affects decomposition quality and suggest practical ways to handle deviations from the coupling-additive assumption.
-
The greedy merging strategy may fail to find a globally Pareto-optimal decomposition. The paper should discuss potential failure cases and alternatives, such as local search or mixed-integer optimization.
-
MODEC relies on predefined feature blocks and candidate partitions, so it cannot recover true subsystem boundaries absent from the candidate set. The paper should clarify that MODEC ranks existing partitions rather than discovering structures from scratch.
Questions for authors
-
The method requires a pre‑specified family of candidate cuts/partitions. Could the authors clarify how practitioners should define deployment groups and candidate cut families in real‑world scenarios where true physical subsystem boundaries are unknown?
-
MODEC is derived for coupling‑additive predictors. What happens when the real‑world dynamics contain interaction terms that cannot be represented within the coupling‑additive model class?
-
The paper uses agglomerative greedy merging over the reweight score for searching decompositions. While it works well across the three presented benchmarks, greedy algorithms are prone to local optima. For larger problem scales with huge partition space (similar to IEEE‑39‑bus), what alternative search strategies would you recommend if greedy search gets stuck in poor local optima?
3 comments
Follow-up on scope, search, and deployment groups
Thank you again for your questions. Section 3 now explains how omitted interactions can affect decomposition scores and suggests checking residuals for missing interactions. In the new CSTR experiment (Appendix E.15), MODEC still recovered the planted partition after we added pairwise interaction features, and the restricted refit’s test NRMSE dropped from 0.1613 to 0.1538.
Appendix C now gives a concrete example of when greedy merging misses the optimum. It also describes exact search using cached block costs for closed modules and move-and-swap refinement for larger problems.
We also clarified how to define the search space when physical boundaries are unknown. Practitioners can start with the smallest feasible set of sensors or devices and specify actuator access. MODEC then searches for module boundaries among unions of those groups.
I would like to thank the authors for their detailed responses, and I apologize for the inaccuracies in my original paper summary. The authors' responses have addressed my concerns. However, since my expertise in this research area is limited, I can only assign a confidence score of 1 to my review.
Response on scope, search, and deployment groups
Thank you for the questions on model scope, deployment groups, and search; the revision addresses each.
Representation and misspecification. MODEC fits a linear head over declared feature blocks, whose maps can be nonlinear and may read several groups. A learned encoder can be used if frozen during the ridge fit. Our IEEE model includes 20 machine-pair blocks. A module retains a pair term when it can access both machines and the relevant control.
The scores evaluate restrictions within the selected representation. Appendix A.5 gives a failure case: two centered group variables and all remaining inputs are mutually independent, and each available term reads at most one of the two groups. Their product is orthogonal to the feature class, so it contributes zero population restriction cost although the dynamics depend on both groups. Other input distributions can project an omitted interaction onto represented features, and finite-data scores can be nonzero. The restriction cost should therefore be read alongside the fitted monolith's absolute prediction error.
For a restricted predictor, error relative to the true conditional mean separates into the full model class's approximation error, the best achievable cost of the boundary, and the fitting error within the restricted class. Interpreting a low boundary cost as evidence about the plant therefore requires a model-adequacy check.
In practice, we recommend checking that error against a suitably tuned richer predictor and examining residual dependence on candidate interactions. Pilot data can guide new pair features. The enlarged dictionary is then fitted before scoring its restrictions. If D2 (selection fold) results motivate the representation change, fresh independent scoring episodes preserve the original evaluation protocol. We tested this on CSTR at εinter=0.10 by adding six interaction-only blocks (products and joint random features of wired reactor pairs, three across planted modules). The monolith's D3 (test fold) NRMSE falls from 0.0165 to 0.0078. At three modules, reweight selection still recovers the planted partition; its restricted refit improves from 0.1613 to 0.1538 and retains 4,000 rather than 1,952 coefficients. Section 3 now covers the Appendix A.5 example and the error split (Lemma A.2); Remark A.3 gives this diagnostic; Appendix E.15 reports the experiment.
Search. Greedy merging produces a nested sequence and can miss the optimum at a later module count. A four-group cut-cost example (Appendix C) illustrates the failure. With edges AD = 10, AB = 9.2, BC = 9.1, and AC = 9.0, greedy first merges A and D, then returns ABD ∣ C with cut cost 18.1 at two modules. The alternative ABC ∣ D has cost 10.
The submitted exhaustive comparisons quantify the gap. Greedy attains the minimum reweight score at every TEP module count and at five of eight nontrivial IEEE counts. At six IEEE modules, greedy and exhaustive-score selection have the same cb=0.841 (share of removable couplings cut), with D3 NRMSE 0.8037 and 0.7995. Exact-refit local search reaches the exhaustive D2 refit optimum at each tested module count from two to six on both systems; its reported search budget is allocated separately at each count.
With closed modules and the benchmark's block-local actuator rule, each module's allowed terms depend only on its containing group set B. An additive partition objective therefore has the form C(P)=∑B∈PC(B). After block-cost preparation, subset dynamic programming gives the optimum for K modules and M groups in O(K3M) time, and the same costs define a set-partitioning integer program. In new runs, exact selection over all 115,975 closed IEEE partitions took under 0.4 s from 1023 cached block costs. Candidate-block construction remains exponential in M. For larger systems, beam search and move-and-swap refinement can explore additional partitions with the same evaluator.
Deployment groups. The atomic units, feature supports, and control-access rules are supplied. MODEC selects the final partition among admissible unions of those units and recovers the planted reactor pairs at K=3. The six-reactor atoms admit 203 closed partitions, 90 of which are at K=3. A boundary inside a supplied atom requires a finer initial grouping. Practitioners can begin with the smallest feasible set of sensors or devices, specify the inputs each feature reads, and record private and shared actuator access before scoring. The declared family in our experiments includes every closed partition; the submitted MODEC algorithm visits a greedy path through it. Exhaustive enumeration supplies separate reference optima.
The simultaneous evaluation results cover selection within the family declared before D2 for the stated quantities and candidate predictors fixed before that fold. Section 5 states these conditions; Section 4.2 and Appendix C give the exact alternatives.