Challenge: Existing large language models (LLMs) can solve graph reasoning and generation tasks with parameter updates without sacrificing performance.
Approach: They propose a structured format verbalizer to unify all graph data into a universal code-like format, which can simply represent the graph without any external graph-specific encoders.
Outcome: The proposed framework outperforms GPT-4 and LLaMA2 in graph reasoning and generation tasks by more than 13% and 38%, respectively.

Similar Papers

Enhancing Large Language Model for Knowledge Graph Completion via Structure-Aware Alignment-Tuning (2025.emnlp-main)

Copied to clipboard

Challenge: Existing knowledge graph completion methods ignore inconsistent representation spaces between natural language and graph structures, leading to duplicate works and time-consuming processes.
Approach: They propose a framework that enhances LLMs for KGC via structure-aware alignment-tuning to align graph embeddings with the natural language space through multi-task contrastive learning.
Outcome: The proposed framework outperforms state-of-the-art methods on two KGC tasks across four benchmark datasets.
Exploring Graph Learning Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation (2026.findings-acl)

Copied to clipboard

Challenge: Recent studies focus on performance benchmarks without fully comparing LLMs to graph learning models.
Approach: They evaluate off-the-shelf and instruction-tuned graph learning models across a variety of scenarios.
Outcome: The proposed models outperform traditional graph learning models in few-shot settings, the authors show . their models out perform models with instruction tuning, and they show excellent generalization and robustness.
Language is All a Graph Needs (2024.findings-eacl)

Copied to clipboard

Challenge: Existing work on integrating graph problems into generative language modeling framework remains limited.
Approach: They propose an LLM with instructions based on natural language to perform graph tasks.
Outcome: The proposed model surpasses all GNN baselines on ogbn-arxiv, Cora and PubMed datasets and sheds light on generative LLMs as new foundation model for graph machine learning.
InstructProtein: Aligning Human and Protein Language via Knowledge Instruction (2024.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) are a promising new approach to understanding biological sequences such as proteins.
Approach: They propose an LLM that can generate protein sequences in human and protein languages by pre-training an Lm on protein and natural language corpora and supervised instruction tuning to facilitate alignment.
Outcome: The proposed model outperforms state-of-the-art LLMs on protein-text generation tasks by a large margin.
Graph-Assisted Large Language Models: A Perspective on Mitigating Intrinsic Limitations (2026.findings-acl)

Copied to clipboard

Challenge: Large language models exhibit intrinsic limitations such as knowledge cutoff, single-threaded reasoning that hinders finer-grained branch and aggregation, and rigid collaboration mechanisms that struggle to coordinate specialized capabilities.
Approach: They propose a taxonomy spanning *Graph-Assisted Knowledge Augmentation*, *Graph Assisted Reasoning and Planning*, and *Graphed LLM Collaboration*.
Outcome: The proposed models show that graphs can augment and correct LLMs and support dynamic coordination among experts and agents in collaborative settings.
Filter-then-Generate: Large Language Models with Structure-Text Adapter for Knowledge Graph Completion (2025.coling-main)

Copied to clipboard

Challenge: Empirical evidence suggests that LLMs perform worse than conventional KGC approaches.
Approach: They propose a filter-then-generate paradigm and a multiple-choice question format to harness the capability of LLMs while mitigating the issue casused by hallucinations.
Outcome: The proposed method achieves substantial performance gain compared to existing state-of-the-art methods.
Graph Chain-of-Thought: Augmenting Large Language Models by Reasoning on Graphs (2024.findings-acl)

Copied to clipboard

Challenge: Existing studies suggest augmenting LLMs with external text corpora to alleviate hallucination problems.
Approach: They propose to augment large language models with text units retrieved from external knowledge corpora to alleviate the issue.
Outcome: The proposed framework outperforms baselines on GRBench with three LLMs and shows that iterative reasoning outperformed the baselines.
Aligning Large Language Models for Controllable Recommendations (2024.acl-long)

Copied to clipboard

Challenge: Existing literature focuses on integrating domain-specific knowledge into LLMs to enhance accuracy using a fixed task template.
Approach: They propose a collection of supervised learning tasks augmented with labels derived from a conventional recommender model to improve LLMs’ proficiency in adhering to recommendation-specific instructions.
Outcome: The proposed approach significantly improves the capability of LLMs to respond to instructions within recommender systems, reducing formatting errors while maintaining a high level of accuracy.
InstructCoder: Instruction Tuning Large Language Models for Code Editing (2024.acl-srw)

Copied to clipboard

Challenge: InstructCoder is the first instruction-tuning dataset designed to adapt LLMs for general-purpose code editing.
Approach: They propose to use Large Language Models to edit code based on user instructions . they use a dataset to adapt LLMs to general-purpose code editing .
Outcome: The proposed model can significantly improve code editing performance compared to proprietary models . the proposed model is based on a human-written execution-based benchmark .
GraphEval36K: Benchmarking Coding and Reasoning Capabilities of Large Language Models on Graph Datasets (2025.findings-naacl)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated significant capabilities in processing and understanding text data.
Approach: They propose a structure-based instruction-based method to enhance LLM performance on complex graph tasks.
Outcome: The proposed framework outperforms open-source models on graph problem-solving, but the gap is narrowing.

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