Deceptive Semantic Shortcuts on Reasoning Chains: How Far Can Models Go without Hallucination?

Bangzheng Li, Ben Zhou, Fei Wang, Xingyu Fu, Dan Roth +1 more
11/16/2023
cs.CLcs.AI

No official code found. Best implementation: VincentLeebang/eureqa (3 stars, last commit 2024-04-18).

Abstract

Despite the recent advancement in large language models (LLMs) and their high performances across numerous benchmarks, recent research has unveiled that LLMs suffer from hallucinations and unfaithful reasoning. This work studies a specific type of hallucination induced by semantic associations. Specifically, we investigate to what extent LLMs take shortcuts from certain keyword/entity biases in the prompt instead of following the correct reasoning path. To quantify this phenomenon, we propose a novel probing method and benchmark called EureQA. We start from questions that LLMs will answer correctly with utmost certainty, and mask the important entity with evidence sentence recursively, asking models to find masked entities according to a chain of evidence before answering the question. During the construction of the evidence, we purposefully replace semantic clues (entities) that may lead to the correct answer with distractor clues (evidence) that will not directly lead to the correct answer but require a chain-like reasoning process. We evaluate if models can follow the correct reasoning chain instead of short-cutting through distractor clues. We find that existing LLMs lack the necessary capabilities to follow correct reasoning paths and resist the attempt of greedy shortcuts. We show that the distractor semantic associations often lead to model hallucination, which is strong evidence that questions the validity of current LLM reasoning.

View on arXivView PDF

Code Implementations(1)

30Mar 31, 20242 years ago

Similar Papers

Cite this paper

@article{li2023deceptive,
  title  = {Deceptive Semantic Shortcuts on Reasoning Chains: How Far Can Models Go without Hallucination?},
  author = {Bangzheng Li and Ben Zhou and Fei Wang and Xingyu Fu and Dan Roth and Muhao Chen},
  year   = {2023},
  eprint = {2311.09702},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.09702v3}
}

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

Discussion