- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The paper extends Neural Collision Fields (NCF) to second-order optimization by introducing a twice-differentiable Wendland kernel and a factorized neural representation that preserves smoothness and compact support. The authors demonstrate their method on several standard contact simulation examples using both XPBD and Newton-based solvers.
Critical strengths
- The paper addresses the limitations of NCF in second-order optimization.
- The authors demonstrate the proposed approach on a variety of contact simulation scenarios.
Critical weaknesses
- Quadrature comparison. The comparison with numerical quadrature is strange. The authors use adaptive order-15 quadrature to generate their training data but compare their learned approach against uniform quadrature. Why? Uniform quadrature is generally inefficient for localized integrands, and high-order Gaussian or adaptive quadrature would be more appropriate baselines. In particular, the authors already have an adaptive quadrature implementation. Why not compare against it? Furthermore, Table 1 shows that computing the energy, gradient, and Hessian with SNCP is more than twice as slow as their uniform quadrature baseline.
- Accuracy of derivatives. The reported relative errors in the gradients (19%) and Hessians (29%) are substantial. How do these errors affect the convergence and accuracy of the simulations? In particular, does using the learned Hessian increase the number of Newton iterations compared with evaluating the derivatives of the original integral numerically? The paper does not sufficiently investigate the practical consequences of these approximation errors.
- CPU/GPU comparison. The adaptive quadrature timings are reported using a 32-thread CPU implementation, whereas the learned approach runs on the GPU. This makes it difficult to assess the actual computational advantage of the neural representation. Why not implement and benchmark adaptive quadrature on the GPU as well?
- Missing comparisons with existing methods. The paper does not provide direct runtime or convergence comparisons against established non-learning second-order contact methods, such as IPC. Since the main motivation is enabling second-order contact simulation, these comparisons are important to establish whether the proposed approach offers any practical advantage in terms of speed, convergence, accuracy, or robustness.
Questions for authors
Please address the issues raised in the weaknesses, particularly the choice of quadrature baseline, the effect of derivative approximation errors on Newton convergence, and the lack of comparisons against existing second-order contact methods.
2 comments
- Effect of approximation errors on Newton convergence and simulation behavior. (regarding weakness 2)
- To examine the practical consequences of the approximation, we replaced the learned contact potential with numerical integration in the same Newton runtime. We also evaluated a Gauss–Newton control that preserves SNCP’s energy and gradient while changing the contact-curvature approximation. It uses .
| Mean Newton updates per step | Stack | Mass ratio | Cloth |
|---|---|---|---|
| Numerical integration/Newton | 1.075 | 5.240 | 3.575 |
| SNCP/full Hessian | 1.050 | 9.610 | 4.503 |
| SNCP/Gauss–Newton | 1.055 | 112.346* | 9.355 |
| * The starred mean covers 81 recorded frames, including the frame that reaches the iteration cap of 1024; frames 82–200 are unobserved. |
-
Effect on Newton convergence. SNCP requires approximately 83% more Newton updates on Mass ratio and 26% more on Cloth than numerical integration, while the Stack counts are close. Thus, the approximation has a measurable downstream cost. This comparison reflects the combined effect of approximating the energy and its derivatives.
-
Role of full curvature. The separate Gauss–Newton control shows that the full Hessian is useful when optimizing the learned potential. Full curvature reduces the Cloth iteration count from 9.355 to 4.503 updates per step. Gauss–Newton completes Stack and Cloth, but completes only 80 of 200 Mass ratio advances before reaching the iteration cap at frame 81. SNCP with the full Hessian completes the entire Mass ratio horizon. These results support the value of full curvature for convergence in the tested scenes, alongside its evaluation cost reported above.
-
Simulation behavior. Numerical integration and SNCP with the full Hessian both complete all steps under the native convergence criterion. We observe visually similar contact behavior using the same contact stiffness parameter, without retuning, and will add visual comparisons to the revised paper. This is qualitative evidence of similar behavior in these scenes; it does not establish a quantitative bound on trajectory or contact-force error.
- Comparison with IPC. (regarding Weakness 4)
-
We agree that IPC is an important practical reference and have added a comparison between SNCP and IPC contact within the same libuipc framework: | Scene | SNCP time (ms/step) | IPC time (ms/step) | SNCP Newton updates/step | IPC Newton updates/step | |---|---:|---:|---:|---:| | Stack | 35.44 | 9.55 | 1.050 | 1.035 | | Mass ratio | 445.41 | 88.85 | 9.610 | 10.665 | | Cloth | 173.62 | 46.40 | 4.503 | 3.485 |
-
Although both methods requires neerly identical Newton updates. IPC is 3.71–5.01× faster across these scenes. This is a strong baseline: IPC has benefited from several years of algorithmic development since its introduction in 2020, and libuipc incorporates state-of-the-art GPU IPC techniques. We acknowledge the current runtime gap and will report it explicitly.
-
An important motivation for SNCP is its potential to extend learned contact evaluation to more complex geometric representations, including higher-order surfaces. Direct contact handling on curved geometry remains challenging; for example, High-Order IPC [Ferguson et al., 2023] employs linear collision proxies to avoid costly direct curved-surface collision detection. By learning contact integrals and their derivatives, SNCP offers a promising alternative for handling richer geometry without relying on explicit contact sampling. While higher-order geometry is beyond the scope of this work, we will highlight this important motivation and future direction in the revision.
We thank reviewer for the detailed assessment. We agree that the original comparisons did not sufficiently establish the accuracy–cost trade-off or the practical consequences of derivative approximation. We have expanded the quadrature benchmarks, evaluated downstream Newton convergence, and added an IPC comparison.
We have therefore added Uniform80 and a GPU implementation of the same adaptive order-15 quadrature algorithm used by the CPU implementation described in the paper, evaluated at tolerances 10−5 and 10−6. | Method | Energy MRE (%) | Gradient MRE (%) | Hessian MRE (%) | E time (s) | E+G time (s) | E+G+H time (s) | |---|---:|---:|---:|---:|---:|---:| | SNCP | 16.781 | 18.670 | 29.485 | 0.253 | 0.523 | 10.570 | | Uniform40 | 59.367 | 52.112 | 86.688 | 0.602 | 0.640 | 4.703 | | Uniform80 | 23.818 | 18.975 | 25.114 | 10.773 | 11.549 | 82.034 | | GPU adaptive, 10−5 | 2.309 | 4.385 | 13.307 | 2.790 | 3.551 | 17.766 | | GPU adaptive, 10−6 | 1.32×10−13 | 2.06×10−13 | 1.54×10−11 | 13.040 | 19.212 | 150.561 |
CPU versus GPU. At tolerance 10−6, the 32-thread CPU implementation takes 38.14 s for energy and 58.40 s for energy plus gradient. The corresponding GPU times are 13.040 s and 19.212 s, giving speedups of approximately 2.92× and 3.04×, respectively. Thus, the GPU port provides roughly threefold acceleration in these tests. Efficient parallelization remains challenging for this adaptive algorithm because refinement introduces nonuniform computational work.
Accuracy versus evaluation cost. SNCP’s E+G+H evaluation is approximately 2.25× slower than Uniform40, although its errors are substantially lower. The expanded benchmarks clarify how this trade-off changes with quadrature accuracy:
Uniform80 achieves gradient error close to SNCP’s and lower Hessian error, although its energy error remains higher. Its E+G+H evaluation costs approximately 7.76× as much as SNCP’s.
GPU adaptive quadrature at 10−5 achieves lower errors on all three metrics, at approximately 1.68× SNCP’s E+G+H cost.
GPU adaptive quadrature at 10−6 closely matches the numerical reference used for evaluation, with the near-zero MREs reported above, at approximately 14.24× SNCP’s E+G+H cost.
These results assess the computational benefit using a GPU adaptive baseline and make the accuracy–cost trade-off explicit. We will revise the efficiency discussion to distinguish energy, gradient, and full Hessian evaluation and qualify the computational benefit by the accuracy required.