DomainSum: A Hierarchical Benchmark for Fine-Grained Domain Shift in Abstractive Text Summarization

Haohan Yuan, Haopeng Zhang
10/21/2024
cs.CL

No official code found. Best implementation: hpzhang94/DomainSum (2 stars, last commit 2025-01-15).

Abstract

Most research on abstractive summarization focuses on single-domain applications, often neglecting how domain shifts between documents affect performance and the generalization ability of summarization models. To address this issue, we introduce DomainSum, a hierarchical benchmark designed to capture fine-grained domain shifts in abstractive summarization. We categorize these shifts into three levels: genre, style, and topic, and demonstrate through comprehensive benchmark analysis that they follow a hierarchical structure. Furthermore, we evaluate the domain generalization capabilities of commonly used pre-trained language models (PLMs) and large language models (LLMs) in in-domain and cross-domain settings.

View on arXivView PDF

Code Implementations(1)

hpzhang94/DomainSumCommunity100%
20Shell, PythonOct 15, 20241 years ago

Similar Papers

Cite this paper

@article{yuan2024domainsum,
  title  = {DomainSum: A Hierarchical Benchmark for Fine-Grained Domain Shift in Abstractive Text Summarization},
  author = {Haohan Yuan and Haopeng Zhang},
  year   = {2024},
  eprint = {2410.15687},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2410.15687v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.15687.svg)](https://codeofpaper.com/paper/2410.15687)

Discussion