- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a framework for querying finite regions of trained neural fields using Chebyshev polynomial surrogates. Affine layers propagate the polynomial coefficients exactly, while DCT-based refitting after each activation controls polynomial degree. The resulting surrogate supports range estimation, approximate root finding, and integration without retraining the network. Experiments demonstrate applications to mesh extraction and anti-aliased reconstruction of neural images.
Critical strengths
A coherent and useful framework for region queries. Retaining a local polynomial representation enables several operations within a common framework, including locating level-set crossings and integrating the represented field. The method applies to existing networks without architectural modifications or retraining. The DCT-based refitting provides a practical way to prevent polynomial degree from growing across layers.
Promising improvements on relevant applications. Table 1 reports substantial acceleration of Marching Cubes while preserving the reported Hausdorff distance, and improvements in both runtime and geometric accuracy for Dual Contouring. The image discretization results provide an additional application beyond geometry. Experiments with sine, Gaussian, and GELU activations also support applicability across multiple smooth activation functions.
Critical weaknesses
The reliability of the empirical error control needs stronger validation. Degree selection relies on fitted relationships analyzed primarily on one network and shape. It is unclear whether these fits transfer across trained networks or require additional calibration, and whether calibration costs are included in the reported timings. Local truncation errors can accumulate and be amplified through subsequent layers. Since approximate ranges are used to discard regions, underestimated errors could cause missed surface components. The limitations section appropriately acknowledges the absence of certified bounds, but empirical measurements of missed intersections and sensitivity to tolerance would strengthen confidence in the approach.
The comparative evaluation and implementation details remain incomplete. Section 5.2 compares against fitting a polynomial directly to network samples and reports lower maximum errors. However, the sampling budgets and computational costs are insufficiently specified, and application-level runtime–accuracy comparisons with this alternative are missing. The benchmark also contains only two images, and per-shape results, hardware, numerical precision, and memory consumption are not reported. Additionally, page 6 refers to a set C and tolerance τ without clearly defining the corresponding selection rule.
Questions for authors
Are the degree-selection fits recalibrated for each trained network? Please clarify the calibration procedure, safety margin, and associated cost.
How often does surrogate-based filtering incorrectly discard regions containing the surface, particularly for thin structures or highly oscillatory fields?
Under matched computational budgets, how does layer-wise propagation compare with direct sampling and polynomial fitting in the final applications?
We thank the reviewer for the constructive feedback. We have expanded the evaluation and clarified the calibration procedure, filtering reliability, and computational comparisons.
Q1. Degree selection and calibration. We clarify that surrogate-construction degrees are selected separately for each trained network and configuration, using calibration regions and a conservative empirical error threshold (Sec. 5.2). For mesh extraction, the coarse-stage schedule is shared across shapes, while the fine-stage degrees are selected per network (Appendix C). In the initial submission, we manually selected one schedule based on the results we obtained from the Armadillo network. Now we report the measured selection costs between these approaches and evaluate transfer between networks (Appendix D, Table 4).
Q2. Incorrect filtering decisions. We now test the filter against sign-changing cells and independently sampled surface points across multiple neural SDFs (Appendix D, Table 5). Our selected configuration produces no incorrect exclusions among these references, while lower-degree configurations can fail. We also analyze the effect of retaining approximation remainders (Appendix B, Fig. 8) and clarify that our results do not constitute a certification.
Q3. Matched computational budgets. We now compare propagation with direct Chebyshev fitting at equal construction time and equal approximation error (Sec. 5.2, Fig. 5). Application-level comparisons are reported for mesh extraction at matched runtime (Sec. 5.3, Table 1; Appendix D, Table 3) and image discretization across runtime–accuracy budgets (Fig. 7, Appendix E).
We have additionally expanded the neural-image evaluation, added qualitative comparisons, clarified the filtering rule and implementation details, and documented the limitations of our empirical error control.