- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes an Optimal Transport based multimodal knowledge graph fusion framework, aiming at deal with the two critical problems about modality sematic noise ( low-target relevance ) and modality imbalance. The details of the solution are presented and the experiments on 4 popular benchmarks for performance evaluation and ablation are conducted to verify the effectiveness of the proposed method. The work is solid and significant for multimodal knowledge graph techniques.
Critical strengths
The two critical factors that individually and jointly affect the multimodality fusion result are analyzed carefully and the corresponding solutions are proposed. The cascaded compact multi-scale representation construction mechanism is designed to solve low-target relevance problem, the sliced Wasserstein distance based selection mechanism is designed to solve modality imbalance problem, and the Nash bargaining-based adaptive mechanism is designed to solve the joint problem. Finally the theoretical analysis and experimental results are given. The work is done completely and solidly.
However, the CRC and SWD mechanisms are designed by using the existing techniques such as cascaded factorization and sliced Wasserstein distance. Whether they are the suitable ones to solve the problems are to be explored further.
Critical weaknesses
None
Questions for authors
None
2 comments
Dear Reviewer K68o,
Thank you again for your encouraging assessment and thoughtful question about the suitability of CRC and SWD. We particularly appreciated that your question focused on why these techniques fit the problems we aim to address. It prompted us to explain their complementary roles more clearly and connect our design choices to the controlled comparisons and computational analysis. We have incorporated this discussion into the revised manuscript, making the motivation behind NaCOT more explicit.
We would welcome your thoughts on whether this explanation addresses your question, and would be happy to clarify any remaining points. Thank you again for your careful consideration and encouragement.
Best regards,
The Authors
Response to Reviewer K68o
We sincerely thank the reviewer for carefully reading our paper and providing such a positive assessment. We also appreciate the thoughtful question about whether cascaded factorization and sliced Wasserstein distance are suitable for addressing the identified problems. Our contribution lies in jointly adapting multi-scale candidate construction and compatibility-based selection to determine the representations used for OT-based MMKG fusion.
CRCcompresses sample representations through learnable linear combinations. This reduces the OT problem size and computational cost (Appendix F), while aiming to mitigate the influence of weakly relevant information on OT alignment.Fig. 4supports the benefit of moderate compression.SCSselects the candidate pair with the smallest SWD. This favors closer distributional agreement and saves computation by avoiding exhaustive OT solves over all candidate pairs.Fig. 5shows performance comparable to exhaustiveGreedyselection.The representation-level design retains information from partially relevant samples rather than explicitly filtering them out. A sample with substantial irrelevant content may still provide useful entity-specific evidence.
CRCintegrates such information through learnable linear combinations, whileSCSselects a distributionally compatible pair for OT alignment.Appendix G.2further shows that NaCOT maintains the highest MRR among the compared methods across all evaluated noise ratios onDB15K, supporting the robustness of the complete framework.The existing techniques therefore serve specific, complementary roles in our design:
CRCsupplies compact alternatives to the original representations, andSCSidentifies compatible pairs before OT alignment. The controlled comparisons inFigs. 4–5support these choices. We have added this discussion and the supporting references to the revised manuscript.