- Rating
- 2
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper distinguishes metric prediction from decisions requiring an external semantic frame. Isometric observations can preserve native predictions without identifying a root, orientation, or fixed-origin radial interpretation. It provides orbit-risk bounds, noisy-anchor recovery conditions, and decision-resolving conditions. FramePosterior freezes the native predictor and aggregates frame-dependent decisions using additional evidence. Experiments cover graphs, visual hierarchies, radial uncertainty, and routing, including stable-readout counterexamples.
Critical strengths
- The observation law, semantic target, and decision equivalence are explicit, avoiding an immediate identification of coordinate sensitivity with task failure. The main orbit, recovery, and posterior-approximation bounds appear sound under their assumptions (Section 2; Appendices A–B).
- Exact isometries and transported-reference controls separate prediction preservation, readout sensitivity, and actual loss. Weak or null CIFAR and public-code HIE results are retained.
- Information budgets are transparent, including WordNet chart misspecification, source calibration radii in ImageNet, and extra topology in routing. Recovery is not presented as obtaining semantics automatically from distances alone.
Critical weaknesses
- A gap remains between the identifiability setting and natural deployment failures. The theorem concerns a specified invariant observation law. Full training systems with centering or hierarchy constraints contain additional information. A post-training isometry preserves the native distance predictor without necessarily preserving all training constraints. Since transporting the root or center resolves coordinate changes, the paper should establish when real systems lose that reference and require new semantic evidence. Some strong results use deliberately constructed radial tasks.
- The WordNet gains do not fully isolate the value of posterior inference. At 16 anchors and 20% corruption, MAP root recovery is already 100%; errors arise from undirected charts approximating directed depth. MAP predicts ties on 2.36% of queries versus .007% for posterior voting. This improvement is useful, but comparisons with direct depth regression, reasonable MAP tie-breaking, and simple neighboring-root ensembles under the same anchors are needed to separate uncertainty marginalization from structural approximation repair.
- ImageNet mainly supports sparse calibration, not ensemble risk control. Single-isotonic-chart MAE is 1.343 versus 1.340 for the ensemble, and disagreement does not produce a monotone risk–coverage curve (Appendix D.8). RDC also uses stored source calibration radii in addition to the 32 noisy values. This is disclosed, but comparisons should match the full information budget and test realistically queryable depth/order anchors.
- Conditional risk bounds lack corresponding empirical calibration. The T=1 Huber Gibbs update is not the exact likelihood of the ±1-hop corruption process, and the WordNet target may lie outside the root-chart family. Retained top-K posterior mass is not reported, preventing an operational interpretation of the truncation TV bound. Posterior confidence, abstention, and actual risk under model misspecification need independent validation.
- Routing gains need clearer attribution to additional topology. The main score is an ALT lower bound from landmark shortest paths, plus a small learned-distance term and no revisit. The no-revisit control is useful, but a signatures-only control without learned geometry and topology-based methods with the same storage budget are still needed. This application does not directly establish an advantage of frame-posterior inference.
Questions for authors
See weakness.
3 comments
I appreciate the authors' efforts. The author’s response has indeed given me a better understanding of the paper; however, these revisions are not sufficient to warrant a higher score, so I am maintaining my original rating.
Follow-up on the matched controls and remaining concerns
Thank you for the follow-up and for confirming that the revision clarifies the paper. We would appreciate one further clarification about the remaining basis for your assessment.
Requested matched controls. The MAP-plus-all-one-hop-neighbors comparison now uses the same anchors, queries and paired trials. With 16 anchors and 20% corruption, its accuracy is 96.81%, versus 98.04% for posterior voting and 98.17% for uniform-top-64 tie handling. We retain the stronger tie rule explicitly; this comparison does not establish a general posterior-aggregation advantage. (Table 2, p. 9; Appendix F.1.1, p. 28)
The revision also reports retained working mass, distinguishes the Huber Gibbs model from the actual corruption likelihood, and evaluates reliability with additional calibration and verification labels under the stated sampling and label-quality assumptions. Routing separates learned scores from landmark topology and includes the stronger BFS-tree comparator. These additions make the information budgets and attribution tests explicit. (Appendices F.3, G and H)
Remaining concern. The absence of a naturally occurring, anchor-repairable reference failure and the limited incremental benefit over strong simple rules remain substantive limitations. We state them alongside the results.
Could you indicate whether the added comparisons address your original requests for matched controls, and which remaining concern is most decisive for your recommendation? This would help the AC distinguish the evaluation questions now addressed from the scientific limitations that remain. We would appreciate that distinction being reflected in your final assessment.
Response on calibration, matched controls and routing
1. Observation law and natural failures. The orbit theorem requires equal complete observation laws for admissible states with different semantic answers, including centering constraints and hierarchy supervision. HIE/HypStructure/UNCHA interventions test fixed-reference readouts while preserving checked native outputs; transforming points and their reference together preserves relative distances. Additional untransformed checks found no natural reference error repaired by anchors. These are separate theorem and intervention claims. (Table 7, p. 21; Appendix E.3, p. 23)
2. WordNet: matched regression, ties and neighbors. With 16 anchors and 20% corruption, MAP/posterior/uniform-top-64 tie accuracies are 96.56/98.04/98.17%; non-tied MAP/posterior are both 98.89%. Structure-only ridge reaches 93.38%. The tie rule votes over the same anchor-loss-ranked top-64 pool only on MAP-tied queries. Root recovery is already 100%; the differences concern chart predictions and ties. A correct root plus the directed DAG yields exact depth using richer information. (Table 2, p. 9)
The neighbor ensemble includes MAP and all one-hop graph neighbors, uniformly votes ordinal signs and counts unresolved ties as errors. It matches anchors, queries and 50 paired trials per noise level, without tuning the neighborhood. Neighbor/posterior/tie accuracies are 96.81/98.04/98.17% at 20% corruption and 96.54/97.74/97.94% at 40%. (Appendix F.1.1, p. 28)
3. ImageNet calibration. Single/ensemble MAEs are 1.34330/1.33984 with the same 32 noisy values, stored source radii and decoder. The ten-seed paired MAE reduction is 0.00345 levels (95% CI [0.00065, 0.00626]). Sparse calibration supplies most recovery; disagreement produces a nonmonotone empirical risk-coverage curve. Recovery observes noisy source radii, and taxonomy/calibration targets are obtained offline. Realistically queried depth/order-anchor quality and cost remain unmeasured. (Appendix E.3.1, p. 23)
4. Working weights, truncation and risk. T=1 Huber Gibbs weights are a loss-based working model, not the exact clipped-hop likelihood; Gaussian recovery bounds retain their noise assumptions. In a separate truncation diagnostic, WordNet top-64 retains 99.9959/99.9787% mean working mass at 20/40% corruption; Disease top-128 retains 22.08%. Retained mass measures approximation within that working model, not semantic calibration. (Appendix F, p. 27; Appendix F.3.1, p. 32)
Complete-candidate Disease disagreement occurs on 64.70% of queries; full/minimum-loss uniform voting reach 77.08/77.13% on this hard subset. The 95%-working-mass set gives 63.60% disagreement and includes the true root in 96/100 trials. These are descriptive model-set results. (Appendix F.3.2, p. 32)
External calibration adds separately counted clean pair labels. At 2% target risk and 8192 labels, WordNet posterior coverage is 97.50/97.82% at 20/40% anchor corruption, versus tie handling's 97.60/97.92%; no certified rule exceeds target population risk in these primary conditions. Across 7200 configurations, one certified rule exceeds its 1% target with 2048 labels, reaching 1.0193% population error. At 5% risk with 2048 labels, warm32 HPO posterior/landmark-64 ridge mean coverage is 7.42/75.24%. (Appendix G.2, p. 36; Appendix F.4.3, p. 35)
The corrected selector separates unordered pairs/reversals across selection, calibration and test. Known independent symmetric-noise correction is evaluated separately from conservative contamination correction, which mostly abstains. An additional audit uses 1024 possibly corrupted selection labels plus 1024 independent clean verification labels beyond depth anchors. Across 240 Disease cases sharing 30 roots, selected-rule/fixed-posterior mean coverage is 73.17/65.14% at 5% target risk; no accepted test set exceeds 5% empirical error. Selection chooses the rule; independent verification selects its certified threshold. The result applies to simple rules too and requires correct verification labels and the stated finite query population; verification-label corruption and future query shift remain untested. (Appendices G.4-G.5, p. 38)
5. Routing attribution. With matched 64 landmarks and no-revisit settings, delivery is 25.68% for ALT alone, 21.48% with an L1-signature score, 52.44% with degree and 77.91% with HGCN; HGCN without ALT gives 69.90%. The stronger BFS-tree delivers 100% at 1.119 stretch, versus hybrid's 77.912%. Tree/hybrid persistent-plus-packet state is 169,599/693,827 serialized bytes, including common CSR and visited state but excluding scratch, evaluator/Python memory and distributed metadata. (Appendices H.2, H.4, p. 41)