Challenge: Existing studies on knowledge-based visual question answering (KBVQA) describe the semantic distance using the actual Euclidean distance between two nodes, which leads to distortion in modeling knowledge graphs with hierarchical and scale-free structure.
Approach: They propose to use the actual Euclidean distance between two nodes to solve a problem of hierarchical and free-scale knowledge graphs.
Outcome: Extensive experiments on the KVQA, PQ and PQL datasets demonstrate the effectiveness of HyperMR for strong-hierarchy knowledge graphs.

Similar Papers

Hypergraph Transformer: Weakly-Supervised Multi-hop Reasoning for Knowledge-based Visual Question Answering (2022.acl-long)

Copied to clipboard

Challenge: Existing knowledge-based visual question answering tasks require weak supervision and no visual knowledge.
Approach: They propose a model which encodes high-level semantics of a question and a knowledge base and learns high order associations between them.
Outcome: The proposed model encodes high-level semantics of a question and a knowledge base, and learns high order associations between them.
Multi-Hop Reasoning for Question Answering with Hyperbolic Representations (2025.findings-acl)

Copied to clipboard

Challenge: a rigorous and detailed comparison of the two spaces for multi-hop reasoning is lacking.
Approach: They compare the capacity of hyperbolic space versus Euclidean space in multi-hop reasoning . they use an encoder-decoder model to integrate hyperbolical representations with a knowledge graph .
Outcome: The proposed model outperforms the Euclidean space in multi-hop reasoning.
HyperKGR: Knowledge Graph Reasoning in Hyperbolic Space with Graph Neural Network Encoding Symbolic Path (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for linking knowledge graphs are incomplete and rely on Euclidean embeddings . a hyperbolic GNN framework embeds recursive learning trees in hyperbolical space .
Approach: They propose a hyperbolic GNN framework that embeds recursive learning trees in hyperbolical space and generates query-specific embeddings.
Outcome: The proposed framework outperforms state-of-the-art methods on multiple benchmark datasets.
Hierarchical Graph Network for Multi-hop Question Answering (2020.emnlp-main)

Copied to clipboard

Challenge: Existing multi-hop question answering models focus on multi-level reasoning across multiple documents or paragraphs.
Approach: They propose a hierarchical graph network that aggregates clues from scattered texts . they use a set of contextual encoders to initialize nodes on different levels of granularity .
Outcome: The proposed model outperforms existing multi-hop QA approaches on the HotpotQA benchmark.
Learning to Ask: Multi-Decoder Fine-Tuning for Multi-Hop Visual Question Generation with External Knowledge (2026.findings-eacl)

Copied to clipboard

Challenge: Traditional supervised QG methods rely on tokenlevel alignment with fixed gold labels struggle to capture diverse valid question formulations.
Approach: They propose a model-agnostic framework that integrates multimodal inputs with a multi-decoder architecture to optimize for multiple labels per sample.
Outcome: The proposed framework improves fluency, reasoning depth, and relevance of visual questions.
Constraint-based Multi-hop Question Answering with Knowledge Graph (2022.naacl-industry)

Copied to clipboard

Challenge: Recent work addresses multi-hop KGQA, which requires reasoning across numerous edges of the KG.
Approach: They propose to use KG embeddings to reduce KG sparsity by performing missing link prediction.
Outcome: Empirical results show that the proposed method produces state-of-the-art results on three KGQA datasets.
Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering (2020.emnlp-main)

Copied to clipboard

Challenge: Existing work on augmenting question answering models with external knowledge (e.g., knowledge graphs) lacks transparency into the model’s prediction rationale.
Approach: They propose a knowledge-aware approach that equips pre-trained language models with a multi-hop relational reasoning module that performs multi-relational reasoning over subgraphs extracted from external knowledge graphs.
Outcome: The proposed model performs multi-hop, multi-relational reasoning over subgraphs extracted from external knowledge graphs.
Knowledge Base Question Answering through Recursive Hypergraphs (2021.eacl-main)

Copied to clipboard

Challenge: Existing methods for Knowledge Base Question Answering (KBQA) do not explicitly incorporate the recursive relational group structure in the given knowledge base.
Approach: They propose a method to model KBs through recursive hypergraphs using hypergraph data.
Outcome: The proposed method is based on recursive hypergraphs and has been released on multiple benchmarks.
Improving Multi-hop Question Answering over Knowledge Graphs using Knowledge Base Embeddings (2020.acl-main)

Copied to clipboard

Challenge: Existing multi-hop KGQA methods impose heuristic neighborhood limits, which often make it much harder to answer the input NL question.
Approach: They propose to use knowledge Graphs (KG) to answer natural language queries over the KG.
Outcome: The proposed method is particularly effective in performing multi-hop KGQA over sparse KGs.
HOLMES: Hyper-Relational Knowledge Graphs for Multi-hop Question Answering using LLMs (2024.acl-long)

Copied to clipboard

Challenge: Existing approaches to answer multi-hop questions are query-agnostic and the extracted facts are ambiguous as they lack context.
Approach: They propose to use a knowledge graph to extract query-relevant information from unstructured text.
Outcome: The proposed method achieves performance improvements on two popular datasets.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations