- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper builds box embeddings for DAG taxonomies directly from the graph, without training. Each dimension comes from a topological order, and this alone guarantees that every descendant's box sits inside its ancestors' boxes. The orders are also chosen so that each pair in a user-declared family is disjoint in at least one dimension. Only pairs whose descendant sets don’t overlap can be declared. A greedy procedure packs many separation requirements into each dimension, and a separate checker verifies the final embedding. Experiments on GO, MeSH and WordNet look at construction speed and dimension count, constraint satisfaction, descendant retrieval, held-out edge prediction and graded lexical entailment.
The main contribution seems to be the combination of four things:
- separation guarantees tied to a chosen policy,
- orders picked on purpose to separate specific pairs,
- a practical way to keep the number of dimensions low,
- output that can be checked independently.
Critical strengths
-
The paper separates two kinds of requirements. Containment must always hold, while separation is chosen by the user. This makes it clear what is exactly guaranteed, and it gives a useful trade-off between how many pairs are covered and how many dimensions are needed.
-
The method does not rely on gradient-based training to satisfy the required constraints; they hold by construction. This could be valuable in applications where even a few structural violations are a problem.
Critical weaknesses
-
The downstream benefit of deliberately choosing the orders is not fully isolated. Although random-order baselines are evaluated for structural violations and MAP, there are no matched comparisons for held-out edge prediction or graded entailment. Applying the same scorers and optional refinement to random or DFS-based labels with the same number of dimensions would help identify the benefits of the proposed selection procedure. The structural guarantees and certificate would remain useful even if downstream accuracy were similar.
-
The evaluation does not establish whether this preference helps or hurts semantic ranking beyond recovering those relationships. Comparisons with simple depth- and descendant-count-based rankings would help clarify the effect.
Questions for authors
Please refer to the Weakness section.
Additional Questions:
- Does monotone in descendant count mean only along ancestor-descendant paths, or across all concepts? Can the authors please compare volume ranking with descendant-count ranking on identical candidate sets?
2 comments
Thank you for the rebuttal. My concerns are sufficiently addressed and I updated my score.
Thank you for the precise questions. All three are answered with new experiments.
Matched comparison with random and DFS labels:
We ran exactly this control. GRAIL labels drawn by randomised DFS, with the dimension of each seed's construction, on the same training graph, scored by the same slack over the same ten seeds (Table 4, new rows). Applying the same refinement changes the control by at most 0.001. Held-out-edge AUC under random negatives:
On HyperLex the GRAIL labels reach rho 0.766, against 0.741 for the submitted construction and 0.763 for the depth-first one. As you anticipated, the downstream signal comes from the interval labelling, not from the selection. The selection changes the order of the extensions, and that order matters. Neither order is best on every dataset, and we report both without selecting on held-out edges. We rewrote Section 7 around this result.
What the selection does buy is the certificate. Randomised GRAIL labels still leave 288 violations of the declared family on GO at 768 dimensions (Table 2). The selection reaches zero at 191 dimensions, and at 66 with the depth-first order. On MeSH it also gives the strongest geometry, 0.077 AUC above the control.
Depth and descendant-count rankings:
On the same candidate set (Appendix G), descendant-count ranking gives a popularity correlation within 0.004 of volume ranking on every dataset, and depth ranking has the same sign. Volume ranking is therefore not better than these graph statistics. Its value is that the geometry provides the same specificity ranking from arrays alone, without access to the graph, inside the same batched operation as similarity scoring.
On whether the specificity preference helps or hurts semantic ranking, we scored HyperLex with specificity alone (Appendix J). The depth gap reaches rho 0.33, the descendant-count ratio 0.50 and the box-volume ratio 0.32 to 0.47, against 0.74 to 0.77 for the slack. So specificity is a weak semantic score, and it is not what the slack measures. The same table shows that a binary indicator of WordNet reachability reaches 0.760. On HyperLex the slack therefore mostly passes on what the hierarchy already says, and the paper now states this.
Is volume monotone in descendant count?
Only along ancestor chains, where containment forces it. Across arbitrary concepts it is not. In each dimension an interval is at least as long as the node's block, with equality only when the block is contiguous in that extension, so volume correlates with descendant count without being a function of it. We corrected the caption of Table 3 that suggested otherwise.