Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hu, Huang, Wu, Xianchao, Luo, Bingfeng, Tao, Chongyang, Xu, Can, Wu, Wei, Chen, Zhan
Format: Preprint
Veröffentlicht: 2018
Schlagworte:
Online-Zugang:https://arxiv.org/abs/1808.07645
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866918327909089280
author Hu, Huang
Wu, Xianchao
Luo, Bingfeng
Tao, Chongyang
Xu, Can
Wu, Wei
Chen, Zhan
author_facet Hu, Huang
Wu, Xianchao
Luo, Bingfeng
Tao, Chongyang
Xu, Can
Wu, Wei
Chen, Zhan
contents The 20 Questions (Q20) game is a well known game which encourages deductive reasoning and creativity. In the game, the answerer first thinks of an object such as a famous person or a kind of animal. Then the questioner tries to guess the object by asking 20 questions. In a Q20 game system, the user is considered as the answerer while the system itself acts as the questioner which requires a good strategy of question selection to figure out the correct object and win the game. However, the optimal policy of question selection is hard to be derived due to the complexity and volatility of the game environment. In this paper, we propose a novel policy-based Reinforcement Learning (RL) method, which enables the questioner agent to learn the optimal policy of question selection through continuous interactions with users. To facilitate training, we also propose to use a reward network to estimate the more informative reward. Compared to previous methods, our RL method is robust to noisy answers and does not rely on the Knowledge Base of objects. Experimental results show that our RL method clearly outperforms an entropy-based engineering system and has competitive performance in a noisy-free simulation environment.
format Preprint
id arxiv_https___arxiv_org_abs_1808_07645
institution arXiv
publishDate 2018
record_format arxiv
spellingShingle Playing 20 Question Game with Policy-Based Reinforcement Learning
Hu, Huang
Wu, Xianchao
Luo, Bingfeng
Tao, Chongyang
Xu, Can
Wu, Wei
Chen, Zhan
Human-Computer Interaction
Artificial Intelligence
Computation and Language
The 20 Questions (Q20) game is a well known game which encourages deductive reasoning and creativity. In the game, the answerer first thinks of an object such as a famous person or a kind of animal. Then the questioner tries to guess the object by asking 20 questions. In a Q20 game system, the user is considered as the answerer while the system itself acts as the questioner which requires a good strategy of question selection to figure out the correct object and win the game. However, the optimal policy of question selection is hard to be derived due to the complexity and volatility of the game environment. In this paper, we propose a novel policy-based Reinforcement Learning (RL) method, which enables the questioner agent to learn the optimal policy of question selection through continuous interactions with users. To facilitate training, we also propose to use a reward network to estimate the more informative reward. Compared to previous methods, our RL method is robust to noisy answers and does not rely on the Knowledge Base of objects. Experimental results show that our RL method clearly outperforms an entropy-based engineering system and has competitive performance in a noisy-free simulation environment.
title Playing 20 Question Game with Policy-Based Reinforcement Learning
topic Human-Computer Interaction
Artificial Intelligence
Computation and Language
url https://arxiv.org/abs/1808.07645