Skip to content
← Back to explorer

Beyond Prefixes: Graph-as-Memory Cross-Attention for Knowledge Graph Completion with Large Language Models

Ruitong Liu, Boxu Lin, Peize Li, Siyuan Li, Yunjia Wu, Te Sun, Chaohan Wu · Oct 10, 2025 · Citations: 0

Data freshness

Extraction: Stale

Check recency before relying on this page for active eval decisions. Use stale pages as context and verify against current hub results.

Metadata refreshed

Mar 4, 2026, 7:47 PM

Stale

Extraction refreshed

Mar 4, 2026, 7:47 PM

Stale

Extraction source

Persisted extraction

Confidence unavailable

Abstract

Fusing Knowledge Graphs with Large Language Models (LLMs) is crucial for knowledge-intensive tasks like knowledge graph completion. Existing LLM-based approaches typically inject graph information via prefix concatenation, resulting in shallow interactions that fail to support fine-grained evidence retrieval during generation. Beyond prefixes, we propose Graph-as-Memory Tuning (GMT), a new paradigm that represents local graph structure as explicit graph memory and injects it into LLMs via deep, token-wise cross-attention. Specifically, GMT first employs a Semantic Graph Module to encode context-aware semantics from local neighborhoods guided by knowledge-enhanced relations, and compresses them into a fixed number of graph memory tokens. A Graph-as-Memory Cross-Attention Fusion Module then integrates these tokens into multiple Transformer layers, allowing LLM hidden state to dynamically retrieve relevant graph evidence. To enable efficient adaptation, GMT applies LoRA only to the memory cross-attention while keeping the base LLM frozen. Extensive experiments show that GMT significantly outperforms prefix-tuning and other strong baselines, providing more potent signals for robust reasoning. The code is published at https://github.com/tongruiliu/GMT.

Low-signal caution for protocol decisions

Use this page for context, then validate protocol choices against stronger HFEPX references before implementation decisions.

  • Structured extraction is still processing; current fields are metadata-first.

HFEPX Relevance Assessment

Signal extraction is still processing. This page currently shows metadata-first guidance until structured protocol fields are ready.

Best use

Background context only

Use if you need

A provisional background reference while structured extraction finishes.

Main weakness

Structured extraction is still processing; current fields are metadata-first.

Trust level

Provisional

Eval-Fit Score

Unavailable

Eval-fit score is unavailable until extraction completes.

Human Feedback Signal

Not explicit in abstract metadata

Evaluation Signal

Weak / implicit signal

HFEPX Fit

Provisional (processing)

Extraction confidence: Provisional

Field Provenance & Confidence

Each key protocol field shows extraction state, confidence band, and data source so you can decide whether to trust it directly or validate from full text.

Human Feedback Types

provisional

None explicit

Confidence: Provisional Source: Persisted extraction inferred

No explicit feedback protocol extracted.

Evidence snippet: Fusing Knowledge Graphs with Large Language Models (LLMs) is crucial for knowledge-intensive tasks like knowledge graph completion.

Evaluation Modes

provisional

None explicit

Confidence: Provisional Source: Persisted extraction inferred

Validate eval design from full paper text.

Evidence snippet: Fusing Knowledge Graphs with Large Language Models (LLMs) is crucial for knowledge-intensive tasks like knowledge graph completion.

Quality Controls

provisional

Not reported

Confidence: Provisional Source: Persisted extraction inferred

No explicit QC controls found.

Evidence snippet: Fusing Knowledge Graphs with Large Language Models (LLMs) is crucial for knowledge-intensive tasks like knowledge graph completion.

Benchmarks / Datasets

provisional

Not extracted

Confidence: Provisional Source: Persisted extraction inferred

No benchmark anchors detected.

Evidence snippet: Fusing Knowledge Graphs with Large Language Models (LLMs) is crucial for knowledge-intensive tasks like knowledge graph completion.

Reported Metrics

provisional

Not extracted

Confidence: Provisional Source: Persisted extraction inferred

No metric anchors detected.

Evidence snippet: Fusing Knowledge Graphs with Large Language Models (LLMs) is crucial for knowledge-intensive tasks like knowledge graph completion.

Rater Population

provisional

Unknown

Confidence: Provisional Source: Persisted extraction inferred

Rater source not explicitly reported.

Evidence snippet: Fusing Knowledge Graphs with Large Language Models (LLMs) is crucial for knowledge-intensive tasks like knowledge graph completion.

Human Data Lens

Structured extraction is still processing. Below are provisional signals inferred from abstract text only.

  • Potential human-data signal: No explicit human-data keywords detected.
  • Potential benchmark anchors: No benchmark names detected in abstract.
  • Abstract highlights: 3 key sentence(s) extracted below.

Evaluation Lens

Evaluation fields are currently inferred heuristically from abstract text.

  • Potential evaluation modes: No explicit eval keywords detected.
  • Potential metric signals: No metric keywords detected.
  • Confidence: Provisional (metadata-only fallback).

Research Brief

Deterministic synthesis

Fusing Knowledge Graphs with Large Language Models (LLMs) is crucial for knowledge-intensive tasks like knowledge graph completion.

Generated Mar 4, 2026, 7:47 PM · Grounded in abstract + metadata only

Key Takeaways

  • Fusing Knowledge Graphs with Large Language Models (LLMs) is crucial for knowledge-intensive tasks like knowledge graph completion.
  • Existing LLM-based approaches typically inject graph information via prefix concatenation, resulting in shallow interactions that fail to support fine-grained evidence retrieval during generation.
  • Beyond prefixes, we propose Graph-as-Memory Tuning (GMT), a new paradigm that represents local graph structure as explicit graph memory and injects it into LLMs via deep, token-wise cross-attention.

Researcher Actions

  • Compare this paper against nearby papers in the same arXiv category before using it for protocol decisions.
  • Check the full text for explicit evaluation design choices (raters, protocol, and metrics).
  • Use related-paper links to find stronger protocol-specific references.

Caveats

  • Generated from abstract + metadata only; no PDF parsing.
  • Signals below are heuristic and may miss details reported outside the abstract.

Recommended Queries

Related Papers

Papers are ranked by protocol overlap, extraction signal alignment, and semantic proximity.

No related papers found for this item yet.

Need human evaluators for your AI research? Scale annotation with expert AI Trainers.