- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
To address performance gaps on large-scale CFD meshes while maintaining low computational cost, the authors propose the Importance-Balanced Operator (IBO), which uses an importance-weighted KD-tree to allocate latent tokens in proportion to spatial physical complexity.
Critical strengths
-
The paper mathematically proves that allocating latent tokens in proportion to spatial physical complexity () minimizes the decoder resolution error bound, providing a solid theoretical foundation for physics-informed tokenization.
-
On industrial-scale 3D benchmarks (e.g., DrivAerML and UrbanWind with millions of mesh points), IBO matches or exceeds the predictive accuracy over state-of-art methods
Critical weaknesses
-
The paper emphasizes scaling to industrial-scale CFD meshes; however, key industrial engineering metrics (e.g., pressure distributions, skin friction, and surface drag/lift forces) rely predominantly on accurate surface-field predictions. On datasets such as DriverNetML, IBO performs worse on surface pressure fields. I feel like that a primary reason for this limitation is that IBO’s weighting mechanism () on locally refined meshes relies entirely on the node distribution of the input CFD mesh, effectively outsourcing the estimation of physical difficulty back to the human mesh generator. Consequently, the paper’s claim of bridging the performance gap between spatially localized and globally-resolved models remains largely unsolved for surface data. So it seems that this method appears restricted to fluid flow problems rather than general operator learning.
-
The authors use an axis-aligned, weighted KD-tree to partition 3D spaces. However, orthogonal bounding-box splits cut arbitrarily across complex 3D curved surfaces, thin boundary layers, and non-axis-aligned geometries. Considering that, the paper lacks a literature review on domain decomposition and spatial partitioning in scientific machine learning, raising concerns about whether alternative geometric decomposition schemes were adequately evaluated. Furthermore, given that local mesh resolution in adaptive CFD grids directly reflects regional physical difficulty, can local resolution itself be used directly to infer physical difficulty without relying on hand-crafted distance heuristics? With that, I think at least 2-3 baseline is missing: 1) Use mesh density directly to partition; 2) existing method for complex geometry such as PGD-NO (https://openreview.net/forum?id=h5vFCxA37Y). Also, the literature review of domain partition / reducing memory requirement of a neural operator (for instance the PGD-NO [1], SMART[2]) is also required to be added.
[1] Zhong, W., Bi, J., Oancea, V., & Meidani, H. (2026). PGD-NO: A Neural Operator with Precomputed Geometry Decomposition for 3D Million-scale Physics Simulations. Proceedings of the 43rd International Conference on Machine Learning
[2] Hagnberger, J., & Niepert, M. (2026, January). SMART: Scalable Mesh‑free Aerodynamic Simulations from Raw Geometries using a Transformer‑based Surrogate Model. In Forty-third International Conference on Machine Learning.
- Taking Points 1 and 2 together, the primary empirical advantage of IBO appears confined mainly to fluid volume field predictions, which limits the overall novelty and practical impact of the work for real-world design decisions. Could the authors clarify how this framework extends beyond steady-state external fluid flows? Specifically, in many engineering domains (e.g., structural mechanics, dynamic shock waves, coupled multiphysics, or dynamic time-dependent flows), defining a scalar "importance score" requires deep domain-specific knowledge and can be highly non-trivial or time-varying.
Questions for authors
Please see my Critical Weaknesses for my questions.
7 comments
Response to Reviewer 4wGK
1-2. Outsourcing difficulty to the mesh generator. We do agree with the reviewer's insight that the definiton of the importance measure may still depend on the human mesh generator. In particular, we highlight that where a refined mesh exists with insights from a domain expert, its density is not arbitrary and should indeed be utilized as prior. Meshes are built or adapted to equidistribute an error indicator, through wall-spacing targets, wake and gap refinement or a-posteriori adaptation (Huang & Russell, 2011). The mesh density is thus the best available difficulty prior, and it is free at inference, although it may seem that this appears to outsource the estimation of field complexity back to the human expert. Nonetheless, our work is focused on adddressing how the latent layout should be designed for such models. Other methods can be designed to predict such physical field complexity, and we agree is an important future direction.
Crucially, Eq. 11 also shows that an approximately correct prior costs only a second-order penalty, meaning that simple priors can also be effective. IBO does not necessarily require a perfectly designed mesh from a human mesh generator. For example, UrbanWind's mesh is nearly regular (Cartesian with wall snapping), a fairly typical meshing strategy when the human mesh generator has little insight to offer, and the mesh carries correspondingly little prior. Hence, the importance comes from the geometry alone, through the wall-distance weight of Eq. 23. Unit weights already beat the uniform grid on all six channels, and the geometric weight improves all six further.
We will further include this in the Discussion as an important future direction.
2. The authors use an axis-aligned, weighted KD-tree to partition 3D spaces. However, orthogonal bounding-box splits cut arbitrarily across complex 3D curved surfaces, thin boundary layers, and non-axis-aligned geometries. Considering that, the paper lacks a literature review on domain decomposition and spatial partitioning in scientific machine learning, raising concerns about whether alternative geometric decomposition schemes were adequately evaluated.
Unlike the typical use of KD-tree for spatial partitioning, we note that the KD partition here is not meant to fit or delineate actual physical boundaries. It decides (i) where the latent points lie and (ii) which points each token summarizes. Leaves are small where the importance is high: on DrivAerML, the near-wall read-out distance is 2.3 cm, against 86 cm for a uniform grid of the same budget (Table 16). Boundary geometry enters through the features rather than the cell shapes, since every member and query carries its signed wall distance and wall direction (App. C.2, D.3). Reconstruction also ignores the leaf boundaries: each query reads its nearest tokens across the cuts, with distances normalized by the local spacing (Eq. 22), so a cut through a boundary layer does not produce a discontinuity in the prediction. Our current implementation therefore does not suffer from the typical issues such split-cuts may encounter where no additional featurization (in the latent tokens) is provided.
Literature. Hence, there are specific differences to what is typically used from spatial partitioning, but we do agree that a more detailed literature review is lacking here. We will include additional Related Work on domain decomposition and spatial partitioning:
- quadtrees/octrees and AMR-Transformer: fixed geometric splits, refinement from the solution on structured grids, a variable number of tokens;
- NUNO: a KD-tree into a few subdomains for grid-based operators;
- Erwin: a balanced ball tree that keeps every point as a token;
- PGD-NO: a sharp-edge decomposition of the surface mesh into geometry tokens;
- SMART: a mesh-free model that encodes the raw geometry;
In particular, we think it worth highlighting that IBO differs by partitioning the mesh points by importance mass. This leaves no empty cells on non-convex multi-body domains, gives a fixed number of tokens, and realizes the density of Prop. 4.2.
Response to Reviewer 4wGK
3. Furthermore, given that local mesh resolution in adaptive CFD grids directly reflects regional physical difficulty, can local resolution itself be used directly to infer physical difficulty without relying on hand-crafted distance heuristics? With that, I think at least 2-3 baseline is missing: 1) Use mesh density directly to partition; 2) existing method for complex geometry such as PGD-NO (https://openreview.net/forum?id=h5vFCxA37Y).
Yes, and this is IBO's default: on AirfRANS, TandemFoilSet and DrivAerML every weight is 1, so every leaf holds the same number of mesh points and the partition follows the mesh density, with no distance heuristic. The distance weight is used only on UrbanWind, whose mesh carries no refinement prior; Table 6 compares the two weightings there (discussed in Point 1 above).
3-1. Mesh density used directly, without the KD partition.
Drawing the latent points at random from the mesh cells follows the mesh density in expectation, without any partition. By using a single, consistent IBO model, we investigate the impact of changes to the choice of latent layout. The 32,768 latent points are drawn uniformly from the volume mesh cells (akin to AB-UPT's scheme):
| Latent layout | Tokens | ||||||
|---|---|---|---|---|---|---|---|
| Uniform grid | 32,768 | 8.86 | 10.98 | 9.02 | 6.58 | 0.827 | 0.730 |
| Mesh-uniform sampling | 32,768 | 4.42±0.02 | 6.87±0.05 | 6.24±0.08 | 4.49±0.06 | 0.959±0.003 | 0.976±0.004 |
| IBO, KD-tree | 32,768 | 3.86±0.03 | 6.11±0.01 | 5.68±0.02 | 4.13±0.02 | 0.961±0.007 | 0.975±0.004 |
Read from top to bottom:
- Uniform grid → mesh-uniform sampling: the errors fall by 31–50%. In expectation, sampling inherits the mesh density, which is the presumed optimal density of Prop. 4.2.
- Sampling → KD-tree: at the same expected density, sampling remains 9–15% above the KD-tree on every field error, although the impact is within seed variation for . The difference is much smaller than the performance gains relative to the use of a uniform grid as expected. We further discuss this below.
Why the KD-tree is better at the same density. All 3 methods being compared use the same number of tokens. The uniform grid ignores the importance measure, whereas mesh-uniform sampling and the KD-tree both inherit the prior from the mesh construction. However, mesh-uniform sampling has the optimal density of Prop. 4.2 in expectation, whereas the KD-tree realizes it at leaf scale (Eq. 12). An additional difference lies in the distances. This is consistent with Section 4.1, which bounds the error through the spatial extent that each local representation must cover (Eq. 6; Appendix B for the encoder): the farther a point lies from the latent points that encode and reconstruct it, the larger its error. Under a second-order criterion, the mean squared distance between the points and the latent points that serve them, the optimal placement of a fixed number of latent points is the k-means solution, in which every latent point sits at the centroid of the points it serves (Lloyd, 1982; Gersho, 1979, Sec. IV). A sampled latent point is a single mesh point, not the centroid of a group of points. Every one of the 32,768 sampled points is therefore offset from the centroid of its neighboring points, such that there is systematic error. The KD-tree instead places every latent point at the weighted centroid of its leaf (Section 5), deterministically and with median splits alone, so it keeps this property of the k-means solution without the k-means iterations that are prohibitive on points.
Read-out distance by wall distance. As in Figure 4a, we split the test volume points into three equal-count bins by wall distance (which we will include in Appendix D.6 of the revision). The read-out distance , the mean distance from a query to the 16 latent points it reads, is 3% shorter with the KD-tree than with mesh-uniform sampling in the near and middle bins, and the error of IBO is 7–11% lower in every bin.
Response to Reviewer 4wGK
We thank the reviewer for the careful assessment and provide our responses below.
1. The paper emphasizes scaling to industrial-scale CFD meshes; however, key industrial engineering metrics (e.g., pressure distributions, skin friction, and surface drag/lift forces) rely predominantly on accurate surface-field predictions. ... I feel like that a primary reason for this limitation is that IBO’s weighting mechanism on locally refined meshes relies entirely on the node distribution of the input CFD mesh, effectively outsourcing the estimation of physical difficulty back to the human mesh generator.
We acknowledge that surface fields and integrated forces can be important for design, and that IBO is not the best model on them across all our benchmark problems. Interestingly, on the 2D benchmarks, IBO is best on the surface: 0.0006 vs 0.0011 (AB-UPT) on AirfRANS, and 9–40% below the best alternate baseline model on all five TandemFoilSet subsets. However, this is not true for the 3D benchmarks.
While re-examining DrivAerML, we found that Table 3 of the submission was not computed under a single protocol as the baseline rows taken from Transolver-3's table mix magnitude errors (∣u∣, ∣τ∣) with vector errors (u, τ). We provide the corrected comparison under both Transolver-3 and AB-UPT evaluation protocols here, and will update the manuscript accordingly:
Under AB-UPT's protocol, IBO is almost level with AB-UPT on the surface fields (ps 3.87 vs 3.82, τ 7.23 vs 7.29). We note that under the same evaluation protocol used by Transolver-3, we no longer see any large performance difference, being only 4% behind Transolver-3 on the surface fields. It is also competitive with Transolver-3 on the UrbanWind problem, showing that IBO does not have a systematic weakness for surface prediction relative to other state-of-the-art models currently. Nonetheless, we do acknowledge that IBO's surface-pressure error on UrbanWind is twice AB-UPT's (0.0023 vs 0.0012).
We believe the 3D surface gap comes from how we allocated the budget, not from inherent limitations in the model:
Given the larger discrepancy in surface-pressure error relative to AB-UPT, we are training IBO on UrbanWind with 32,768 tokens (AB-UPT's anchor count) as a fairer comparison. Related to your helpful suggestion regarding the current weighting mechanism neglecting surface data, we have modified the model such that surface points are now included in the importance measure with a higher weight, the wall-distance cap is lowered from 2 m to 0.2 m, and half of the supervised points lie on the surface, as in AB-UPT. We will post the results subsequently, to provide insight into whether this was indeed the reason for the discrepancy in performance, and will update our manuscript accordingly.