vix.ing · top · new · best · stats · spec

On the Eligibility of LLMs for Counterfactual Reasoning: A Decompositional Study

2025/05/17 by Shuai Yang, Qi Yang, Yang, Shuai +11 · 1 voice · 1 citation
Computer Science · #Artificial Intelligence (cs.AI) #Explainable Artificial Intelligence (XAI) #FOS: Computer and information sciences #Multimodal Machine Learning Applications #Topic Modeling #cs.AI

paper · pdf · doi:10.48550/arxiv.2505.11839

openalex publication_date 2025/05/17 · arxiv published 2025/05/17 · openalex created_date 2025/10/10 · arxiv updated 2026/02/16 · openalex updated_date 2026/07/28

Abstract

Counterfactual reasoning has emerged as a crucial technique for generalizing the reasoning capabilities of large language models (LLMs). By generating and analyzing counterfactual scenarios, researchers can assess the adaptability and reliability of model decision-making. Although prior work has shown that LLMs often struggle with counterfactual reasoning, it remains unclear which factors most significantly impede their performance across different tasks and modalities. In this paper, we propose a decompositional strategy that breaks down the counterfactual generation from causality construction to the reasoning over counterfactual interventions. To support decompositional analysis, we investigate \ntask datasets spanning diverse tasks, including natural language understanding, mathematics, programming, and vision-language tasks. Through extensive evaluations, we characterize LLM behavior across each decompositional stage and identify how modality type and intermediate reasoning influence performance. By establishing a structured framework for analyzing counterfactual reasoning, this work contributes to the development of more reliable LLM-based reasoning systems and informs future elicitation strategies.

Cited by

Discussions

Related