Text summarization via global structure awareness
Jiaquan Zhang, Chaoning Zhang, Shuxu Chen, Yibei Liu, Chenghao Li, Qigan Sun, Shuai Yuan, Fachrina Dewi Puspitasari, Dongshen Han, Guoqing Wang, Sung-Ho Bae, Yang Yang
Abstract
With the explosive growth of information, the volume of long documents has surged, and the cost of processing them continues to rise, making text summarization increasingly important. Existing studies primarily focus on model enhancements and sentence-level pruning based on contextual dependencies and semantic patterns. Although some approaches leverage large language models (LLMs) for text summarization and achieve higher accuracy, they incur substantial computational costs and often overlook global structural modeling. Consequently, summarized texts may lose critical logical chains, disrupting coherence and weakening downstream task performance. To address these issues, we propose GloSA-Sum, a novel text summarization framework that performs global structural analysis of texts via topological data analysis (TDA), enabling efficient summarization while preserving semantic cores and logical dependencies. Specifically, we construct a semantic-weighted graph from sentence embeddings, where persistent homology identifies core semantics and logical structures, preserved in a ``protection pool'' as the backbone for summarization. We design a topology-guided iterative strategy, where lightweight proxy metrics approximate sentence importance to avoid repeated high-cost computations, thus preserving structural integrity while improving efficiency. To further enhance long-text processing, we propose a hierarchical strategy that integrates segment-level and global summarization. Experiments on multiple datasets demonstrate that GloSA-sum reduces redundancy while preserving semantic and logical integrity, striking a balance between accuracy and efficiency, and further benefits LLM downstream tasks by shortening contexts while retaining essential reasoning chains.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d710f32b-4c5b-41a3-86e9-edff3567fe8aCited by top-tier papers1
Ask how each one uses itBuilds on9
- Retrieval-Augmented Generation for Knowledge-Intensive NLP TasksPatrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni et al.NeurIPS 2020 · 19,162 citations
- Big Bird: Transformers for Longer SequencesManzil Zaheer, Guru Guruganesh, Kumar Avinava Dubey, Joshua Ainslie et al.NeurIPS 2020 · 3,159 citations
- PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive SummarizationJingqing Zhang, Yao Zhao, Mohammad Saleh, Peter J. LiuICML 2020 · 2,453 citations
- BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and ComprehensionMike Lewis, Yinhan Liu, Naman Goyal, Marjan Ghazvininejad et al.ACL 2020 · 1,224 citations
- Extractive Summarization as Text MatchingMing Zhong, Pengfei Liu, Yiran Chen, Danqing Wang et al.ACL 2020 · 410 citations
Related papers
- Learning Global Hypothesis Space for Enhancing Synergistic Reasoning ChainJiaquan Zhang, Chaoning Zhang, Shuxu Chen, Xudong Wang et al.ICLR 2026 · 18 citations
- Persistent Topological Features in Large Language ModelsYuri Gardinazzi, Karthik Viswanathan, Giada Panerai, Alessio Ansuini et al.ICML 2025
- Neural Approximation of Graph Topological FeaturesZuoyu Yan, Tengfei Ma, Liangcai Gao, Zhi Tang et al.NeurIPS 2022 · 26 citations
- Boosting Graph Pooling with Persistent HomologyChaolong Ying, Xinjian Zhao, Tianshu YuNeurIPS 2024 · 20 citations
- AdmTree: Compressing Lengthy Context with Adaptive Semantic TreesYangning Li, Shaoshen Chen, Yinghui Li, Yankai Chen et al.NeurIPS 2025 · 8 citations
