arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.04660cs.CL
收藏

播放日志(N)-句子上的问题

Playing log(N)-Questions over Sentences

Microsoft Research Montreal(蒙特利尔微软研究院)

Peter Potash, Kaheer Suleman

摘要:

我们提出了一个两个代理人的游戏,其中一个提问者必须能够变戏法辨别句子之间的问题,将回答者的反应,并保持跟踪的假设状态。提问者必须能够理解做出最终猜测所需的信息,同时也能够根据回答者的回答对游戏的文本环境进行推理。我们用一个端到端的模型进行了实验,在这个模型中,两个代理都可以同时学习玩游戏,这表明同时实现高游戏准确性和产生有意义的问题可能是一个困难的权衡。

英文摘要:

We propose a two-agent game wherein a questioner must be able to conjure discerning questions between sentences, incorporate responses from an answerer, and keep track of a hypothesis state. The questioner must be able to understand the information required to make its final guess, while also being able to reason over the game's text environment based on the answerer's responses. We experiment with an end-to-end model where both agents can learn simultaneously to play the game, showing that simultaneously achieving high game accuracy and producing meaningful questions can be a difficult trade-off.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑