Pith. sign in

REVIEW 1 cited by

Iterative Hierarchical Attention for Answering Complex Questions over Long Documents

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.00200 v2 pith:LPVKCSQU submitted 2021-06-01 cs.CL cs.AI

classification cs.CLcs.AI
keywords dochopperdocumentlonganswercomplexdocumentsinformationmulti-hop
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We propose a new model, DocHopper, that iteratively attends to different parts of long, hierarchically structured documents to answer complex questions. Similar to multi-hop question-answering (QA) systems, at each step, DocHopper uses a query $q$ to attend to information from a document, combines this ``retrieved'' information with $q$ to produce the next query. However, in contrast to most previous multi-hop QA systems, DocHopper is able to ``retrieve'' either short passages or long sections of the document, thus emulating a multi-step process of ``navigating'' through a long document to answer a question. To enable this novel behavior, DocHopper does not combine document information with $q$ by concatenating text to the text of $q$, but by combining a compact neural representation of $q$ with a compact neural representation of a hierarchical part of the document, which can potentially be quite large. We experiment with DocHopper on four different QA tasks that require reading long and complex documents to answer multi-hop questions, and show that DocHopper achieves state-of-the-art results on three of the datasets. Additionally, DocHopper is efficient at inference time, being 3--10 times faster than the baselines.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Hybrid Graphs for Table-and-Text based Question Answering using LLMs

    cs.CL 2025-01 conditional novelty 6.0 of 10

    A zero-shot table-text QA method that builds a hybrid graph of table cells and passage entities, prunes it via question-entity matching and 3-hop BFS, and feeds the pruned context to an LLM, improving EM and reducing ...

Pith tools