Challenge: Numerical knowledge graphs (NKGs) are not limited to discrete entity-relation knowledge.
Approach: They propose to combine numerical values and entities to solve multi-hop complex reasoning over incomplete knowledge graphs.
Outcome: The proposed approach handles up to 102 types of complex numerical reasoning queries on three public datasets.

Similar Papers

CNEQ: Incorporating numbers into Knowledge Graph Reasoning (2024.findings-emnlp)

Copied to clipboard

Challenge: Complex query answering (CQA) is a task that addresses semantics of numerical entities.
Approach: They propose a model that includes a Number-Entity Predictor and an Entity Filter . they use three widely-used Knowledge Graphs to perform reasoning over knowledge graphs .
Outcome: The proposed model can predict entities and numerical values better than existing models . it compares or filters out entities that meet certain constraints on three widely-used Knowledge Graphs .
KG-GPT: A General Framework for Reasoning on Knowledge Graphs Using Large Language Models (2023.findings-emnlp)

Copied to clipboard

Challenge: Using large language models for complex reasoning tasks on knowledge graphs remains unexplored.
Approach: They propose a multi-purpose framework leveraging large language models for complex reasoning tasks on knowledge graphs.
Outcome: The proposed framework outperforms fully-supervised models in KG-based fact verification and KGQA benchmarks.
MarkQA: A large scale KBQA dataset with numerical reasoning (2023.emnlp-main)

Copied to clipboard

Challenge: Existing KBQA datasets are insufficient for numerical reasoning . existing KBqa datasets lack multi-hop reasoning and numerical reasoning.
Approach: They propose a task that necessitates the ability to perform multi-hop reasoning and numerical reasoning.
Outcome: The proposed task necessitates the ability to perform multi-hop reasoning and numerical reasoning.
Improving Numerical Reasoning Skills in the Modular Approach for Complex Question Answering on Text (2021.findings-emnlp)

Copied to clipboard

Challenge: Neural Module Networks (NMNs) is an end-to-end differentiable model in the programmer-interpreter paradigm.
Approach: They propose to make the interpreter question-aware and capture the relationship between entities and numbers in both questions and paragraphs.
Outcome: The proposed models outperform the original models on the DROP dataset and are interpertable by nature.
iQUEST: An Iterative Question-Guided Framework for Knowledge Base Question Answering (2025.acl-long)

Copied to clipboard

Challenge: Large language models suffer from factual inaccuracies in knowledge-intensive domains.
Approach: They propose a question-guided KBQA framework that iteratively decomposes complex queries into simpler sub-questions and integrates a Graph Neural Network (GNN) to look ahead and incorporate 2-hop neighbor information at each reasoning step.
Outcome: The proposed framework improves on four benchmark datasets and four LLMs.
Exploiting Hybrid Semantics of Relation Paths for Multi-hop Question Answering over Knowledge Graphs (2022.coling-1)

Copied to clipboard

Challenge: Existing approaches to answer natural language questions on knowledge graphs (KGQA) use large-scale entity-related text corpus or knowledge graph embeddings as auxiliary information to facilitate answer selection.
Approach: They propose to integrate explicit textual information and implicit KG structural features of relation paths into a novel rotate-and-scale entity link prediction framework.
Outcome: The proposed method is superior to existing methods on three KGQA datasets and shows that it can be used to identify answer entities.
Improving Multi-hop Logical Reasoning in Knowledge Graphs with Context-Aware Query Representation Learning (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods rely on linear sequential operations to solve First-Order Logic queries.
Approach: They propose a model-agnostic approach that fully integrates the context of the query graph.
Outcome: The proposed method improves performance on two datasets by 19.5%.
Structured Self-Supervised Pretraining for Commonsense Knowledge Graph Completion (2021.tacl-1)

Copied to clipboard

Challenge: Existing approaches focus on generating concepts that have direct and obvious relationships with existing concepts and lack an ability to generate unobvious concepts.
Approach: They propose a general graph-to-paths pretraining framework that leverages high-order structures in CKGs to capture high-level relationships between concepts.
Outcome: The proposed framework can capture high-order relationships between concepts in four special cases: long path, path-to-path, router, and graph-node-path.
Adapting Meta Knowledge Graph Information for Multi-Hop Reasoning over Few-Shot Relations (D19-1)

Copied to clipboard

Challenge: Existing methods for multi-hop reasoning assume that every relation has enough triples for training . however, performance drops significantly on few-shot relations .
Approach: They propose a meta-based multi-hop reasoning method that learns meta parameters from high-frequency relations that could quickly adapt to few-shot scenarios.
Outcome: The proposed method outperforms state-of-the-art methods in few-shot scenarios on two public datasets from Freebase and NELL.
Complex Reasoning in Natural Language (2023.acl-tutorials)

Copied to clipboard

Challenge: Recent research shows that pretrained language models are often brittle for complex reasoning tasks.
Approach: They propose to use pre-trained language models to teach machines to reason over texts . they will review recent promising approaches to tackling complex reasoning tasks .
Outcome: This tutorial reviews promising approaches to complex reasoning tasks . it reviews the methods that can be used to augment models with robustness .

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