CLFeb 25, 2024

GraphWiz: An Instruction-Following Language Model for Graph Problems

arXiv:2402.16029v543 citationsh-index: 11Has Code
Originality Incremental advance
AI Analysis

This addresses the need for specialized AI in graph reasoning, though it is incremental as it builds on existing instruction-tuning and DPO methods.

The authors tackled the problem of large language models' limited proficiency in graph problems by introducing GraphWiz, an instruction-tuned model that achieves an average accuracy of 65% across nine tasks, surpassing GPT-4's 43.8%.

Large language models (LLMs) have achieved impressive success across several fields, but their proficiency in understanding and resolving complex graph problems is less explored. To bridge this gap, we introduce GraphInstruct, a novel and comprehensive instruction-tuning dataset designed to equip language models with the ability to tackle a broad spectrum of graph problems using explicit reasoning paths. Utilizing GraphInstruct, we build GraphWiz, an open-source language model capable of resolving various graph problem types while generating clear reasoning processes. To enhance the model's capability and reliability, we incorporate the Direct Preference Optimization (DPO) framework into the graph problem-solving context. The enhanced model, GraphWiz-DPO, achieves an average accuracy of 65% across nine tasks with different complexity levels, surpassing GPT-4 which has an average accuracy of 43.8%. Moreover, our research delves into the delicate balance between training data volume and model performance, highlighting the potential for overfitting with increased data. We also explore the transferability of the model's reasoning ability across different graph tasks, indicating the model's adaptability and practical application potential. Our investigation offers a new blueprint and valuable insights for developing LLMs specialized in graph reasoning and problem-solving.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes