Multi-Action Dialog Policy Learning from Logged User Feedback
Not on the map. Why?
Abstract (arXiv)
Multi-action dialog policy, which generates multiple atomic dialog actions per turn, has been widely applied in task-oriented dialog systems to provide expressive and efficient system responses. Existing policy models usually imitate action combinations from the labeled multi-action dialog examples. Due to data limitations, they generalize poorly toward unseen dialog flows. While reinforcement learning-based methods are proposed to incorporate the service ratings from real users and user simulators as external supervision signals, they suffer from sparse and less credible dialog-level rewards. To cope with this problem, we explore to improve multi-action dialog policy learning with explicit and implicit turn-level user feedback received for historical predictions (i.e., logged user feedback) that are cost-efficient to collect and faithful to real-world scenarios. The task is challenging since the logged user feedback provides only partial label feedback limited to the particular historical dialog actions predicted by the agent. To fully exploit such feedback information, we propose BanditMatch, which addresses the task from a feedback-enhanced semi-supervised learning perspective with a hybrid objective of semi-supervised learning and bandit learning. BanditMatch integrates pseudo-labeling methods to better explore the action space through constructing full label feedback. Extensive experiments show that our BanditMatch outperforms the state-of-the-art methods by generating more concise and informative responses. The source code and the appendix of this paper can be obtained from https://github.com/ShuoZhangXJTU/BanditMatch.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 34 references that are in the map. First posted on arXiv 27 Feb 2023.
Builds on
24 of 34 references.
References · 24
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
- 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,057
- 2021FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labelingcited by 537
- 2016Learning Representations for Counterfactual Inferencecited by 327
- 2021In Defense of Pseudo-Labeling: An Uncertainty-Aware Pseudo-label Selection Framework for Semi-Supervised Learningcited by 301
- 2021A Survey on Deep Semi-supervised Learningcited by 250
- 2021Dash: Semi-Supervised Learning with Dynamic Thresholdingcited by 147
- 2016Off-policy evaluation for slate recommendationcited by 102
- 2020Human-centric Dialog Training via Offline Reinforcement Learningcited by 92
- 2020Recent Advances and Challenges in Task-oriented Dialog Systemcited by 78
12 more
- 2018Can Neural Machine Translation be Improved with User Feedback?cited by 71
- 2020Off-policy Bandits with Deficient Supportcited by 60
- 2019Guided Dialog Policy Learning: Reward Estimation for Multi-Domain Task-Oriented Dialogcited by 37
- 2018Adversarial Learning of Task-Oriented Neural Dialog Modelscited by 17
- 2020Learning Dialog Policies from Weak Demonstrationscited by 10
- 2020Semi-Supervised Dialogue Policy Learning via Stochastic Reward Estimationcited by 8
- 2020Guided Dialog Policy Learning without Adversarial Learning in the Loopcited by 7
- 2021Enhancing Counterfactual Classification via Self-Trainingcited by 5
- 2019Modeling Multi-Action Policy for Task-Oriented Dialoguescited by 4
- 2020Learning to Check Contract Inconsistenciescited by 3
- 2022"Think Before You Speak": Improving Multi-Action Dialog Policy by Planning Single-Action Dialogscited by 3
- 2020Learning Multiclass Classifier Under Noisy Bandit Feedbackcited by 2
Built on by
Not cited yet.