Auto-Patching: Enhancing Multi-Hop Reasoning in Language Models

Aviv Jan, Dean Tahory, Omer Talmi, Omar Abo Mokh
5/31/2025
cs.CLcs.LG

No confident code implementation found for this paper.

Abstract

Multi-hop questions still stump large language models (LLMs), which struggle to link information across multiple reasoning steps. We introduce Auto-Patch, a novel method that dynamically patches hidden states during inference to enhance multi-hop reasoning in LLMs. Building on the PatchScopes framework, Auto-Patch selectively modifies internal representations using a learned classifier. Evaluated on the MuSiQue dataset, Auto-Patch improves the solve rate from 18.45\% (baseline) to 23.63~$\pm$~0.7\% (3 runs), narrowing the gap to Chain-of-Thought prompting (27.44\%). Our results highlight the potential of dynamic hidden state interventions for advancing complex reasoning in LLMs.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{jan2025autopatching,
  title  = {Auto-Patching: Enhancing Multi-Hop Reasoning in Language Models},
  author = {Aviv Jan and Dean Tahory and Omer Talmi and Omar Abo Mokh},
  year   = {2025},
  eprint = {2506.00483},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.00483v1}
}

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

Discussion