Challenge: Text-Attributed Graphs (TAGs) are a powerful tool for understanding complex systems and relationships.
Approach: They propose a benchmark to evaluate large language models for graph-structured data using prompts.
Outcome: The proposed benchmark outperforms state-of-the-art graph LLMs and graph neural networks on graph learning tasks without training.

Similar Papers

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.
Structure Guided Prompt: Instructing Large Language Model in Multi-Step Reasoning by Exploring Graph Structure of the Text (2024.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) excel at straightforward reasoning tasks, but struggle when faced with complex multi-step reasoning.
Approach: They propose a framework that converts unstructured text into a graph and instructs LLMs to navigate this graph using task-specific strategies.
Outcome: The proposed framework improves the multi-step reasoning capabilities of Large Language Models in a zero-shot setting.
Let’s Ask GNN: Empowering Large Language Model for Graph In-Context Learning (2024.findings-emnlp)

Copied to clipboard

Challenge: Textual Attributed Graphs (TAGs) are crucial for modeling complex real-world systems, yet leveraging large language models (LLMs) for TAGs presents unique challenges due to the gap between sequential text processing and graph-structured data.
Approach: They propose a novel approach that leverages In-Context Learning to integrate graph data and task-specific information into large language models (LLMs) they employ a Graph Neural Network-powered structure-enhanced retriever to select labeled nodes across graphs, incorporating complex graph structures and their supervision signals.
Outcome: Experiments on three tasks and seven LLMs show that AskGNN performs better than existing methods.
Enhancing Text-to-SQL Capabilities of Large Language Models: A Study on Prompt Design Strategies (2023.findings-emnlp)

Copied to clipboard

Challenge: In-context learning (ICL) is a new approach to natural language processing tasks that rely on large language models to make predictions based on context . recent studies have shown that neural symbolic design is the preferred choice for question answering systems because of its limited working memory and unreliable long-term memory.
Approach: They propose to extend in-context learning to question answering tasks that utilize structured knowledge sources and to explore various prompt design strategies for employing LLMs.
Outcome: The proposed approach outperforms the state-of-the-art system by 2.5 points and the best fine-tuned system by 5.1 points on the Spider dataset.
Causal-LLM: A Unified One-Shot Framework for Prompt- and Data-Driven Causal Graph Discovery (2025.findings-emnlp)

Copied to clipboard

Challenge: Current causal discovery methods rely on pairwise or iterative strategies that fail to capture global dependencies, amplify local biases, and reduce overall accuracy.
Approach: They propose a framework for one-step full causal graph discovery using prompt-based discovery and a data-driven method for settings without metadata.
Outcome: The proposed framework outperforms state-of-the-art models by approximately 40% in edge accuracy on datasets like Asia and Sachs while maintaining strong performance on more complex graphs.
Colorful Talks with Graphs: Human-Interpretable Graph Encodings for Large Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Graph problems require reasoning over explicit structure, permutation invariance, and computationally complex relationships, creating a mismatch with the representations of text-based models.
Approach: They propose a human-interpretable structural encoding strategy that injects graph structure directly into natural language prompts.
Outcome: The proposed method improves performance on synthetic and real-world datasets.
From Cross-Task Examples to In-Task Prompts: A Graph-Based Pseudo-Labeling Framework for In-context Learning (2025.findings-emnlp)

Copied to clipboard

Challenge: In-context learning (ICL) enables large language models to perform novel tasks without parameter updates by conditioning on a few input-output examples.
Approach: They propose a cost-efficient two-stage pipeline that reduces reliance on LLMs for data labeling.
Outcome: The proposed pipeline reduces reliance on LLMs for data labeling . it leverages readily available cross-task examples to prompt an LLM and pseudo-label a small set of target task instances.
Large Language Models are Good Relational Learners (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to serialize large language models disregard critical relational structures and creates redundancies.
Approach: They propose a graph neural network encoder to create structured relational prompts for large language models within a retrieval-augmented generation framework.
Outcome: The proposed architecture preserves relational structure of databases while enabling LLMs to process and reason over complex entity relationships.
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.
Each graph is a new language: Graph Learning with LLMs (2025.findings-acl)

Copied to clipboard

Challenge: Natural language is used to describe graphs, but graph descriptions become verbose and only relying on attribute embeddings limits LLM’s ability to capture adequate graph structural information.
Approach: They propose a graph-defined language for large language model that translates the graph into a corpus instead of graph descriptions and pre-trains LLMs on this corpus to adequately understand the graph.
Outcome: Experiments on five datasets show that the proposed framework outperforms description-based and embedding-based baselines by efficiently modeling different orders of neighbors.

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