English

Efficient Dialog Policy Learning via Positive Memory Retention

Artificial Intelligence 2020-05-26 v3 Computation and Language Machine Learning

Abstract

This paper is concerned with the training of recurrent neural networks as goal-oriented dialog agents using reinforcement learning. Training such agents with policy gradients typically requires a large amount of samples. However, the collection of the required data in form of conversations between chat-bots and human agents is time-consuming and expensive. To mitigate this problem, we describe an efficient policy gradient method using positive memory retention, which significantly increases the sample-efficiency. We show that our method is 10 times more sample-efficient than policy gradients in extensive experiments on a new synthetic number guessing game. Moreover, in a real-word visual object discovery game, the proposed method is twice as sample-efficient as policy gradients and shows state-of-the-art performance.

Keywords

Cite

@article{arxiv.1810.01371,
  title  = {Efficient Dialog Policy Learning via Positive Memory Retention},
  author = {Rui Zhao and Volker Tresp},
  journal= {arXiv preprint arXiv:1810.01371},
  year   = {2020}
}

Comments

Published in IEEE Spoken Language Technology (SLT 2018), Athens, Greece

R2 v1 2026-06-23T04:26:12.607Z