Pairing Analogy-Augmented Generation with Procedural Memory for Procedural Q&A

K Roth, Rushil Gupta, Simon Halle, Bang Liu
9/2/2024
cs.AIcs.CL

No official code found. Best implementation: kylrth/procedure-generation (0 stars, MIT, last commit 2025-06-04).

Abstract

Large language models struggle to synthesize disparate pieces of information into a coherent plan when approaching a complex procedural task. In this work, we introduce a novel formalism and structure for such procedural knowledge. Based on this formalism, we present a novel procedural knowledge dataset called LCStep, which we created from LangChain tutorials. To leverage this procedural knowledge to solve new tasks, we propose analogy-augmented generation (AAG), which draws inspiration from the human ability to assimilate past experiences to solve unfamiliar problems. AAG uses a custom procedure memory store to retrieve and adapt specialized domain knowledge to answer new procedural tasks. We demonstrate that AAG outperforms few-shot and RAG baselines on LCStep, RecipeNLG, and CHAMP datasets under a pairwise LLM-based evaluation, corroborated by human evaluation in the case of RecipeNLG.

View on arXivView PDF

Code Implementations(1)

MIT

LLM-based procedural knowledge

00Shell, PythonMay 23, 20231 years agoMIT

Cite this paper

@article{roth2024pairing,
  title  = {Pairing Analogy-Augmented Generation with Procedural Memory for Procedural Q&A},
  author = {K Roth and Rushil Gupta and Simon Halle and Bang Liu},
  year   = {2024},
  eprint = {2409.01344},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.01344v2}
}

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/2409.01344.svg)](https://codeofpaper.com/paper/2409.01344)

Discussion