TL;DR
GraphIF introduces a graph-based prompting framework that models multi-turn dialogues as relation graphs, significantly improving instruction-following performance of large language models in complex multi-turn conversations.
Contribution
It is the first to leverage relation graph prompts to explicitly incorporate multi-turn relational constraints into LLM instruction following.
Findings
Significant performance improvements on multi-turn dialogue datasets.
Effective integration with existing instruction-tuned LLMs.
Enhanced handling of long-distance relational constraints.
Abstract
Multi-turn instruction following is essential for building intelligent conversational systems that can consistently adhere to instructions across dialogue turns. However, existing approaches to enhancing multi-turn instruction following primarily rely on collecting or generating large-scale multi-turn dialogue datasets to fine-tune large language models (LLMs), which treat each response generation as an isolated task and fail to explicitly incorporate multi-turn instruction following into the optimization objectives. As a result, instruction-tuned LLMs often struggle with complex long-distance constraints. In multi-turn dialogues, relational constraints across turns can be naturally modeled as labeled directed edges, making graph structures particularly suitable for modeling multi-turn instruction following. Despite this potential, leveraging graph structures to enhance the multi-turn…
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
