- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes MetaColloc, a PDE-solving framework that uses a meta-learned basis dictionary trained on Gaussian random fields. For new PDE instances, the frozen basis is combined with collocation-based least-squares solving, avoiding per-instance neural network training. The paper further investigates two major limitations: insufficient basis capacity and severe numerical ill-conditioning. It analyzes their effects on solution accuracy and reproducibility, and explores Tikhonov regularization with GCV as a remedy.
Critical strengths
- Useful diagnostic analysis. The paper provides a detailed investigation of basis capacity and numerical conditioning, including the substantial sensitivity of the results to different linear algebra backends.
Critical weaknesses
-
Incomplete methodological contribution. The paper identifies fundamental limitations of its own approach, including insufficient basis capacity, severe numerical ill-conditioning, and the lack of a clear advantage over random basis methods. However, it does not provide a convincing new method to address these limitations. Although Tikhonov regularization with GCV improves numerical stability, it is a standard technique and does not resolve the underlying representation problem. As a result, the work feels incomplete: it identifies important problems but stops short of developing and validating an effective solution.
-
Limited novelty and insufficient empirical validation. The proposed framework largely follows existing fixed-basis collocation and reduced-order modeling approaches, while the diagnostic tools are also well established. Moreover, the experiments mainly focus on smooth manufactured PDEs, without comparisons against standard numerical solvers. The paper does not establish a clear benefit of meta-learning or demonstrate sufficient generalizability. Overall, the current evidence is insufficient to support a complete and compelling methodological contribution for ICLR.
Questions for authors
-
What is the main methodological contribution beyond existing fixed-basis collocation methods and standard numerical diagnostics?
-
Can the authors demonstrate a consistent advantage of meta-learned bases over appropriately matched random or classical bases under the same regularized solving procedure?
-
Could the authors provide results on more challenging PDEs and comparisons with standard numerical solvers to better establish the practical usefulness of the proposed method?
Thanks for the additional experiments. However, as the authors themselves acknowledge, "The comparison shows no consistent accuracy advantage for MetaColloc." The boundary-layer results further highlight this issue, with MetaColloc achieving RMSEs of 0.453–0.459, compared to 0.00919 for prior-shaped RFF.
While I appreciate the analysis of these failure modes, GCV does not address the underlying limitations of the learned basis. Given the poor empirical performance and lack of a convincing solution, I do not think this constitutes a sufficiently complete method paper for ICLR. I therefore maintain my original rating.