Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Subgoal Discovery for Hierarchical Dialogue Policy Learning (1804.07855v3)

Published 20 Apr 2018 in cs.CL, cs.AI, and cs.LG

Abstract: Developing agents to engage in complex goal-oriented dialogues is challenging partly because the main learning signals are very sparse in long conversations. In this paper, we propose a divide-and-conquer approach that discovers and exploits the hidden structure of the task to enable efficient policy learning. First, given successful example dialogues, we propose the Subgoal Discovery Network (SDN) to divide a complex goal-oriented task into a set of simpler subgoals in an unsupervised fashion. We then use these subgoals to learn a multi-level policy by hierarchical reinforcement learning. We demonstrate our method by building a dialogue agent for the composite task of travel planning. Experiments with simulated and real users show that our approach performs competitively against a state-of-the-art method that requires human-defined subgoals. Moreover, we show that the learned subgoals are often human comprehensible.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Da Tang (13 papers)
  2. Xiujun Li (37 papers)
  3. Jianfeng Gao (344 papers)
  4. Chong Wang (308 papers)
  5. Lihong Li (72 papers)
  6. Tony Jebara (23 papers)
Citations (50)