- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3(+1)
Read review
Paper summary
The paper studies whether a score field at one known Gaussian noise level determines the local weighted geometry of a junction namely its center, homogeneity degree, branch directions, and relative masses. For an exact homogeneous tangent measure, the authors derive a derivative-free linear calibration of center and degree. Once centered, integrating the tangential score over a sphere recovers a scalar angular transform. Strictly positive harmonic multipliers establish injectivity, and classical moment methods then recover finite collections of rays. The planar analysis adds sharp consecutive-moment requirements, finite-query error bounds, conditional certification, and an $O(\sigma^\beta)$ tangent-score approximation for specified curved branches. Synthetic population, KDE, and neural-score experiments examine these stages and report that improved score RMS can coexist with worse angular-moment recovery. Exact identification concerns the homogeneous model; recovery from finite-noise curved data and learned fields remains conditional on approximation, conditioning, and error bounds.
Critical strengths
-
I liked that the paper shows how to recover both branch directions and their relative weights from scores at one noise level. Theorem 1 addresses the unknown center and homogeneity degree, and Theorem 2 shows that one centered shell identifies the angular measure. I think the main contribution is connecting the score field to the moments needed by existing reconstruction methods.
-
I also liked the explanation of why a good score estimate does not necessarily give accurate junction geometry. The example of different junctions sharing the same vertex Hessian makes this limitation concrete. The stability analysis and Table 7 further show why recovering the correct branch count can be easier than recovering accurate directions and weights.
Critical weaknesses
-
I had a question about whether the finite-sample guarantee covers estimating the center and constructing the KDE from the same data. In Appendix I, the concentration argument leading to Equation (98) appears to treat the query locations as fixed. However, estimating the center from the data also makes the shell locations depend on those data. I could not find an argument accounting for this dependence. This matters for the probability guarantee in Equation (17), although it does not directly affect the exact identifiability results. An independence assumption or a bound that holds uniformly over the possible query locations could resolve the concern.
-
I had trouble determining whether the experiments evaluate the complete procedure starting from an unknown center and degree. Table 1 reports calibration and reconstruction separately, and the protocols in Appendices K.3–K.6 do not clearly explain whether the estimated center and degree are passed into reconstruction. I think this needs clarification because the reported recovery rates may describe a simpler setting than the full problem introduced in the paper.
Questions for authors
-
Could you clarify whether the center estimate in the finite-data analysis uses the same samples as the KDE? If it does, how does the concentration argument account for the resulting data-dependent query locations?
-
Could you identify which reported experiments pass both the estimated center and estimated degree into branch reconstruction? I would find the joint recovery results helpful for understanding how errors from the different stages interact. If this has not been tested, a small synthetic evaluation would help support the claim that the full procedure has been validated.