Causal discovery and counterfactual reasoning to optimize persuasive dialogue policies.

Saved in:
Bibliographic Details
Title: Causal discovery and counterfactual reasoning to optimize persuasive dialogue policies.
Authors: Zeng, Donghuo (AUTHOR), Legaspi, Roberto (AUTHOR), Sun, Yuewen (AUTHOR), Dong, Xinshuai (AUTHOR), Ikeda, Kazushi (AUTHOR), Spirtes, Peter (AUTHOR), Zhang, Kun (AUTHOR)
Source: Behaviour & Information Technology. May2026, Vol. 45 Issue 8, p1515-1529. 15p.
Subjects: Reinforcement (Psychology), Architecture, Persuasion (Rhetoric), Medical informatics, Causal models, Learning, Behavior, Problem solving, Causality (Physics), Thought & thinking, Algorithms
Abstract: Tailoring persuasive conversations to users leads to more effective persuasion. However, existing dialogue systems often struggle to adapt to dynamically evolving user states. This paper presents a novel method that leverages causal discovery and counterfactual reasoning for optimising system persuasion capability and outcomes. We employ the Greedy Relaxation of the Sparsest Permutation (GRaSP) algorithm to identify causal relationships between user and system utterance strategies, treating user strategies as states and system strategies as actions. GRaSP identifies user strategies as causal factors influencing system responses, which inform a Bidirectional Conditional Generative Adversarial Network (BiCoGAN) in generating counterfactual utterances for the system. Subsequently, we use the Dueling Double Deep Q-Network (D3QN) model to utilise counterfactual data to determine the best policy for selecting system utterances. Our experiments with the PersuasionForGood dataset show measurable improvements in persuasion outcomes using our approach compared to baseline methods. The observed increase in cumulative rewards and Q-values highlights the effectiveness of causal discovery in enhancing counterfactual reasoning and optimising reinforcement learning policies for online dialogue systems. [ABSTRACT FROM AUTHOR]
Copyright of Behaviour & Information Technology is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Psychology and Behavioral Sciences Collection
Full text is not displayed to guests.
Description
Abstract:Tailoring persuasive conversations to users leads to more effective persuasion. However, existing dialogue systems often struggle to adapt to dynamically evolving user states. This paper presents a novel method that leverages causal discovery and counterfactual reasoning for optimising system persuasion capability and outcomes. We employ the Greedy Relaxation of the Sparsest Permutation (GRaSP) algorithm to identify causal relationships between user and system utterance strategies, treating user strategies as states and system strategies as actions. GRaSP identifies user strategies as causal factors influencing system responses, which inform a Bidirectional Conditional Generative Adversarial Network (BiCoGAN) in generating counterfactual utterances for the system. Subsequently, we use the Dueling Double Deep Q-Network (D3QN) model to utilise counterfactual data to determine the best policy for selecting system utterances. Our experiments with the PersuasionForGood dataset show measurable improvements in persuasion outcomes using our approach compared to baseline methods. The observed increase in cumulative rewards and Q-values highlights the effectiveness of causal discovery in enhancing counterfactual reasoning and optimising reinforcement learning policies for online dialogue systems. [ABSTRACT FROM AUTHOR]
ISSN:0144929X
DOI:10.1080/0144929X.2025.2478276