Iterative Graph Alignment

Fangyuan Yu, Hardeep Singh Arora, Matt Johnson
8/29/2024
cs.LGcs.AIcs.CL

No official code found. Best implementation: fangyuan-ksgk/RuleAlign (3 stars, last commit 2024-09-02). 1 more below.

Abstract

By compressing diverse narratives, LLMs go beyond memorization, achieving intelligence by capturing generalizable causal relationships. However, they suffer from local 'representation gaps' due to insufficient training data diversity, limiting their real-world utility, especially in tasks requiring strict alignment to rules. Traditional alignment methods relying on heavy human annotations are inefficient and unscalable. Recent self-alignment techniques also fall short, as they often depend on self-selection based prompting and memorization-based learning. To address these issues, we introduce Iterative Graph Alignment (IGA), an annotation-free rule-based alignment algorithm. A teacher model (VLM) employs Iterative Graph Prompting (IGP) to create logical graphs and reference answers. The student model (LLM) identifies local knowledge gaps by attempting to align its responses with these references, collaborating with helper models to generate diverse answers. These aligned responses are then used for iterative supervised fine-tuning (SFT). Our evaluations across five rule-based scenarios demonstrate IGP's effectiveness, with a 73.12\% alignment improvement in Claude Sonnet 3.5, and Llama3-8B-Instruct achieving an 86.20\% improvement, outperforming Claude Sonnet 3.5 in rule-based alignment.

View on arXivView PDF

Code Implementations(2)

Rule-Based Adherance evaluation for LLM Agent

30Shell, PythonAug 18, 20242 years ago
GPL-3.0

Official Implementation of Iterative Graph Alignment https://arxiv.org/abs/2408.16667

20Shell, PythonDec 5, 20241 years agoGPL-3.0

Similar Papers

Cite this paper

@article{yu2024iterative,
  title  = {Iterative Graph Alignment},
  author = {Fangyuan Yu and Hardeep Singh Arora and Matt Johnson},
  year   = {2024},
  eprint = {2408.16667},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.16667v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.16667.svg)](https://codeofpaper.com/paper/2408.16667)

Discussion