- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper proposes a training objective, Energy-DCDM, as an alternative to Residual DCDM. Unlike Residual-DCDM, E-DCDM weights spectral coefficients by eigenvalues. The paper compares the two methods on the Darcy2D and Screened Poisson2D setups.
Critical strengths
- The proposed change is conceptually simple and easy to insert into any learned conjugate-direction solver.
- The proposed training objective is well motivated mathematically. The authors clearly explain why minimizing residual error can underemphasize low-eigenvalue components of the solution error, and why maximizing energy decrease better aligns with their solver's exact line step.
- The authors carefully perform paired comparisons, which makes it easier to attribute any performance gains to the change in loss.
Critical weaknesses
- The experiments section is difficult to follow. The presentation feels disorganized. The main result, normalized ablation, 3D PDE experiments, resolution, and longer-run results are spread across the main text and appendix without any clear progression. A clearer explanation of the experimental setup and a consolidated results table would make the evidence easier to assess.
- Generalization across PDEs is limited. The main 2D results cover only 2 PDEs. A third PDE family would make a convincing case for the generalizability of the proposed method
- While the controlled comparison with Residual-DCDM is valuable, the practical benefit would be clearer with rigorous benchmarking against classical solvers. The appendix includes CG, Jacobi-PCG, and AMG, but the wall-clock comparison is limited to one Darcy batch and does not measure the full pipeline, including warm-start inference. A cost-to-accuracy comparison across more problems, tolerances, and suitable numerical baselines would better establish when the learned method is competitive. I would place these results in the main body.
Questions for authors
- In Fig.4, what does table and toilet mean?
2 comments
While the controlled comparison with Residual-DCDM is valuable, the practical benefit would be clearer with rigorous benchmarking against classical solvers. The appendix includes CG, Jacobi-PCG, and AMG, but the wall-clock comparison is limited to one Darcy batch and does not measure the full pipeline, including warm-start inference. A cost-to-accuracy comparison across more problems, tolerances, and suitable numerical baselines would better establish when the learned method is competitive. I would place these results in the main body.
Response. We extended the comparison to three settings (Darcy , Darcy , screened Poisson ; the same 32 cases each), targets on both field error and residual, batch sizes 32 and 1, and six methods: E-DCDM (E), Residual-DCDM, and CG and Jacobi-PCG, each from a zero and a neural warm start. Warm-start inference and the initial operator product are inside the timed region. We add CPU AMG (matrix access) as a stronger reference, and the elasticity family. In the revision this goes into the main body.
When E-DCDM is competitive. Against matrix-free solvers (operator products and diagonal only), E reaches every field-error and residual target we measured in 8 to 23 times fewer products than the faster of CG and Jacobi-PCG (15 to 23 times on every field-error target). To residual targets it is faster per case at batch 1 on all three settings and at batch 32 on both settings (a tie on Darcy ). At an equal product budget it is far more accurate but 2.2 to 5.3 times slower. The margin shrinks with grid size: from to , E's products to field error grow from 6 to 11, about as fast as Jacobi-PCG's (118 to 244), while eight E products go from 2.2 to 5.3 times the time of eight warm-start Jacobi-PCG products. So at batch 32 the residual-target speedup falls from 1.9x to a tie. We have not measured larger grids, and this trend does not support assuming a wall-clock gain there. With the assembled matrix, AMG is far more accurate than E on Darcy (mean field error after eight V-cycles versus after eight E products, when half of E's cases are already below ) and reaches E's elasticity error in eight V-cycles. A V-cycle costs several products, so we do not rank the two by work; when the assembled matrix is available, our data show no advantage for E over AMG. Without it, geometric multigrid is the natural baseline on our structured grids; we have not run it. We did not compare with sparse direct solvers.
Operator products until 16 of 32 cases reach relative field error (all 32 cases reach every target for every method)
| Problem | E | Residual | best CG / Jacobi-PCG | CPU AMG (V-cycles) |
|---|---|---|---|---|
| Darcy | 5 | 6 | 90 | not run |
| Darcy | 8 | 13 | 183 | 5 (all 32 by 6) |
| Screened | 3 | 3 | 50 | 4 |
At : 3/6/2 products for E versus 59/127/30 for the best Krylov method. We did not time field targets directly. E's batch-32 time at its field- budget was measured (1.00, 4.10 and 0.49 ms per case); linearly extrapolating the fastest classical method's timings from its two nearest measured budgets to 90/183/50 products gives about 1.7, 5.6 and 0.9 ms, so we estimate E is 1.4 to 1.8 times faster to field error at batch 32.
ms per case to relative residual (E / Residual / fastest classical)
| Problem | Batch 32, fixed budget | Batch 1, per-case stop |
|---|---|---|
| Darcy | 1.272 / 1.262 / 2.372 | 12.358 / 12.433 / 76.570 |
| Darcy | 7.788 / 8.287 / 8.143 | 27.617 / 29.650 / 165.723 |
| Screened | 0.492 / 0.485 / 0.772 | 6.348 / 6.327 / 22.027 |
- Residual target (Darcy uses E and Residual checkpoints trained at ): E needs 7/15/3 products versus 124/268/56 for the fastest-timed classical method. At batch 32, E is faster on both settings; the gap (4 to 5%) is a tie. The 3.5 to 6.2x batch-1 gap is single-case latency with a stopping check after every product, which favors methods that need few products.
- AMG: screened Poisson reaches residual in 4 cycles. We do not rank CPU V-cycles against GPU products by time.
Caveats: "fastest classical" is picked after measurement (zero-start Jacobi-PCG, except warm-start CG for screened Poisson at batch 1 and in the field-target estimate). Batch-32 times use the first fixed budget at which 16/32 cases reach the target. The field-target counts were measured after the timing study on the same cases, checkpoints and solver code. Upload, checkpoint loading and screened input normalization are not timed. We claim no general wall-clock advantage. The revision's supplement will add per-case times, every solver's settings and the timing scripts.
Response. "Table" and "toilet" are held-out ModelNet10 object categories. Each mesh defines a 3D conductivity operator, not a boundary condition. We will label the panels "ModelNet10 table / toilet conductivity operators" and say this in the caption.
Response. We agree. In the revision, Section 5 opens with one setup paragraph (problems, grids, budgets, seeds, splits) and the table below. Then 5.2 objective and normalizer controls, 5.3 transfer limits (resolution, 3D, elasticity) and 5.4 cost against classical solvers (next reply). The table gives relative errors after eight operator products for validation-selected checkpoints on the full test sets, averaged equally over four warm-start groups (FNO or U-Net, crossed with two warm-start training sets for Darcy or with in/out-of-distribution forcing for screened Poisson).
These test sets also informed method development. As a check, we fixed checkpoints and analysis, then generated 256 new Darcy masks with our Python reimplementation of the public field generator (not byte-identical to the original). E-DCDM's (E's) field error is 0.120, 0.098 and 0.098 times Residual-DCDM's for the three paired seeds, and all 16 warm-start networks favor E for every seed. The same check on screened Poisson with newly generated forcings gives 0.0960 [0.0916, 0.1005] for the validation-selected pair (same-seed pairs: 0.11 to 0.14).
Response. We added static SPD linear elasticity, built from meshes of the public SEAT2D-GNN dataset. It uses a graph network and a 12-function polynomial coarse normalizer. Results are on 174 held-out cases in 29 geometry groups, after seven corrections (fixed checkpoints, intervals over groups).
E's field error is 0.085 [0.079, 0.091] times Residual-DCDM's; each seed favors E in all 29 groups. Residual-DCDM's field error stays at its starting level (1.010; 1.007 for the retuned optimizer below; CG: 0.997 after seven products), although both Residual models lower the true residual (0.373 and 0.405): they reduce what they are trained on and leave the low-eigenvalue error that the energy objective targets. A Residual learning-rate/clipping sweep (selected on development data) leaves the ratio at 0.085. Training both 5x longer gives 0.043 [0.040, 0.045], or 0.048 when both objectives use learning rate 10−3; Residual-DCDM's field error stays at 0.96 to 0.98; true residuals tie (0.99).
Limits: E does not lower the true residual on elasticity (1.13 of its start after seven corrections, versus 0.37 to 0.41 for the 30-epoch Residual models), the expected trade when weighting low-eigenvalue error; CG and Jacobi-PCG reach 1.23 and 1.19 after seven products. So a residual tolerance cannot stop E on elasticity, but a label-free rule can: the exact energy decrease of each step gives a delayed lower bound on energy error (4 extra corrections). Stopping when it reaches 0.1 (picked post hoc from 0.3/0.2/0.1, delay from 2/4) took a median 14 products (90th percentile 24) and left field error at most 0.171 (2x the 0.0855 above) in 97% of 522 case-seed runs (median 0.068; true energy error about 0.2). On new 45-degree loads for the same 174 held-out cases, E transfers only partly: its field error after seven corrections is 0.58, still below Residual-DCDM's 0.99 (ratio 0.58 [0.53, 0.65]), but its true residual rises to 2.6 times its starting value (Residual-DCDM: 1.37), and coarse weighting gives no gain over uniform weighting there (1.005 [0.997, 1.013]). These are post-hoc tests on one family.