- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The authors introduce a method for adaptively allocating representational capacity in a physics-informed solver during optimization. The representation consists of Gaussian-localized components, each equipped with a local polynomial (monomial basis), whose responsibilities form a partition of unity. Capacity is adapted by splitting, polynomial enrichment, merging, and pruning, driven by residual-derived indicators. Since inserting new components can disrupt the learned solution, the authors introduce quiet-child refinement, which initializes the child as an exact copy of the parent's local polynomial with a small gate. The theoretical results show that, under an assumed PDE stability estimate, the mass-weighted local indicators bound the solution error, and that, for linear transport, the loss increase caused by a quiet-child insertion is controlled by the child's gate. Experiments on five smooth 3D/4D benchmarks against 11 physics-informed baselines report the lowest relative L2 error on all problems, with ablations on one benchmark (KG3D).
Critical strengths
1. Conceptually interesting approach. Treating the representation of a physics-informed solver as an adaptive variable, refined where the physics is unresolved (splitting, polynomial enrichment) and coarsened where it is redundant (pruning, merging), is a relevant direction for solutions with varying complexity.
2. Link between local indicators and theoretical guarantees. The paper makes explicit that the mass-weighted local residual indicators decompose the global residual exactly (via the partition-of-unity property), so that under a PDE stability estimate they bound the solution error; it also bounds the loss increase caused by quiet-child insertion for linear transport. This gives the localized adaptation signals a principled interpretation.
Critical weaknesses
-
The method is not specified well enough to be understood, reproduced, or connected to the theory. Parts of the method are well explained, in particular how the residual-based indicators drive splitting, merging, pruning, and enrichment. However, the model these rules operate on is never defined. Although the components are described as Gaussian-localized, the Gaussian function is not given, and the solution is only defined abstractly as , without specifying the aggregation map . The responsibilities π_m are only required to be nonnegative, yet they weight every adaptation signal, and it is not stated how they are computed or whether they include the gates. The abstract formulation may be intended for generality (
Appendix A.2states that the procedure is "agnostic to the specific responsibility and output-aggregation rules"), but the experiments necessarily use a specific choice, which is not reported, and no second instantiation demonstrates the claimed generality.Appendix A.1further states that contains "the parameters of the base model and the parameters of the adaptive Gaussian representation," andTable 2lists "hidden features," yet the base model is never described. Similarly, the method allows hard or soft enforcement of initial/boundary conditions, but the experiments do not specify which is used (only M1 in the ablation is described as hard-constrained) or how the hard constraints are constructed. As a consequence, the method cannot be reproduced, and it is not possible to judge which ablations would be needed to support the claims, since these depend on the model (e.g., whether a feature network sits on top of the Gaussians). It is also unclear whether the theoretical results apply to the implemented model, sinceTheorem 3.1assumes normalized responsibilities andTheorem 3.2a normalized gated mixture (Eq. 12, the only explicit model form in the paper). A complete model definition and a pseudo-algorithm of the training/adaptation loop are needed to assess the method. -
The experiments do not establish that the improvements are reliable or that they come from adaptation.
- (i) Reliability.
Table 1reports single runs without standard deviations or a stated number of seeds. TheKG3Dresult for the full method inTable 1also differs from those in the cumulative ablation and the threshold sweep (Fig. 3, left and right), where the method performs on par with SPINN, the strongest baseline. This might be explained by seed variance, as the standard deviation reported in the ablation exceeds the claimed margin over SPINN, or by differing configurations, which the paper does not clarify. No baseline configurations, budgets, or tuning procedures are given. - (ii) Attribution to adaptation. A comparison with and without adaptation
(Fig. 3, middle)is given only onKG3D, as are all ablations, and it matches the final component count rather than parameters or compute; for the other four benchmarks, the gain from adaptation cannot be separated from the choice of base model. No parameter counts are reported, and the cost of the adaptation events themselves is not measured. It is also unclear what coarsening (pruning and merging) contributes: in the ablation, adding it lowers the mean error by less than the reported standard deviation, and the paper does not report how many components are removed or whether this reduces cost. Finally, the paper never shows the adapted representation itself (where components are split, merged, or pruned, and how their number evolves), so it is not visible whether capacity is actually allocated where the residual is high. Moreover, each equation is evaluated at a single parameter setting (e.g., one set of wavenumbers forH3D), so it is not shown whether the method is robust across parameters, or whether the benefit of adaptation grows as the solution becomes more heterogeneous, which is the paper's motivation. Depending on the implemented model (see Weakness 1), further ablations may be needed. This information is crucial for a final assessment of the method: without it, the improvements cannot be distinguished from seed variation or tuning differences, nor attributed to the adaptation rather than to capacity, adaptive sampling, or the base model.
Questions for authors
Clarifications:
-
Model definition. How exactly is u_Θ constructed in the experiments? Please give the aggregation map A_Θ, the Gaussian function, and how the responsibilities π_m are computed (including whether they contain the gates). What is the "base model" (Appendix A.1), and what do the "hidden features" in Table 2 represent? Which boundary/initial conditions are hard-constrained in the main experiments, and how? Does the implemented model satisfy the assumptions of Theorems 3.1 and 3.2?
-
Statistical reliability and baselines. How many seeds were used for Table 1? Please report mean ± std for ReCAP and the strongest baselines on all benchmarks, and explain why the KG3D results differ between Table 1 and Fig. 3. How were the baselines configured and tuned, and were they given the same budget (iterations, collocation points, adaptive sampling)?
-
Effect of adaptation. On all benchmarks, how does ReCAP compare with the same model without adaptation at matched parameter count and compute? Please report parameter counts and wall-clock time, including the overhead of the adaptation events.
-
Relation to prior work. How does ReCAP differ from PINN Balls (Bonfanti et al., 2025, arXiv:2510.21262), which also uses a learnable, residual-driven partition-of-unity mixture of local experts? Please also discuss partition-of-unity and RBF-PU methods, which have the same form as Eq. 12.
-
Finally, how are new components implemented: are up to M_max components preallocated and only activated (as for the polynomial coefficients), or are parameters added during training? Which optimizer is used, and is it reset after adaptation events, or how are the optimizer states of new components initialized?
Suggestions (not decisecive):
-
Restructure Section 3.4: move Theorem 3.1 to the appendix, keeping a pointer in the main text, and motivate the paragraph on controlling the effect of a new child (bounding the loss increase caused by inserting a component), placing it directly after the split initialization.
-
Visualize the adapted representation: component placement and count over training (as in PIG).
-
Evaluate each equation at several parameter settings, and on problems with localized features (e.g., an L-shaped domain).
-
Single-factor ablations: enrichment, pruning, and merging separately; leave-one-out; quiet-child gate and coordinate translation.
-
Quantify the perturbation caused by merging, and check whether the indicators η_m correlate with the true local error.
-
Related work: quiet-child insertion and error-driven splitting/pruning relate to function-preserving network growth (e.g., Net2Net, Chen et al., 2016), resource-allocating RBF networks (e.g., Platt, 1991), and adaptive density control in Gaussian Splatting (e.g., Kerbl et al., 2023). Discussing these would clarify what is specific to ReCAP, e.g., the coordinate translation of local polynomials.