mlsanityData to 7 Oct 2026

Anti-Overestimation Dialogue Policy Learning for Task-Completion Dialogue System

arXiv 2207.11762 ↗First posted 24 Jul 2022cs.CL cs.AIcited by 8

Not on the map. Why?

Abstract (arXiv)

A dialogue policy module is an essential part of task-completion dialogue systems. Recently, increasing interest has focused on reinforcement learning (RL)-based dialogue policy. Its favorable performance and wise action decisions rely on an accurate estimation of action values. The overestimation problem is a widely known issue of RL since its estimate of the maximum action value is larger than the ground truth, which results in an unstable learning process and suboptimal policy. This problem is detrimental to RL-based dialogue policy learning. To mitigate this problem, this paper proposes a dynamic partial average estimator (DPAV) of the ground truth maximum action value. DPAV calculates the partial average between the predicted maximum action value and minimum action value, where the weights are dynamically adaptive and problem-dependent. We incorporate DPAV into a deep Q-network as the dialogue policy and show that our method can achieve better or comparable results compared to top baselines on three dialogue datasets of different domains with a lower computational load. In addition, we also theoretically prove the convergence and derive the upper and lower bounds of the bias compared with those of other methods.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 17 of its 40 references that are in the map. First posted on arXiv 24 Jul 2022.

Builds on

17 of 40 references.

References · 17

  1. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
  2. 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 769
  3. 2019A Theoretical Analysis of Deep Q-Learningcited by 212
  4. 2017A Survey on Dialogue Systems: Recent Advances and New Frontierscited by 162
  5. 2020Controlling Overestimation Bias with Truncated Mixture of Continuous Distributional Quantile Criticscited by 154
  6. 2020SUNRISE: A Simple Unified Framework for Ensemble Learning in Deep Reinforcement Learningcited by 150
  7. 2020Maxmin Q-learning: Controlling the Estimation Bias of Q-learningcited by 117
  8. 2016Averaged-DQN: Variance Reduction and Stabilization for Deep Reinforcement Learningcited by 106
  9. 2020Recent Advances and Challenges in Task-oriented Dialog Systemcited by 78
  10. 2016A User Simulator for Task-Completion Dialoguescited by 56
  11. 2017End-to-End Task-Completion Neural Dialogue Systemscited by 52
  12. 2020A Probabilistic End-To-End Task-Oriented Dialog Model with Latent Belief States towards Semi-Supervised Learningcited by 47
5 more
  1. 2018Microsoft Dialogue Challenge: Building End-to-End Task-Completion Dialogue Systemscited by 46
  2. 2018Deep Dyna-Q: Integrating Planning for Task-Completion Dialogue Policy Learningcited by 21
  3. 2019Budgeted Policy Learning for Task-Oriented Dialogue Systemscited by 13
  4. 2018Switch-based Active Deep Dyna-Q: Efficient Adaptive Planning for Task-Completion Dialogue Policy Learningcited by 12
  5. 2013Estimating the Maximum Expected Value: An Analysis of (Nested) Cross Validation and the Maximum Sample Averagecited by 7

Built on by

Cited by year

Citing papers per year: 2024: 2; 2025: 6.

8 papers.