- Rating
- 1(−1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper attempts to introduce a new direction of test-time scaling for solving PDEs that enables efficient inference of trained neural operators through adaptive spatial sampling. Furthermore, the paper proposes three dynamic test-time sampling methods for efficient inference. Experiments on eight benchmarks show that introducing dynamic test-time sampling can substantially reduce the inference cost while largely maintaining the performance of the trained Transolver.
The reviewer appreciates the motivation of this work and believes that the problem studied in this paper has the potential to become a worthwhile research direction. However, the current experiments do not yet sufficiently demonstrate the necessity and importance of this direction. In addition, several important inference details are missing. Therefore, the reviewer does not believe that the paper has reached the acceptance standard in its current form.
Critical strengths
- The paper is easy to follow.
- The problem is well motivated.
- The experiments cover eight benchmarks and are relatively comprehensive.
Critical weaknesses
- The paper makes a key implicit assumption that test-time sampling is an important and worthwhile direction to study. However, beyond the intuitive motivation, the paper lacks sufficient experimental evidence to justify this premise. In particular, if the goal is simply to show that introducing dynamic test-time sampling can improve the inference efficiency of Transolver, then more efficient Transolver-based methods, such as LinearNO, which not only significantly improve efficiency but also achieve better performance, should be considered as important baselines. On the other hand, if the more fundamental claim is that reasonable test-time sampling methods provide an effective way to improve the inference efficiency of already-trained neural operators, then the evaluation should be conducted on different trained backbones, similar to how pruning methods are usually validated across multiple model architectures, rather than only on Transolver. Considering that the community has not yet established a common understanding of test-time sampling, while the authors claim “the first systematic exploration of adaptive spatial sampling as a new axis of test-time scaling for neural operators,” the reviewer considers this a very important issue. Therefore, the motivation should be supported not only by intuitive arguments in the introduction, but also by sufficient experiments.
- The paper lacks experimental validation of another important question: how does AdaSolver behave when the same problem is represented with different observation densities, and how does its final performance change accordingly? Answering this question would provide a more continuous evaluation of the authors’ important motivation that different physical regions may require finer or fewer observations depending on their physical properties. The reviewer believes that a series of experiments on Darcy (85x85, 141x141, 211x211, and other resolutions as in Table 10 of the original paper of Transovler) with different observation densities could partially answer this question and further reveal whether AdaSolver exhibits some consistent behavior across observation densities. For example, does the sampling density consistently remain low in smooth regions, while the number of sampled points near boundaries or other critical regions continues to increase as the observation density increases?
- The authors explicitly mention full-field evaluation in multiple places. However, it is unclear how AdaSolver reconstructs the full-field prediction from the retained points. If the reviewer has missed the corresponding description, the authors are encouraged to point it out. Otherwise, the reconstruction method should be described in sufficient detail so that the actual inference pipeline of AdaSolver can be clearly understood and reproduced.
- Minor weakness: the formatting before equations is not fully consistent. Most descriptions before equations end with a blank space, while some use a colon, such as Equation 12, and some use a comma, such as Equation 4. The reviewer suggests making the formatting consistent throughout the paper.
Questions for authors
Please refer to the weaknesses above. If the authors can sufficiently address the weaknesses, the reviewer would consider raising the score.
5 comments
3. Effect of grid resolution on Darcy
We evaluated Darcy at resolutions of , , and . All three policies improve upon Uniform at every resolution. However, the relative gains diminish: CPG and CA reduce rAUEC by approximately 36%, 11%, and 6.3%, respectively, across these resolutions.
| Method | Original paper () | ||
|---|---|---|---|
| Uniform | 1 | 1 | 1 |
| PI | 0.9965 ± 0.0177 | 0.9715 ± 0.0033 | 0.9699 ± 0.0127 |
| CPG | 0.6419 ± 0.0049 | 0.8906 ± 0.0100 | 0.9368 ± 0.0046 |
| CA | 0.6400 ± 0.0062 | 0.8904 ± 0.0100 | 0.9369 ± 0.0046 |
Darcy offers limited geometric cues, and denser grids may allow uniform sampling to capture most relevant information, reducing AdaSolver’s relative gains. This remains a challenging setting, while our CFD benchmarks with richer geometric structure show substantial benefits.
4. Full-field reconstruction
We agree that the reconstruction procedure was insufficiently described. During inference, each method predicts physical quantities at its selected points. To compare their accuracy fairly, we interpolate these predictions onto the same full reference mesh. The reconstructed fields are used to compute field errors or integrated aerodynamic quantities.
The reconstruction methods are:
- Airfoil, Pipe, Plasticity, SuperWing, Darcy, and Elasticity: piecewise-linear interpolation within the convex hull of the retained points, with nearest-neighbor assignment outside the convex hull.
- ShapeNet-Car: four-neighbor inverse-distance interpolation, using a distance-weighted average of the four nearest retained predictions.
- DrivAerML: nearest-neighbor assignment, using the prediction at the nearest retained point.
Within each benchmark, all sampling methods use the same reconstruction procedure. We have added these details to the appendix.
5. Manuscript revisions
We have improved the manuscript’s writing and standardized the punctuation before equations throughout the paper.
References
[1] Hu, W., Liu, S., Qiao, P., Sun, Z., and Dou, Y. Transolver Is a Linear Transformer: Revisiting Physics-Attention Through the Lens of Linear Attention. arXiv:2511.06294.
Thank you for the response. Despite the considerable effort, the authors did not directly address the questions. In addition, the reviewer has further concerns about this work. The writing issues remain.
- Thank you for clarifying that the core motivation is to speed up inference. Therefore, it is necessary to compare AdaSolver with methods that are more efficient than Transolver at inference. However, the authors only added a comparison of LinearNO performance under the setting of this paper. There is neither a direct comparison of inference speed nor any performance result beyond rAUEC.
- Thank you for the additional experiments on Darcy. However, the authors only reported the results without answering the question that the reviewer is most concerned about: whether AdaSolver exhibits some consistent behavior across observation densities. The reviewer suggests that the authors describe and compare the behavior of AdaSolver across resolutions, rather than only comparing performance.
- Thank you for adding the description of reconstruction. However, the response is confusing. Why are different full-field reconstruction methods used on different benchmarks? This further leads to two additional questions: (1) Why is interpolation still applicable when the sampling ratio is only 37.5%? (2) Why do the authors not comprehensively report full-field prediction results on the benchmarks, but instead use indirect metrics such as rAUEC and relative improvements? Providing the original relative L2 errors would help address this issue.
- Thank you for only fixing Equation 4 and Equation 12. The reviewer is unclear why the authors did not consistently revise Equations 2, 3, 6, and 14, as well as the other equations. In addition, the reviewer is also unclear whether the outer box added to Equation G.4 has any special meaning. Given these issues, the reviewer’s confidence in this work has substantially decreased. Please manually check whether all equations and statements are correct.
We thank the reviewer for highlighting the need for stronger experimental support for test-time sampling. Below, we provide detailed responses to the concerns raised:
Our density-design approach to test-time adaptive sampling is a general strategy for neural operators with spatial aggregation. To evaluate its applicability beyond Transolver, we extend AdaSolver to LinearNO [1] as an additional backbone.
Measure correction in LinearNO. In LinearNO, the output is computed as ϕ(Q)(ψ⊤(K)VN), where VN=Linear(V)(HN). The aggregation ψ⊤(K)VN uses a softmax over the spatial points. Writing ℓij=[Linear(K)(hi)]j, each aggregated representation is
sj=∑i=1Nexp(ℓij)∑i=1Nexp(ℓij)vi.
Changing the spatial sampling measure from ρ to ρ changes the measure underlying this weighted average. Consequently, the aggregated representation can change even for the same physical input and model parameters.
We correct this aggregation using ci=(dρ/dρ)(xi):
sj=∑iciexp(ℓij)∑iciexp(ℓij)vi=∑i[SoftmaxN(ℓ⋅j+logc)]ivi.
Thus, the correction is implemented simply by adding the log correction weights to the key logits before the spatial softmax. Specifically, we add logci to the key logits at each spatial point i. Writing the corrected spatial weights as Ac, we obtain
Ac=SoftmaxN(Linear(K)(HN)⊤+1M(logc)⊤).
The resulting module is
LinearNOc(HN)=ϕ(Q)[AcVN].
We apply this correction at each spatial aggregation layer, leaving the learned parameters and query-side normalization unchanged. Under the usual support, integrability, and positive-denominator assumptions, the corrected aggregation converges to its reference-measure counterpart.
Results on Airfoil2D and ShapeNet-Car. We evaluate this extension on Airfoil2D and ShapeNet-Car, with the results shown below.
Airfoil2D: Field
ShapeNet-Car: Field
ShapeNet-Car: CD
Entries report mean ± standard deviation. Transolver results are taken from Tables 1 and 2 of the manuscript. Uniform is normalized to 1 for each backbone and metric. Lower is better.
All three policies improve on Uniform for both backbones. These results show that the accuracy–point-budget benefits of adaptive sampling extend to LinearNO.
2. Practical motivation for test-time sampling
Our motivation comes from repeated surrogate evaluations in inverse design, particularly for large 3D geometries. In this setting, training and inference may already operate on subsampled point clouds because processing every point incurs substantial computation and memory costs. Uniform subsampling provides a simple baseline, but it does not explicitly prioritize regions that are informative for the predicted field or design objective. The practical question is therefore how to allocate a limited spatial budget to improve prediction quality and the resulting design process.
Our existing inverse-design experiments provide application-level evidence. For 2D airfoil optimization, AdaSolver retains 18.75% of the points and achieves a 2.18× speedup for the complete design process, with essentially the same CFD-validated aerodynamic performance as full-mesh optimization. For 3D SuperWing optimization, it retains 37.5% of the points and achieves a 1.86× speedup, while attaining a slightly lower CFD-validated CD/CL. These results connect adaptive sampling to a downstream computational benefit beyond forward-prediction accuracy.
We expect this question to become increasingly relevant as neural operators move toward engineering deployment. We will revise the Introduction and experimental discussion to make this application setting explicit, incorporate the additional comparisons, and state the scope of our contribution more precisely.