Inductive Reasoning on Few-Shot Knowledge Graphs with Task-Aware Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Current knowledge graph reasoning methods rely on extensive structural information to perform in these few-shot scenarios. |
| Approach: | They propose a task-aware language model that activates the language model’s in-context learning ability for structured KG tasks. |
| Outcome: | The proposed method achieves state-of-the-art in few-shot scenarios while reducing the inference time required by previous methods. |
Similar Papers
LLM as Prompter: Low-resource Inductive Reasoning on Arbitrary Knowledge Graphs (2024.findings-acl)
Copied to clipboard
| Challenge: | Knowledge Graph (KG) inductive reasoning is widely adopted in various applications. |
| Approach: | They propose a framework for low-resource inductive reasoning using Large Language Models to generate a graph-structural prompt for pre-trained KGs. |
| Outcome: | The proposed framework outperforms previous methods in three-shot, one-shot and zero-shot reasoning tasks. |
Few-shot Knowledge Graph-to-Text Generation with Pretrained Language Models (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing models for KG-to-text generation are based on pretrained language models. |
| Approach: | They propose to automatically generate a text that describes the facts in knowledge graph (KG) they leverage the excellent capacities of pretrained language models (PLMs) in language understanding and generation. |
| Outcome: | The proposed model outperforms all comparison methods on fully-supervised and fewshot settings. |
Language Models of Code are Few-Shot Commonsense Learners (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to generate graphs using pre-trained language models hinder their ability to generate them correctly. |
| Approach: | They propose to frame structured commonsense reasoning tasks as code generation tasks instead of serializing the output graph as a flat list of nodes and edges. |
| Outcome: | The proposed approach outperforms natural-language LMs in three natural language tasks even when the downstream task does not involve source code at all. |
Few-shot Low-resource Knowledge Graph Completion with Reinforced Task Generation (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing few-shot learning-based models have difficulty alleviating the long-tail issue on low-resource KGs because of the lack of training tasks. |
| Approach: | They propose a few-shot low-resource knowledge graph completion framework that generates and selects beneficial few- shot tasks that complement current tasks. |
| Outcome: | The proposed framework is based on several real-world knowledge graphs and validates on multiple domains. |
Adaptive Attentional Network for Few-Shot Knowledge Graph Completion (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent attempts to learn static representations of entities and references ignore their dynamic properties. |
| Approach: | They propose to learn static representations of entities and references ignoring their dynamic properties . a neighbor encoder learns entities' roles while a query-aware aggregator learns references' contributions . |
| Outcome: | The proposed approach achieves state-of-the-art results with different few-shot sizes. |
Empowering Small-Scale Knowledge Graphs: A Strategy of Leveraging General-Purpose Knowledge Graphs for Enriched Embeddings (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing approaches to augment LLMs with Knowledge Graphs (KGs) Knowledge-intensive tasks are prone to errors and require a large amount of knowledge to be understood. |
| Approach: | They propose a framework for augmenting LLMs through Knowledge Graphs (KGs) they propose KGs can be used to enhance performance in knowledge-intensive tasks . |
| Outcome: | Experimental results show that a small domain-specific KG can benefit from a performance boost in downstream tasks when linked to a substantial general-purpose KG. |
Data Augmentation for Few-Shot Knowledge Graph Completion from Hierarchical Perspective (2022.coling-1)
Copied to clipboard
| Challenge: | Existing knowledge graph completion models require only a few associative triples to complete a relationship. |
| Approach: | They propose to perform data augmentation from two perspectives to solve the FKGC problem by inferring new triple facts from existing models. |
| Outcome: | The proposed framework can be applied to a number of existing models. |
SEMMA: A Semantic Aware Knowledge Graph Foundation Model (2025.emnlp-main)
Copied to clipboard
Arvindh Arun, Sumit Kumar, Mojtaba Nayyeri, Bo Xiong, Ponnurangam Kumaraguru, Antonio Vergari, Steffen Staab
| Challenge: | Existing Knowledge Graph Foundation Models (KGFMs) rely on graph structure, overlooking the rich semantic signals encoded in textual attributes. |
| Approach: | They propose a dual-module KGFM that integrates transferable textual semantics alongside structure to generate relation identifiers. |
| Outcome: | The proposed model outperforms ULTRA and ULtra in fully inductive link prediction in more challenging generalization settings. |
Commonsense Subgraph for Inductive Relation Reasoning with Meta-learning (2025.coling-main)
Copied to clipboard
| Challenge: | Existing subgraph-based models focus on predicting missing relations in knowledge graphs . a new meta-learning model extracts concepts from entities to construct commonsense subgraphs based on semantic information . |
| Approach: | They propose a commonsense subgraph meta-learning model that extracts concepts from entities to construct commonsensible subgraphs. |
| Outcome: | The proposed model outperforms existing models in inductive reasoning tasks and in few-shot scenarios. |
ImReasoner: Improving Memory-based Language Models for Reasoning-in-a-Haystack Tasks (2026.acl-long)
Copied to clipboard
Ching-Yun Ko, Payel Das, Sihui Dai, Georgios Kollias, Subhajit Chaudhury, Aurelie C. Lozano, Pin-Yu Chen
| Challenge: | despite advances, large language models exhibit brittleness on tasks that require multi-step reasoning over long contexts. |
| Approach: | They propose to explicitly encode contexts as ordered memory and perform iterative retrieval to construct reasoning chains. |
| Outcome: | The proposed frameworks fail to show emergent reasoning generalization in a weakly supervised scenario . the proposed framework is based on a synthetic benchmark to stress-test the models . |