stat.MLSep 1, 2026

Matched Queries for Curvature and Density at Branching Junctions

Authors: Ziqi ZhaoQingjian Ni

Organizations: School of Computer Science and Engineering Southeast University Nanjing, China

Abstract

At a junction, a score field can reveal weighted tangent rays, yet these first-order quantities do not determine how individual branches bend or how their densities change away from the center. Recovering this missing information is necessary for describing local continuation beyond a single point, but finite observations must separate branchwise second-order effects while allowing error in the estimated center. We address this inverse problem using matched score queries at noise scales σσ and λσλσ. For a finite union of C2,αC^{2,α} half-branches in RD\mathbb{R}^D, the normalized score has the expansion Fσ=F0+σG+O(σ1+α)F_σ=F_0+σG+O(σ^{1+α}). Matched subtraction cancels the tangent contribution and exposes GG, which depends linearly on branchwise curvature and log-density slope. Given tangent directions and weights on distinct rays, GG uniquely identifies all sDsD branch parameters, and sDsD scalar component observations are necessary. An O(σ2)O(σ^2) center error introduces DD translation modes, leading to (s+1)D(s+1)D observations under full-rank calibration, except for a translation-invariant full line. We also establish a perturbation bound and a conditional kernel-density-estimation rate. Experiments reproduce the predicted population and N1/5N^{-1/5} trends and remain full rank up to D=20D=20 with 16 supplied branches. In end-to-end tests for D=3D=3--55, a known-count first-order frontend yields full rank in all 135 population systems and a median relative jet error of 0.132. With strong first-order error, matched responses reduce median parameter error by a factor of 49.4 relative to naive tangent subtraction.

Explore similar work

CardsList