- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CHOREOGRAPH, a framework for numerical complex query answering over knowledge graphs. It represents numerical states as histograms and uses relation projection kernels and distributional message passing to support numerical reasoning. Experiments on four benchmarks show improvements over existing methods on most query structures, with reduced training time.
Critical strengths
Important and Underexplored Problem: The paper addresses numerical reasoning in knowledge graphs, an important yet relatively underexplored aspect of complex query answering. Explicitly handling numerical constraints within compositional queries is a meaningful research direction.
Critical weaknesses
Limited Methodological Novelty: The core idea of discretizing numerical values into bins has been explored in prior work, such as KGA. The paper does not sufficiently clarify how its approach fundamentally differs from existing numerical graph reasoning methods.
Limitations of Quantile-Grid Transport: The relation projection kernels model numerical shifts in quantile-bin space, where bins can have substantially different widths in the original numerical domain. This raises concerns about whether the learned kernels can consistently capture meaningful numerical changes across different regions of the value range.
Questions for authors
-
Could the authors clarify what the main differences are between CHOREOGRAPH and KGA, beyond representing numerical values using bins?
-
Since different bins can cover very different numerical ranges, why is shifting a histogram by the same number of bins a reasonable way to model numerical changes?
-
Could the authors clarify how well CHOREOGRAPH performs on arithmetic queries compared with existing methods? Also, how does decoding later operands into scalar values affect the benefits of maintaining histogram representations?
2 comments
Thank you for the detailed response and additional experiments. The clarification of the differences from KGA is helpful, although the main methodological contribution beyond existing approaches could be further clarified. The new arithmetic comparisons and histogram-preserving execution also address my concerns regarding Q3.
However, my concern about quantile-grid transport remains. While the explanation of position-independent kernels is reasonable, the improvements of learned RPKs over simple identity transport are very limited, as shown in Table 14. This raises questions about the practical contribution of the proposed transport mechanism. Overall, while the response addresses some of my concerns, I maintain my original rating.
Response to Reviewer 6H73
Q1. Differences from KGA
The distinction is how bins are represented and used, not binning itself. KGA supports fixed-width/quantile bins, adds them as graph nodes, chains neighboring and hierarchical bins, and trains an off-the-shelf KGE model. Its numerical prediction selects the highest-scoring bin and reads its median.
CHOREOGRAPH uses histograms as intermediate numerical query states, not embeddings of additional bin nodes. Each coordinate denotes an attribute interval and its mass. Multiple possible answers can remain in one state through comparison, set operations and arithmetic. Relation-attribute RPKs transform these states by convolution and are fitted by independent ridge problems followed by simplex projection.
Our contribution is the connection between an explicit numerical state, relation-conditioned transport and compositional query execution. KGA enriches the graph used to learn link predictors; CHOREOGRAPH exposes where intermediate numerical answers lie and how operations move and combine them. A complex-query executor is not supplied by bin augmentation alone. We added this distinction to Sec. 2.
Q2. Quantile-grid transport
The model in Sec. 4.2 estimates source-target displacement distributions in the attribute's quantile coordinates. Its rationale is statistical sharing: one K-coefficient kernel pools relation-attribute training paths across positions, instead of estimating a separate transition at each position. This reduces estimation requirements when numerical observations are sparse. A kernel can place mass on several shifts, representing spread or multiple possible changes rather than one fixed offset.
Quantile bins allocate resolution where training literals concentrate. The shared transformation therefore models changes in relative numerical position; it does not assert a constant physical-unit offset across the range. Arithmetic uses scalar representatives, not index shifts. All kernel coefficients are estimated from training-path targets, rather than prescribed from bin widths.
Table 4 supports allocating resolution according to literal density. Macro MRR (%), three-split mean ± sample SD:
Q3. Arithmetic comparison and scalar decoding
On the submitted Table 3 queries, we replaced only arithmetic with CNR-NST's released function, fixing input predictions and downstream execution. Three-split macro MRR (%):
CHOREOGRAPH is higher on all three datasets.
Singleton ground truth does not eliminate predictive uncertainty; later scalar decoding removes it. With fixed queries and input predictions, retaining both histograms changes three-split macro MRR (%) from 5.27 to 5.86 on FB15K, 4.18 to 4.56 on DB15K and 10.14 to 10.46 on YAGO15K. On FB15K, 2b/3b improve from 7.20/8.36 to 10.31/11.20, while bp, pb and 2pb favor set-scalar execution. Retaining both distributions improves the overall mean on all three datasets and better matches CHOREOGRAPH's representation. Table 3, Secs. 4.5/5.2 and Appendix B.4 have been updated accordingly.