- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
SLED designs a frozen collocation batch for quasi-Newton refinement after first-order PINN warmup. It combines residual-tangent ridge-leverage sampling with scrambled Sobol points. A rank-correlation statistic sets their proportions. The paper analyzes linearized training and applies existing spectral-embedding results. Experiments cover six PDE benchmarks, frozen and refreshed baselines, batch-size scaling, and off-batch diagnostics.
Critical strengths
The post-warmup collocation design problem is practically relevant. Shared warmup checkpoints and ten-seed comparisons improve experimental control. Off-batch residual diagnostics also help distinguish fitting the selected points from generalization across the domain.
Critical weaknesses
1. The central allocation rule lacks sufficient justification and specification. Section 4.2 claims that agreement between leverage and kernel-diagonal rankings implies an absence of localized directions. This is false in general. For a nonconstant, strongly localized scalar tangent feature ,
\ell_\lambda(x)=\frac{\kappa(x)}{\mathbb{E}_\rho[\phi^2]+\lambda}.$$ The Spearman correlation is 1 for every $\lambda>0$, despite localization. Stable rankings do not resolve this counterexample. Proposition 4.4 establishes monotonicity under adding points, not superiority over equal-budget batches. Corollary 4.3 bounds interpolation within $H_K$, not the full inconsistent least-squares or nonlinear training problem. These results do not derive $\mu_{\mathrm{sob}}=\hat\rho$. Section 4.2 also requires major rewriting. Nyström and Hutchinson alone do not uniquely specify $\hat\ell_\lambda$, $\hat\kappa$, or $\hat\lambda_{\max}$. Estimator definitions, algorithmic steps, heuristic choices, and guarantees should be clearly separated. Unexplained line references and the distinct meanings of $\rho$ and $\hat\rho$ add avoidable ambiguity. **2. The experiments do not isolate the contribution beyond existing methods [1–3].** LEV contains a 20% uniform mixture. It is not SLED with $\mu_{\mathrm{sob}}=0$. KD-W does not preserve SLED's Sobol component while changing only the score. These are not controlled ablations of allocation, coverage, and spectral normalization. The PINNACLE comparison uses only a one-shot, frozen K variant. It omits PINNACLE-S and adaptive reselection. Describing PINNACLE as limited to a "first-order phase" conflates its Adam-based experiments with a restriction on its selection rule. Whole-phase freezing is also not a general requirement of quasi-Newton optimization [4].Questions for authors
1. The reproducibility statement indicates that code, checkpoints, and configurations will be released. I could not find them in the review materials. Please attach the anonymized code and experimental scripts. Please specify Nyström landmark selection, spectral normalization, Hutchinson probes, and multi-residual aggregation so Algorithm 1 can be reproduced.
2. Can the localization claim be justified under explicit assumptions? Please test the allocation rule against pure leverage and fixed Sobol shares. Vary the coverage distribution and sampling score separately to isolate their effects.
3. Why were PINNACLE-S and periodic or eNTK-triggered reselection [1] excluded? Since the refresh baselines retain quasi-Newton memory across collocation updates (Appendix C.3), could this compromise curvature estimation and bias the comparison? Please clarify how curvature pairs are handled during refresh and whether resetting the optimizer memory affects the results.
4. Which IC/BC features and loss weights affect the sampling scores? Does the method remain effective when IC/BC sampling or relative loss weights change? Please also discuss CoPINN [5] in Related Work. Its sample-difficulty-based scheduling is relevant to the paper's broad definition of domain importance adaptation.
References
[1] Lau et al., "PINNACLE: PINN Adaptive ColLocation and Experimental points selection", ICLR 2024.
[2] Cardenas et al., "CS4ML: A general framework for active learning with arbitrary data based on Christoffel functions", NeurIPS 2023.
[3] El Alaoui et al., "Fast Randomized Kernel Ridge Regression with Statistical Guarantees", NeurIPS 2015.
[4] Berahas et al., "A Multi-Batch L-BFGS Method for Machine Learning", NeurIPS 2016.
[5] Duan et al., "CoPINN: Cognitive Physics-Informed Neural Networks", ICML 2025.
Dear reviewers,
Thank you for your reviews. The author-reviewer discussion closes on November 18, so please respond to the authors' rebuttal before then. Please say whether it addressed your concerns, and update your score if your view has changed.