We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Reading comprehension models are based on recurrent neural networks that sequentially process the document tokens. As interest turns to answering more complex questions over longer documents, sequential reading of large portions of text becomes a substantial bottleneck. Inspired by how humans use document structure, we propose a novel framework for reading comprehension. We represent documents as trees, and model an agent that learns to interleave quick navigation through the document tree with more expensive answer extraction. To encourage exploration of the document tree, we propose a new algorithm, based on Deep Q-Network (DQN), which strategically samples tree nodes at training time. Empirically we find our algorithm improves question answering performance compared to DQN and a strong information-retrieval (IR) baseline, and that ensembling our model with the IR baseline results in further gains in performance.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1806.03529")
get_code_for_paper("1806.03529")
have("1806.03529")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1806.03529.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1806.03529)
Connect an agent — have() is free.