GCoT: Chain-of-Thought Prompt Learning for Graphs
Xingtong Yu, Chang Zhou, Zhongwei Kuai, Xinming Zhang, Yuan Fang

TL;DR
GCoT introduces a novel chain-of-thought prompting framework for graphs that guides graph models through step-by-step inference without relying on textual data, enhancing performance across multiple datasets.
Contribution
This work pioneers chain-of-thought prompt learning for graphs, adapting NLP techniques to non-linear, text-free graph data with a new inference and prompt learning mechanism.
Findings
Outperforms baseline methods on eight datasets
Effectively captures node states through thought aggregation
Demonstrates the versatility of CoT prompting for graphs
Abstract
Chain-of-thought (CoT) prompting has achieved remarkable success in natural language processing (NLP). However, its vast potential remains largely unexplored for graphs. This raises an interesting question: How can we design CoT prompting for graphs to guide graph models to learn step by step? On one hand, unlike natural languages, graphs are non-linear and characterized by complex topological structures. On the other hand, many graphs lack textual data, making it difficult to formulate language-based CoT prompting. In this work, we propose the first CoT prompt learning framework for text-free graphs, GCoT. Specifically, we decompose the adaptation process for each downstream task into a series of inference steps, with each step consisting of prompt-based inference, ``thought'' generation, and thought-conditioned prompt learning. While the steps mimic CoT prompting in NLP, the exact…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMental Health Research Topics · Functional Brain Connectivity Studies · Machine Learning in Healthcare
MethodsChain-of-thought prompting
