- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper introduces GLaDiT, a graph-native latent Diffusion Transformer for predicting unsteady fluid trajectories on unstructured meshes. A pretrained, frozen graph autoencoder compresses velocity and pressure fields onto a coarse mesh, where a conditional diffusion model jointly generates future frames rather than advancing them autoregressively. Its main architectural contribution is graph-local spatiotemporal attention: each token attends to all temporal slots within its one-hop spatial neighborhood, while stacked layers expand spatial dependencies. This combines joint trajectory generation with native mesh representations without intermediate Cartesian-grid projections.
Validation covers 64-frame forecasts on transonic airfoil and incompressible cylinder-flow datasets, comparing against MGN, EAGLE, AROMA, and Text2PDE. The reported results show strong airfoil accuracy across field and derivative metrics, competitive cylinder-flow performance, and an 18.5-fold reduction in peak inference memory relative to Text2PDE on Airfoil. Attention and sampling ablations further examine training efficiency and trade-offs between accuracy and inference cost.
Critical strengths
- A coherent framework for joint trajectory prediction on unstructured meshes:
GLaDiT combines graph-based latent representations with joint temporal diffusion, avoiding intermediate Cartesian-grid projections and autoregressive feedback within the forecast window. Its graph-local spatiotemporal attention provides a practical mechanism for coupling mesh connectivity with full-window temporal context. This is consequential because it addresses a meaningful limitation of existing approaches while preserving the geometry of the simulation domain.
- Evidence of useful accuracy and computational benefits:
On Airfoil, the reported improvements extend beyond velocity and pressure to vorticity, divergence, and enstrophy, supporting the quality of the predicted spatial structure. The framework also reduces peak inference memory by approximately 18.5× relative to Text2PDE, while attention ablations demonstrate substantially faster training updates than full attention. These results strengthen the case that the architectural choices offer practical benefits beyond a conceptual combination of existing components.
Critical weaknesses
1.Limited validation of the claimed benefits for time-related prediction:
The paper motivates GLaDiT by the accumulation of errors in autoregressive prediction, but addresses this issue by jointly generating a fixed temporal block. The experiments evaluate only 64-frame forecasts, which demonstrate performance within that window but do not establish an advantage for substantially longer horizons. In particular, it remains unclear whether accuracy can be maintained when enlarging the prediction window, how the associated computational cost scales, or whether error accumulation reappears when successive blocks are chained. This limits the evidence supporting the paper’s central motivation.
2.Limited benchmark coverage and insufficient comparison with closely related graph generative models:
The evaluation is restricted to two 2D flow benchmarks, Airfoil and CylinderFlow. Although these involve distinct flow regimes, they provide limited evidence that the proposed architecture generalizes across broader geometries, spatial dimensions, and dynamical systems. AROMA evaluates multiple time-dependent PDE settings, while related graph generative methods—including DGN/LDGN (ICLR 2025), PIFM-GN (AAAI 2026), and CGFM (ICML 2026)—provide broader validation across flow tasks and 2D/3D settings. Additional benchmarks would strengthen the evidence for GLaDiT’s applicability.
Furthermore, although GLaDiT adopts the graph autoencoder from LDGN, the empirical comparison lacks a closely related graph diffusion baseline adapted to the same initial-condition-dependent forecasting task. The original DGN/LDGN models target equilibrium-state distributions and are therefore not directly comparable without adaptation. Nevertheless, a suitably conditioned temporal extension using the same latent representation would help isolate the benefit of GLaDiT’s Transformer and graph-local spatiotemporal attention from that of the underlying graph compression. Without such a comparison, the incremental contribution over existing graph generative architectures remains insufficiently established.
Questions for authors
Is GLaDiT intended only for a fixed 64-frame forecast window, or can it support substantially longer predictions through larger windows or successive prediction blocks? If longer-horizon evaluations are available, do they show a sustained advantage over autoregressive baselines at comparable inference cost? This would help determine whether the reported benefit extends beyond joint prediction within the evaluated window.
3 comments
I thank the authors for their detailed rebuttal and additional clarifications. However, after carefully considering both the individual response and the general response, I find that my main concerns remain insufficiently addressed. Therefore, I have decided to maintain my original assessment and score.
First, the central concern regarding long-horizon prediction remains unresolved. The authors emphasize that generating 64-frame blocks reduces the number of autoregressive handoffs and allows computational cost to scale linearly with the prediction horizon. However, reducing the number of handoffs does not necessarily prevent error accumulation across successive prediction blocks. The proposed block-wise composition is supported by theoretical arguments rather than direct experimental evidence. As the authors acknowledge, multi-block prediction and evaluation remain future work. Consequently, the reported results demonstrate the advantages of joint prediction within a fixed 64-frame window, but do not establish that these advantages persist over substantially longer horizons.
Second, the experimental validation remains limited in scope. I acknowledge the additional clarification regarding variations in mesh topology, cylinder position, and radius. Nevertheless, these variations primarily demonstrate generalization within the same problem family, rather than across substantially different geometries, PDE systems, or spatial dimensions. The broader applicability of the proposed framework therefore remains insufficiently established.
Third, I appreciate the clarification regarding the Temporal GNN diffusion baseline and the additional architectural ablations. These comparisons provide useful evidence for the contributions of the proposed components and partially address my concern regarding related graph generative architectures. However, they do not resolve the limitations concerning long-horizon prediction and broader validation.
Overall, while the rebuttal provides useful clarifications and supporting results, it does not fundamentally change my assessment of the paper's main limitations. I therefore maintain my original score.
Thank you for your thoughtful follow-up. While we appreciate your perspective, the concerns raised regarding multi-block forecasting and cross-domain transfer evaluate a different problem formulation than the one investigated in this paper. Our central research question is whether a generative model can jointly synthesize an entire flow trajectory on its native unstructured mesh from a single observed initial state. The conditioned temporal GNN ablation you acknowledged directly isolates and confirms our denoiser contribution for this task.
Forecast horizon. GLaDiT predicts all 64 future frames jointly and achieves the lowest frame-64 validation velocity error among all evaluated methods on both benchmarks (Tables 18 and 24). Evaluating recursive error accumulation across chained blocks fundamentally changes the task from initial-state forecasting to autoregressive rollout on model-predicted states. Doing so rigorously requires substantially longer reference trajectories and matched-cost baselines trained for extended horizons. Even two consecutive blocks require 129 frames including the initial condition, whereas both official benchmarks contain only 75 frames and offer no baseline reference for multi-block handoffs. Consequently, the 64-frame benchmark is the exact, scientifically appropriate testbed for our single-window claims.
Geometric and physical scope. On CylinderFlow, a single trained model generalizes to unseen meshes across a 1,200-mesh family with varying topologies, cylinder positions, and radii, while Airfoil evaluates the same architecture on transonic compressible flow with shock waves. Expanding validation across arbitrary obstacle families, distinct PDE systems, or three-dimensional domains would require substantial resources to curate new datasets, redesign mesh representations, and train matched baselines for every setting, efforts that lie beyond the scope of a focused academic study. Treating exhaustive cross-domain coverage as a prerequisite conflates follow-up engineering scale with the core methodological contribution already demonstrated here: joint trajectory diffusion on native unstructured meshes across two distinct flow regimes.
Response to Reviewer tEQE
Thank you for your careful review and constructive feedback.
Longer prediction horizons and matched-cost comparisons
Generating 64-frame blocks eliminates intra-window drift and reduces long-horizon autoregressive handoffs by 64× at linear compute cost. Within the 64-frame window, stepwise rollouts accumulate severe error across 64 recursive feedbacks: MGN's error rises 3.3× from frame 24 to frame 64 on Airfoil and 1.9× on CylinderFlow. A single GLaDiT pass instead achieves the lowest frame-64 validation error on both benchmarks (Tables 18 and 24) and beats four-sample AROMA on Airfoil at comparable latency (1.41% in 2.85 s vs. 1.60% in 2.15 s, Table 11; CylinderFlow latencies in Tables 10 and 13).
For extended horizons 64mΔt, semigroup composition (ΦmH=ΦH∘m; "Longer prediction horizons" in our General Response and Section 7) chains m blocks with only m handoffs instead of 64m stepwise feedbacks, keeping compute O(m) and attention memory constant rather than O((mH)2). Because both official benchmarks store only 75 stride-8 frames per trajectory (e.g., 6 s total vs. 5.12 s per block on CylinderFlow) and lack a second 64-frame target block, multi-block training with noisy-history conditioning requires longer trajectory datasets left to future work.
Broader benchmarks and geometric coverage
Held-out test evaluations and 1,200-mesh CylinderFlow variation establish generalization across flow regimes and unstructured discretizations. On the official 100-trajectory test sets of all external baselines (Table 28; reproduced in our Response to Reviewer 83gV), GLaDiT achieves the lowest Airfoil test error (1.3771% vs. 1.5643% for AROMA). These held-out results confirm generalization from incompressible vortex shedding to compressible transonic shocks.
Moreover, GLaDiT is not restricted to a single fixed mesh: all 1,200 CylinderFlow trajectories have distinct unstructured meshes (1,732 to 2,059 physical nodes, 3,226 to 3,884 cells, and 118 to 156 coarse nodes) alongside varying cylinder positions and radii ("Mesh variation and geometric coverage" in our General Response). Extending this graph-native framework to multi-shape pretraining (cf. equilibrium generators such as LDGN, PIFM-GN, and CGFM), additional PDE families (such as AROMA's periodic scalar or spherical tasks), and 3D aerodynamics requires dedicated representation pretraining and matched corpora left to future work.
Conditioned temporal graph-diffusion baseline
GLaDiT's gains come from explicit spatiotemporal attention rather than the shared autoencoder. Adapting LDGN,
Temporal GNN diffusionshares our frozen representation, initial state, diffusion loss, and sampling budget (Section 6.3). GLaDiT cuts test UV error from 15.0585% to 7.4636% on CylinderFlow (-50.44%) and from 1.9431% to 1.3771% on Airfoil (-29.13%) (Table 2).This gap reflects a structural modeling bottleneck in channel-stacked GNNs. Extending static LDGN to trajectories stacks the 64 future frames into node-feature channels of a multiscale graph U-Net, mixing time only through local MLP channel projections without cross-time token attention. On Airfoil, even after the temporal GNN's training loss and validation error fully plateau (Figure 13), its test error remains stuck at 1.9431% (worse than EAGLE's 1.8741%, Table 28), demonstrating that explicit spatiotemporal token attention across time and graph neighborhoods is essential to unlock latent trajectory diffusion.