Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.12494 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929547278024704 |
|---|---|
| author | Enomoto, Masafumi Takeoka, Kunihiro Akimoto, Kosuke Gashteovski, Kiril Oyamada, Masafumi |
| author_facet | Enomoto, Masafumi Takeoka, Kunihiro Akimoto, Kosuke Gashteovski, Kiril Oyamada, Masafumi |
| contents | Open-Domain Multi-Document Summarization (ODMDS) is the task of generating summaries from large document collections in response to user queries. This task is crucial for efficiently addressing diverse information needs from users. Traditional retrieve-then-summarize approaches fall short for open-ended queries in ODMDS tasks. These queries often require broader context than initially retrieved passages provide, making it challenging to retrieve all relevant information in a single search. While iterative retrieval methods has been explored for multi-hop question answering (MQA), it's impractical for ODMDS due to high latency from repeated LLM inference. Accordingly, we propose LightPAL, a lightweight passage retrieval method for ODMDS. LightPAL leverages an LLM to pre-construct a graph representing passage relationships, then employs random walk during retrieval, avoiding iterative LLM inference. Experiments demonstrate that LightPAL outperforms naive sparse and pre-trained dense retrievers in both retrieval and summarization metrics, while achieving higher efficiency compared to iterative MQA approaches. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_12494 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | LightPAL: Lightweight Passage Retrieval for Open Domain Multi-Document Summarization Enomoto, Masafumi Takeoka, Kunihiro Akimoto, Kosuke Gashteovski, Kiril Oyamada, Masafumi Computation and Language Open-Domain Multi-Document Summarization (ODMDS) is the task of generating summaries from large document collections in response to user queries. This task is crucial for efficiently addressing diverse information needs from users. Traditional retrieve-then-summarize approaches fall short for open-ended queries in ODMDS tasks. These queries often require broader context than initially retrieved passages provide, making it challenging to retrieve all relevant information in a single search. While iterative retrieval methods has been explored for multi-hop question answering (MQA), it's impractical for ODMDS due to high latency from repeated LLM inference. Accordingly, we propose LightPAL, a lightweight passage retrieval method for ODMDS. LightPAL leverages an LLM to pre-construct a graph representing passage relationships, then employs random walk during retrieval, avoiding iterative LLM inference. Experiments demonstrate that LightPAL outperforms naive sparse and pre-trained dense retrievers in both retrieval and summarization metrics, while achieving higher efficiency compared to iterative MQA approaches. |
| title | LightPAL: Lightweight Passage Retrieval for Open Domain Multi-Document Summarization |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2406.12494 |