How Interpretable are Reasoning Explanations from Prompting Large Language Models?

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Yeo, Wei Jie, Satapathy, Ranjan, Goh, Rick Siow Mong, Cambria, Erik
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914977074380800
author Yeo, Wei Jie
Satapathy, Ranjan
Goh, Rick Siow Mong
Cambria, Erik
author_facet Yeo, Wei Jie
Satapathy, Ranjan
Goh, Rick Siow Mong
Cambria, Erik
contents Prompt Engineering has garnered significant attention for enhancing the performance of large language models across a multitude of tasks. Techniques such as the Chain-of-Thought not only bolster task performance but also delineate a clear trajectory of reasoning steps, offering a tangible form of explanation for the audience. Prior works on interpretability assess the reasoning chains yielded by Chain-of-Thought solely along a singular axis, namely faithfulness. We present a comprehensive and multifaceted evaluation of interpretability, examining not only faithfulness but also robustness and utility across multiple commonsense reasoning benchmarks. Likewise, our investigation is not confined to a single prompting technique; it expansively covers a multitude of prevalent prompting techniques employed in large language models, thereby ensuring a wide-ranging and exhaustive evaluation. In addition, we introduce a simple interpretability alignment technique, termed Self-Entailment-Alignment Chain-of-thought, that yields more than 70\% improvements across multiple dimensions of interpretability. Code is available at https://github.com/SenticNet/CoT_interpretability
format Preprint
id arxiv_https___arxiv_org_abs_2402_11863
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle How Interpretable are Reasoning Explanations from Prompting Large Language Models?
Yeo, Wei Jie
Satapathy, Ranjan
Goh, Rick Siow Mong
Cambria, Erik
Computation and Language
Prompt Engineering has garnered significant attention for enhancing the performance of large language models across a multitude of tasks. Techniques such as the Chain-of-Thought not only bolster task performance but also delineate a clear trajectory of reasoning steps, offering a tangible form of explanation for the audience. Prior works on interpretability assess the reasoning chains yielded by Chain-of-Thought solely along a singular axis, namely faithfulness. We present a comprehensive and multifaceted evaluation of interpretability, examining not only faithfulness but also robustness and utility across multiple commonsense reasoning benchmarks. Likewise, our investigation is not confined to a single prompting technique; it expansively covers a multitude of prevalent prompting techniques employed in large language models, thereby ensuring a wide-ranging and exhaustive evaluation. In addition, we introduce a simple interpretability alignment technique, termed Self-Entailment-Alignment Chain-of-thought, that yields more than 70\% improvements across multiple dimensions of interpretability. Code is available at https://github.com/SenticNet/CoT_interpretability
title How Interpretable are Reasoning Explanations from Prompting Large Language Models?
topic Computation and Language
url https://arxiv.org/abs/2402.11863