AXCEL: Automated eXplainable Consistency Evaluation using LLMs

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Sreekar, P Aditya, Verma, Sahil, Chopra, Suransh, Ghazarian, Sarik, Persad, Abhishek, Sadagopan, Narayanan
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913517820444672
author Sreekar, P Aditya
Verma, Sahil
Chopra, Suransh
Ghazarian, Sarik
Persad, Abhishek
Sadagopan, Narayanan
author_facet Sreekar, P Aditya
Verma, Sahil
Chopra, Suransh
Ghazarian, Sarik
Persad, Abhishek
Sadagopan, Narayanan
contents Large Language Models (LLMs) are widely used in both industry and academia for various tasks, yet evaluating the consistency of generated text responses continues to be a challenge. Traditional metrics like ROUGE and BLEU show a weak correlation with human judgment. More sophisticated metrics using Natural Language Inference (NLI) have shown improved correlations but are complex to implement, require domain-specific training due to poor cross-domain generalization, and lack explainability. More recently, prompt-based metrics using LLMs as evaluators have emerged; while they are easier to implement, they still lack explainability and depend on task-specific prompts, which limits their generalizability. This work introduces Automated eXplainable Consistency Evaluation using LLMs (AXCEL), a prompt-based consistency metric which offers explanations for the consistency scores by providing detailed reasoning and pinpointing inconsistent text spans. AXCEL is also a generalizable metric which can be adopted to multiple tasks without changing the prompt. AXCEL outperforms both non-prompt and prompt-based state-of-the-art (SOTA) metrics in detecting inconsistencies across summarization by 8.7%, free text generation by 6.2%, and data-to-text conversion tasks by 29.4%. We also evaluate the influence of underlying LLMs on prompt based metric performance and recalibrate the SOTA prompt-based metrics with the latest LLMs for fair comparison. Further, we show that AXCEL demonstrates strong performance using open source LLMs.
format Preprint
id arxiv_https___arxiv_org_abs_2409_16984
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle AXCEL: Automated eXplainable Consistency Evaluation using LLMs
Sreekar, P Aditya
Verma, Sahil
Chopra, Suransh
Ghazarian, Sarik
Persad, Abhishek
Sadagopan, Narayanan
Artificial Intelligence
Computation and Language
Large Language Models (LLMs) are widely used in both industry and academia for various tasks, yet evaluating the consistency of generated text responses continues to be a challenge. Traditional metrics like ROUGE and BLEU show a weak correlation with human judgment. More sophisticated metrics using Natural Language Inference (NLI) have shown improved correlations but are complex to implement, require domain-specific training due to poor cross-domain generalization, and lack explainability. More recently, prompt-based metrics using LLMs as evaluators have emerged; while they are easier to implement, they still lack explainability and depend on task-specific prompts, which limits their generalizability. This work introduces Automated eXplainable Consistency Evaluation using LLMs (AXCEL), a prompt-based consistency metric which offers explanations for the consistency scores by providing detailed reasoning and pinpointing inconsistent text spans. AXCEL is also a generalizable metric which can be adopted to multiple tasks without changing the prompt. AXCEL outperforms both non-prompt and prompt-based state-of-the-art (SOTA) metrics in detecting inconsistencies across summarization by 8.7%, free text generation by 6.2%, and data-to-text conversion tasks by 29.4%. We also evaluate the influence of underlying LLMs on prompt based metric performance and recalibrate the SOTA prompt-based metrics with the latest LLMs for fair comparison. Further, we show that AXCEL demonstrates strong performance using open source LLMs.
title AXCEL: Automated eXplainable Consistency Evaluation using LLMs
topic Artificial Intelligence
Computation and Language
url https://arxiv.org/abs/2409.16984