- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies whether hierarchical semantic concepts are geometrically compatible with the flat additive structure assumed by the Linear Representation Hypothesis. The authors introduce residual reconstruction, a geometry-agnostic framework in which semantic nodes are represented as points and parent–child refinements as local concept vectors. Hierarchical concepts are composed along ancestor–descendant paths, and the reconstructed endpoint is compared with the observed descendant representation. In the Euclidean instantiation, this reduces to vector addition; the paper then compares this flat realization with a Poincaré-ball realization. Experiments on ImageNet/WordNet across four frozen vision backbones show substantial residual error for flat additive composition and lower reconstruction error for the tested Poincaré realization.
Critical strengths
-
The residual-reconstruction formulation is a clean and useful way to test hierarchical concept composition. I like that the paper moves beyond asking whether individual concept directions exist and instead asks whether local parent–child refinements compose consistently along an entire hierarchy. The framework also makes different candidate geometries comparable through a common reconstruction principle.
-
The empirical validation of the hierarchical concept directions is careful. The authors verify that the extracted directions generalize to held-out data and induce the expected model-level changes under intervention, with random and semantically mismatched controls. Multi-edge paths are also excluded from fitting and model selection in the Poincaré experiment. These choices make the residual-reconstruction results substantially more convincing.
Critical weaknesses
The central flat-versus-Poincaré comparison is not fully capacity-matched. The flat baseline directly composes the estimated concept vectors through addition, whereas the Poincaré realization additionally learns an encoder, decoder, and curvature, together with chart-fitting constraints. Therefore, the current experiments establish that the proposed learned Poincaré realization reconstructs the hierarchy better than the tested flat additive realization, but they do not fully isolate whether the improvement comes from negative curvature itself or from the additional flexibility of the learned chart. This distinction is important because the geometric conclusion is one of the paper’s central claims.
Questions for authors
Could the authors include a capacity-matched learned Euclidean baseline? In particular, I would be interested in a realization that uses the same or closely matched encoder/decoder architecture and fitting objectives as the Poincaré model, but with zero curvature / Euclidean geometry. If the Poincaré realization still provides a clear advantage under such a comparison, this would substantially strengthen my confidence that the observed gain is genuinely geometric rather than primarily due to the additional flexibility of the learned chart.
Presentation suggestion (not central to my score): I would encourage the authors to slow down the introduction and provide a more intuitive running example of hierarchical path composition before introducing the full geometric machinery. I also think the main figures, especially Figure 1, could be redesigned to communicate the geometric intuition more directly.
W1: We have conducted additional experiments as necessary. Please refer to our response to Q1 below.
Q1: The Poincaré realization does introduce additional learnable degrees of freedom. However, we deliberately constrain this flexibility through three loss terms: λtan, λpt, and λmet. The first two encourage the Poincaré realization to faithfully preserve the LDA concepts and population-level representations. The third imposes an even stronger constraint, requiring the hyperbolic latent space to be an isometrically embedded submanifold of the ambient Euclidean representation space. These constraints restrict the encoder from exploring potentially better hyperbolic manifolds M.
To further isolate the advantages arising from geometric differences, now we train two additional realizations:
A learned Euclidean realization using the same training procedure as the Poincaré realization, with only two modifications: (i) the encoder's underlying geometry is (M,g)=(Rm,⟨⋅,⋅⟩); (ii) the nonlinear tanh layer is removed from the decoder, ensuring that the decoder's image remains an affine subspace.
The original Poincaré realization with λmet=0 to relax the metric-preservation constraint, allowing the encoder to explore potentially better hyperbolic manifolds.
The results are reported below.
Table 2A (same setting as Table 2).
As shown in Table 2, learned Euclidean realization narrows the gap with Poincaré, but Poincaré retains an advantage, especially without the metric-preservation constraint.
Meanwhile, we acknowledge that the current results do not directly support the broader interpretation that hierarchical concepts exhibit a systematic tension with all forms of flat additive geometry. Our claim specifically concerns Euclidean realizations under the LRH hypothesis, particularly those defined in $\S$2.4, rather than arbitrary flat-additive-geometry realizations. We will therefore refine the wording of our statement to avoid posible misunderstandings and ambiguity.
Lastly, we clarify (and will make explicit in the final version) that the central contribution of this work is the residual reconstruction error introduced in Eq. (4), rather than a categorical rejection of all reconstructions based on Euclidean metrics. That metric provides a general framework for evaluating any geometric realization that satisfies the proposed definition. In the current manuscript, we empirically observe that the Euclidean realization under the conventional LRH framework exhibits larger reconstruction errors than a simple hyperbolic realization.
Q2: We sincerely appreciate your valuable suggestions. We will incorporate them in the final paper by providing a more intuitive example of hierarchical path composition and redesigning Fig. 1 to convey its key ideas more clearly.
We will incorporate all the above clarifications and experiments into the final paper.