- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes DimSpec-LR, a low-rank physics-informed solver that represents the solution as a CP sum of products of one-dimensional factors. Each coordinate's factor can come from a different family: fixed dictionaries with trainable coefficients, neural networks, or dictionaries with neural corrections. Profiles are designed by hand for each benchmark using the operator, coefficients, forcing, and boundary data. Parameter-matched interventions suggest that suitable factors improve accuracy, that suitability does not require heterogeneous families, and that target-mode coverage alone does not determine trained accuracy. Comparisons with five baselines on 16 cases show large gains on most of them.
Critical strengths
The experiments are carefully controlled. Checkpoints are selected by physics validation rather than reference error, matched arms share sampling streams and budgets, and inconvenient results are reported openly. Some findings seem useful, in particular that dictionaries with the same mode coverage and parameter count train to very different accuracies (H4), and that initialization and preconditioning account for much of the accuracy in some cases.
Critical weaknesses
-
As far as I can tell, much of the gain comes from instance-specific priors, and the results are conditional on them. In the manufactured problems the forcing appears to reveal the target's structure. In A4 the dictionaries contain the exact rank-one target, S16 covers all H4 modes, and H24 contains K3's 20-radian carrier. The choice of profile does not seem to be evaluated: the interventions compare the authors' choice with a few alternatives they also built, and selection costs are excluded. The one test with profiles frozen in advance (Section E.1) looks structurally close to A4. It may be telling that DimSpec-LR loses on cases where the structure is harder to know in advance (H1, A1, S1, S3, S4).
-
Beyond the dictionary coefficients, little about the representation seems to be learned, and it is not clear that anything transfers across problems. To me the method reads as closer to a spectral method with hand-chosen bases than to the reusable inductive biases typically published at ICLR, though the authors may see this differently. The finding that a rich shared dictionary on all axes matches or beats tailored profiles seems to point toward a less expert-dependent approach, and I wondered whether it weakens the motivation for coordinate-specific design.
-
Eq. (5) appears to be a perturbation bound that assumes a rank- expansion with error exists. As I read it, it does not say which functions the ansatz approximates well, and the products of factor norms may not stay bounded, since best CP approximations can fail to exist for order (de Silva & Lim, 2008). I could not find references to related literature that seems relevant here: separated representations (Beylkin & Mohlenkamp), tensor numerical analysis (Hackbusch), low-rank approximability of PDE solutions (Grasedyck; Dahmen, DeVore, Grasedyck & Süli; Bachmayr, Schneider & Uschmajew), approximation classes of tensor networks (Ali & Nouy; Bachmayr, Nouy & Schneider), and classical spectral methods. This literature might also help explain the H1/A1 results, since sharp features along curved sets tend to have high separation rank.
-
A direct least-squares solve over products of the same dictionary atoms seems like a natural baseline for these linear problems. The paper already uses such a solve to initialize A3, and it appears to account for most of A3's accuracy ( vs. with random initialization).
-
Apart from the CP interaction, the pipeline seems to change from case to case: factor types, constraint treatment, loss preconditioning, initialization, learning rates, and schedules. Removing projected initialization on A3 or spectral weighting on H4 increases error by one to several orders of magnitude, while each baseline uses one fixed configuration. My reading is that Tables 6 and 7 therefore mix representation, prior knowledge, and per-case tuning, which makes them hard to interpret as evidence for the framework itself.
-
The baselines do not appear to be on a common footing. Parameter counts differ widely (512 vs. 727,045 on H4), and the fixed 3,000-update budget may favor fast-converging coefficient models. With longer budgets, CP-PINN overtakes DimSpec-LR on K3 and S3, and PirateNet on H4 improves from to . Wall times do not show a consistent advantage (224 s vs. 3.3 s for RFM on H1), though they were measured on shared hardware and may not be reliable. I recognize a fully fair comparison may not be possible, but accuracy-versus-time curves with equal tuning budgets, run once with the same priors given to all methods and once with generic dictionaries, might be more informative.
-
I could not find how the comparator in Tables 6 and 14 is chosen. For S2, Table 6 uses PirateNet although Vanilla PINN has lower seed-42 error ( vs. ), and S2 is the case with the smallest margin. Table 14 similarly uses MS Fourier on N2 although Vanilla PINN appears better. There may be a reason I missed, but it would help to state the rule.
-
Matched arms share one learning rate. The S3 study runs at , where the prescribed profile reaches compared with at its main rate, so the small differences between arms may change under per-arm tuning. The permutation tests seem somewhat uninformative by construction, and three seeds may be too few for the finer comparisons.
Questions for authors
- How would a user choose a profile when the solution structure is unknown? How does a generic shared dictionary perform across all 16 cases?
- How does the method compare with a direct least-squares solve on the same dictionaries, in accuracy and wall time?
- How were the comparators chosen, and why do they differ from the best baselines for S2 and N2?
- How do the baselines perform when given the same prior information?
Dear Reviewers,
Please take a moment to review the authors' responses and engage in the discussion when you have a chance, especially if the authors have addressed major concerns raised in your reviews. Thank you for your time and continued efforts!
Best,
AC