- Rating
- 4
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper presents INO, a data-free PDE operator trained through alternating one-dimensional linear solves, with residual error bounds for coercive problems. Experiments on 1D–3D PDEs demonstrate efficient training and accurate predictions compared with physics-informed neural operators.
Critical strengths
I believe that constructing neural operators in a reduced solution space is a valuable direction, and this paper provides a practical realization of that idea. The separated representation expresses the solution through compact spatial factors whose coefficients depend on the input parameters. This structure makes the parametric PDE more tractable: weak-form training proceeds through alternating one-dimensional solves, and a new prediction is evaluated by contracting the learned factors. I particularly appreciate that the representation directly informs how the problem is solved. Reducing the complexity of operator learning in this way has substantial practical value for applications that require many solutions within a PDE family.
The data-free construction further strengthens this contribution. The spatial and parametric factors are learned from the governing equations without first generating reference solution trajectories. This avoids an expensive preliminary step that can limit the usefulness of a learned surrogate. The paper also examines solving a small projected system for the modal coefficients while retaining the learned spatial space. The resulting accuracy improvements help demonstrate that the reduced representation captures useful solution structure and can support different choices in the trade-off between evaluation cost and accuracy.
Overall, I find the practical value more consequential than the degree of methodological novelty. A useful reduced-space operator that is inexpensive to construct and evaluate can be valuable to the community even when it builds on established numerical ideas. I believe this paper demonstrates enough of that value to support acceptance.
Critical weaknesses
The methodological novelty appears incremental when viewed alongside established reduced-order approaches such as POD. Representing solutions in a compact space and determining input-dependent coefficients is a familiar strategy. The separated factors and alternating training procedure are more directly related to PGD and low-rank tensor methods. I therefore would not regard the reduced-space principle itself as a fundamentally new numerical idea. The contribution lies in making this structure work effectively as a data-free solution operator, with a practical training and evaluation procedure. For further improvement, I would suggest making this practical positioning particularly clear. Explaining how the construction of the reduced space and the evaluation of its coefficients relate to traditional reduced-order methods would help readers understand the contribution.
Questions for authors
None that would change my current acceptance recommendation.
Thank you for the positive assessment and helpful suggestion. We agree that we should explain the practical value and the relation to PGD, POD and reduced-basis methods more clearly.
Following PGD/INN-TD, INO builds a separated space from the weak form without any training data/solution snapshots. We can evaluate the coefficients directly from the trained factors, or solve a small Galerkin system on the spatial modes (the reduced solve). We use the standard residual bound for certification. Since the residual is computed with the original input, the bound also includes the input-approximation error.
We added a comparison with POD using the same discretization, reduced solve and certificate. For the largest problems in the paper (3D at 129³, S=164, about 2 million unknowns), INO reaches similar accuracy at a lower cost, without solved inputs. The table gives within-domain error and total offline time (estimated for POD), with every step on one CPU core:
For these INO results, we removed a step that scaled with S² from the 3D code. Training is faster with unchanged accuracy, and we will update Tables 1 and 4. POD time includes the full solves, POD and projection of the operator terms onto its modes. We estimate it from a few timed solves and a sample of timed terms. POD becomes more accurate with more data (1.7e-5 and 3.6e-4 with 320 solved inputs). In 2D, where a full solve takes milliseconds, POD matches INO with about 80 solved inputs at a lower cost.
The reduced solve also improves INO without retraining. At 65², using 100 KL modes for the input field, the mean relative L2 error on all inputs drops from 1.07e-2 to 1.7e-4. At 129³, it drops from 1.42e-2 to 1.6e-3 for diffusion and from 1.76e-3 to 5.8e-5 for Helmholtz. Checking the bound with the original field certifies 99% of the 2D inputs at a 3% relative energy-error tolerance.
This comparison helps explain the practical value: in 3D, INO builds a space of similar accuracy to POD at a lower cost. We can then use the same space for fast direct predictions or more accurate reduced solves. We will add the comparison and clarify this point in the revision.