- Rating
- 4
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper presents DFK-Former, a Set Transformer-based method for reconstructing continuous, divergence-free 3D velocity fields from sparse, partial, or corrupted observations. Instead of optimizing divergence-free kernel (DFK) parameters separately for each flow field, the proposed network predicts them directly in a single forward pass. Besides, the authors introduce adaptive and anisotropic kernels using the Piola transform, and extend the framework to time-varying flows through shared spatial kernels and Fourier-based temporal coefficients.
The method is trained on procedurally generated flow fields and evaluated on synthetic benchmarks, real DNS data, and a qualitative experimental PIV example. The results show substantial improvements in reconstruction accuracy over existing methods, while preserving incompressibility by construction.
Critical strengths
- A simple and effective combination of learned priors and exact incompressibility.
- Effective extension of DFKs for better representative ability (anisotropy and non-zero net momentum).
Critical weaknesses
I have found only one critical weakness.
Currently, the temporal representation imposes an artificial periodicity constraint. Eq. (5) represents the time-dependent kernel coefficients and mean flow using a Fourier series on the normalized interval (). Consequently, the reconstructed velocity field necessarily satisfies This appears to introduce a representational limitation that is not discussed in the paper.
Questions for authors
- The proposed method introduces several improvements to the original DFK-Wen4, e.g., the mean-flow term, larger and multi-scale support radii, and anisotropic kernels. How much of the improvement over DFK fitting comes from these changes rather than learned parameter prediction? How does a per-instance fitting baseline using exactly the same kernel geometry and representation as DFK-Former perform?
- How are sparse, partial, or irregular observations provided to FNO and HDNet-3D?
- The temporal benchmark evaluates reconstruction at unobserved intermediate frames. How exactly are the per-frame DFK fitting results obtained at these frames?
3 comments
(Part 2/2)
Q2 — Inputs to FNO and HDNet-3D. Both receive the samples on a 32³ grid. FNO gets a trilinear splat with zeros in empty cells, plus an occupancy channel. HDNet-3D gets a trilinear splat (weighted average per cell) plus a finite-difference divergence channel, following HDNet; a 3D U-Net then regresses the field directly, with no projection layer or divergence penalty. Details, and a stronger RecFNO-style encoding, are in general response point 3 (Table R2).
Q3 — Per-frame DFK at unobserved frames. Per-frame DFK fits each observed frame on the fixed kernel layout and linearly interpolates the coefficients (ω, v̄) between the bracketing frames. With a shared layout, this equals linear interpolation of the fields and stays exactly divergence-free. Shared-kernel DFK (Ni et al.) jointly optimizes one geometry with per-frame weights over the sequence (Adam) and interpolates the weights the same way. The 15/180 failures of per-frame fitting are near-singular solves under the most severe corruption. Appendix B now describes both procedures. The new static DFK-Former control (Table R7, reply to Reviewer iPim) uses the same interpolation. It shows that the learned spatial prior accounts for most of the gain over per-frame fitting (0.767 → 0.124), with temporal fusion adding about 9 % (0.114).
Thank you for the clarification! I am glad to keep my original score.
Response to Reviewer n5Zy (Part 1/2)
Thank you for the review and for pinpointing the periodicity issue. Your weakness and Q2 are shared with other reviewers and answered in the general response (points 1 and 3, with the notation); we summarize them here.
Weakness — Periodicity of Eq. 5. You are right, and it matters here because both window ends are observed. Only ω_k(t) and v̄(t) vary in time, so any basis keeps exact incompressibility, and the revised Eq. 5 admits any temporal basis. The measured cost is a 6 % endpoint excess, mostly a boundary effect that non-periodic bases share, and no non-periodic basis is significantly better per window (Table R1). Section 6 states the limitation.
Q1 — Basis improvements vs. learned prediction. The paper gave a partial answer. Against ridge fitting in DFK-Former's own anisotropic basis (Table 15), the learned model is 15.8–38.0 % better at the hardest sweep settings, and even K=32 DFK-Former (0.281) beats both DFK fits of Table 1. These two fits already use our overlapping radius 3.5Δ, without the mean flow: the fixed-kernel fit (0.689) is the 3.5Δ rung of Table R8 without v̄ (0.458 with it), and the adaptive fit (0.546) is Ni et al.'s iterative optimization of centers and radii, started from that layout. Table R8 starts instead from DFK-Wen4 at Ni et al.'s own radius and adds our changes one at a time, with the same per-instance ridge solver on all 582 fields.
Table R8. Macro EPE over the 11 sets. Every fitted row solves for the kernel weights by ridge-regularized least squares on the observed samples; the two columns differ only in how the ridge strength λ is chosen. Oracle ridge: one λ per set, picked from a grid by its error against the ground-truth target. A real fit cannot see the target, so this is a best case for the fits. CV ridge: λ picked per field by 5-fold cross-validation on the observed samples only, never using the target, as a practitioner would. DFK-Former fits nothing, so both columns are equal.
Your second question, a per-instance fit with exactly DFK-Former's geometry and representation, is answered by the row "DFK-Former's predicted geometry, ridge-fitted weights": 0.337 (0.345 with the CV ridge), against 0.120 when the network also predicts the weights.
Main findings.
Takeaway. When fitting per instance, the representation changes account for most of the gain over the original DFK basis. Learned prediction then lowers the error about threefold (0.362 → 0.120), mainly through the weights. Given a learned predictor, an unconstrained decoder reaches similar accuracy (Table R4, reply to Reviewer 6YrL), so the DFK head's role is exact incompressibility at no accuracy cost, plus locality and efficient evaluation. Neither the representation nor learning alone is sufficient.