- Rating
- 3
- Confidence
- 1
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper introduces DiffStent, a GPU-native differentiable finite element framework designed to simulate and differentiate arterial deformation during in silico stent deployment. The framework couples multibody frictional contact (balloon, stent, and multilayer arterial wall) with the nearly incompressible, anisotropic Holzapfel-Gasser-Ogden (HGO) constitutive model with fiber dispersion.
Critical strengths
- Simulating and optimizing endovascular interventions like stent deployment using gradient-based methods is a vital frontier in computational cardiovascular mechanics. DiffStent bridges a major gap by handling anisotropic, fiber-reinforced, nearly incompressible soft tissues under complex frictional contact.
- The implicit discrete adjoint approach drastically reduces memory complexity, making gradient computation independent of the number of forward simulation steps. The comparison against unrolled autodiff (Figure 5) clearly highlights the immense memory savings (avoiding multi-terabyte footprints).
Critical weaknesses
- Persistence of Gradient Discrepancies & Hyperparameter Sensitivity: As shown in Section 4.4 and the appendix, the proposed contact activation correction and chained plastic-history adjoint do not fully eliminate all gradient errors (e.g., intima stress sensitivities and media on T3). Moreover, the optimal smoothing width is sensitive to operating conditions and does not universally transfer across testbeds. A deeper discussion on why these residual errors persist—and whether modern barrier-based methods (such as Incremental Potential Contact) could bypass them entirely—would strengthen the methodological narrative.
- Computational Cost Transparency. While the adjoint avoids unrolled memory scaling, the forward simulation itself is computationally demanding (taking anywhere from 12 minutes to 1 hour depending on the testbed), and graph-colored sparse probing/factorization adds non-trivial overhead. Providing a clearer end-to-end wall-clock time breakdown for gradient-based optimization loops (e.g., total time for the Adam iterations in Figure 9) would help practitioners assess practical feasibility.
Questions for authors
Please refer to weakness
We thank the reviewer for their feedback and encouraging assessment. Responding to these comments made the manuscript clearer and more useful to practitioners. We have uploaded the revised manuscript and appendix above.
1. Persistence of Gradient Discrepancies & Hyperparameter Sensitivity: As shown in Section 4.4 and the appendix, the proposed contact activation correction and chained plastic-history adjoint do not fully eliminate all gradient errors (e.g., intima stress sensitivities and media on T3). Moreover, the optimal smoothing width is sensitive to operating conditions and does not universally transfer across testbeds. A deeper discussion on why these residual errors persist—and whether modern barrier-based methods (such as Incremental Potential Contact) could bypass them entirely—would strengthen the methodological narrative.
Answer: We thank the reviewer for this comment. The residual errors come from three sources, which we will discuss more explicitly in the revision. First, the forward solver uses explicit dynamic relaxation, so the recorded states are not in exact static equilibrium (residual forces of 5–9% in the wall and 20–40% in the stent at peak load), while the adjoint assumes they are in perfect equilibrium. Second, the adjoint holds the contact set and the set of yielded elements fixed. The activation correction smooths the contact stiffness but does not differentiate the contact-pair search, so it is a surrogate, and its best width depends on the local gap distribution, which changes with friction, penalty stiffness, and geometry. This is why one width does not transfer across testbeds. Third, part of the discrepancy comes from discretization and from the finite-difference reference. Refining the mesh moves the intima κ ratio from 0.76 to 0.95, and the T3 media and adventitia k1 misses are at low signal-to-noise (3–5).
We chose the explicit solver rather than an implicit solver because it is matrix-free, GPU-friendly, and robust under severe contact. We agree that a barrier method such as IPC is a promising remedy as its contact force is smooth across activation, and it is formulated with an implicit solver that converges to equilibrium, which would address the first two sources. It would not remove errors from gradient cancellation or from plastic yielding though. We are working on an implicit IPC-based version as future work and have added this discussion in Appendix M and N.
2. Computational Cost Transparency. While the adjoint avoids unrolled memory scaling, the forward simulation itself is computationally demanding (taking anywhere from 12 minutes to 1 hour depending on the testbed), and graph-colored sparse probing/factorization adds non-trivial overhead. Providing a clearer end-to-end wall-clock time breakdown for gradient-based optimization loops (e.g., total time for the Adam iterations in Figure 9) would help practitioners assess practical feasibility.
Answer: Below is the end-to-end wall-clock time breakdown for the stress-constrained pressure optimization on T3, measured on one RTX A6000. Each iteration consists of one forward deployment and one adjoint solve.
Table: Wall-clock time breakdown for a gradient-based optimization loop. Each iteration is one forward deployment and one adjoint solve.
Each iteration is one forward deployment and one adjoint solve. The forward simulation dominates as the adjoint, including sparse probing and factorization, takes 2.1 min, about 5% of an iteration. Within the forward pass, force evaluation accounts for 72% of the time and contact search for 21%. For comparison, central finite differences on the four identified parameters would need eight extra deployments per iteration, about 5.6 h against 2.1 min for the adjoint. The practical bottleneck is therefore the explicit forward solver, not the gradient computation. We state this in the limitations, and reducing it is part of our ongoing work on an implicit solver.