REVIEW 2 cited by
InstructGraph: Boosting Large Language Models via Graph-centric Instruction Tuning and Preference Alignment
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Do current large language models (LLMs) better solve graph reasoning and generation tasks with parameter updates? In this paper, we propose InstructGraph, a framework that empowers LLMs with the abilities of graph reasoning and generation by instruction tuning and preference alignment. Specifically, we first 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. Furthermore, a graph instruction tuning stage is introduced to guide LLMs in solving graph reasoning and generation tasks. Finally, we identify potential hallucination problems in graph tasks and sample negative instances for preference alignment, the target of which is to enhance the output's reliability of the model. Extensive experiments across multiple graph-centric tasks exhibit that InstructGraph can achieve the best performance and outperform GPT-4 and LLaMA2 by more than 13\% and 38\%, respectively.
Forward citations
Cited by 2 Pith papers
-
Personalized Multimodal Large Language Models: A Survey
The paper provides a survey and taxonomy of personalization techniques for multimodal LLMs across text generation, image generation, recommendation, and retrieval.
-
Thinking with Knowledge Graphs: Enhancing LLM Reasoning Through Structured Data
Representing knowledge graph triples as Python code improved LLM multi-hop reasoning accuracy over text and JSON in this study, though the effect is modest and possibly due to explicit inference steps in the code.
Discussion (0). Continue with ORCID to comment.