- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3(+1)
- Soundness
- 2
Read review
Paper summary
This paper proposes an uncertainty-aware, bridge-structured evidence routing framework for multi-KG joint reasoning. This framework consists of three techniques: 1) a query-aware source router for allocating evidence budgets among KGs, 2) an uncertainty-aware bridge constructor for modeling reliable entity- and relation-level bridges, and 3) a reliability-gated fusion reasoner that performs query-conditioned reasoning over compact fused evidence graphs. Experiments demonstrate the effectiveness of the proposed framework.
Critical strengths
- S1. This paper is well-motivated.
- S2. Extensive ablation experiments validate the effectiveness of each component in the proposed framework.
- S3. The paper compares with recent baselines and demonstrates the effectiveness of the proposed framework.
Critical weaknesses
-
W1. The paper’s technical depth needs to be improved. I acknowledge that multi-domain mixing is a promising approach. However, using only a budget constraint to implement dynamic allocation seems overly trivial. The authors should provide more technical discussion on how multi-domain KG mixing is achieved.
-
W2. This work mainly addresses the problem from the KG data perspective, but it lacks discussion on the KG model side. For example, the paper does not clarify how the choice of a KG backbone may affect the overall framework.
-
W3. The paper’s presentation needs to be improved. For instance, Figure 2 contains a lot of information, but the caption lacks sufficient description to explain what the figure represents and how to interpret it.
Questions for authors
-
Q1. Could the authors provide more technical discussion on how multi-domain KG mixing is achieved? (See W1)
-
Q2. Could the authors further extend the evaluation by using additional knowledge graph models as backbones, e.g., KnowFormer [1] and DuetGraph [2]? (See W2)
[1] KnowFormer: Revisiting Transformers for Knowledge Graph Reasoning. ICML 2024
[2] DuetGraph: Coarse-to-Fine Knowledge Graph Reasoning with Dual-Pathway Global-Local Fusion. NeurIPS 2025
3 comments
Thank you for your response. Some of my concerns are addressed. I have improved the score accordingly.
We sincerely thank the reviewer for the thoughtful and constructive feedback throughout the review cycle. The comments were genuinely helpful in improving the paper, and we are glad that the revisions and clarifications addressed your concerns. We truly appreciate the time and care you invested in this review.
Response to Reviewer 4DqA
Response to Reviewer 4DqA
We thank the reviewer for the constructive comments on technical depth, backbone dependence, and presentation. We have clarified how source routing interacts with cross-KG evidence construction and expanded the backbone evaluation.
Q1/W1. How is multi-KG evidence actually combined?
The dynamic budget rule in Eq. (2) converts learned query-dependent source relevance into integer retrieval budgets; it is only one part of the mechanism. UBER's source weights depend on the query and candidate anchor evidence (Eq. 1), and query–relation compatibility guides local evidence expansion (Eq. 3). The hard budget and retrieval operators are trained through source-level and path-level supervision derived from target-masked graphs, rather than by differentiating through discrete top-Bm selection.
Cross-source mixing occurs in the query-specific fused evidence graph. UBC selects entity bridges using matching confidence and learned reliability attenuation, while the Relation Bridge Matcher supplies relation-level compatibility priors. RFR then propagates messages across source-local edges and retained cross-KG entity bridges, weighting each message according to query relevance, bridge reliability, and relation compatibility (Eqs. 5–12). Thus, evidence from different KGs contributes through controlled multi-hop propagation, not merely through distributing the retrieval budget.
In the main ablation (Table 2), removing dynamic budget allocation reduces MRR by 0.012–0.014 across the three benchmarks. Removing UBC reduces MRR by 0.031–0.040, and removing RFR reduces it by 0.038–0.046, emphasizing the contribution of bridge construction and reliability-gated reasoning beyond allocation alone.
Manuscript additions: Sections 3.2–3.5 describe the route–connect–reason pipeline, including the fusion-graph and propagation equations; Appendix B.2 specifies the observable source/path supervision, including the routing and retrieval losses. Figure 2 and its caption identify the roles of QSR, UBC, and RFR in the end-to-end graph.
Q2/W2. Does UBER generalize across KG reasoning backbones?
We added a controlled study replacing RFR with adapted KnowFormer and DuetGraph backbones. All variants use the same query-specific fused evidence graphs and observable source features; bridge reliability and relation-compatibility signals enter the alternative backbones as edge-message factors. Each backbone and its scoring head is trained under a common setting, with the same filtered-ranking protocol.
DuetGraph yields the highest MRR on FB15k-237-MKG and YAGO3-10-MKG, while RFR performs best on WN18RR-MKG. In the corresponding interventions, removing explicit bridge signals or propagation gating reduces MRR for all three backbones. These results support the portability of UBER's evidence-routing and reliability mechanisms across different reasoning architectures, while showing that the backbone can affect final performance.
Manuscript additions: Appendix G.4, Effect of the reasoning backbone, describes the backbone adaptations and includes the performance comparison (Table 24) and component interventions (Table 25). Section 3.2 and Figure 2 provide a clearer description of the framework components and their interactions.
W3. Presentation of the overall framework
Figure 2 and its caption identify the responsibilities of QSR (where and how much evidence to retrieve), UBC (which cross-KG links to trust), and RFR (how to propagate evidence on the query-specific fused graph). Section 3.2 (Framework Overview) explains their execution order as a route–connect–reason pipeline and distinguishes source allocation from bridge construction and gated propagation.