| Challenge: | Recent work on pretraining languages have achieved satisfying results in many NLP tasks, but they are still restricted by a pre-defined maximum length. |
| Approach: | They propose a graph-based method to model sentence-level information using a fixed length and graphs to model intra- and cross-sentence correlations. |
| Outcome: | The proposed model outperforms baseline models by 2.6% in F1 score, and 4.8% on the longest sequence dataset. |
Similar Papers
Recurrent Attention Networks for Long-text Modeling (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to encoding long documents using self-attention have been limited by quadratic computational complexities and limited application in long text processing. |
| Approach: | They propose a long-document encoding model that allows the recurrent operation of self-attention. |
| Outcome: | The proposed model extracts global semantics in token-level and document-level representations, making it inherently compatible with both sequential and sequential tasks. |
Beyond Paragraphs: NLP for Long Sequences (2021.naacl-tutorials)
Copied to clipboard
| Challenge: | In this tutorial, we will introduce document-level representation learning techniques . document-based learning is challenging due to the limited sequence length of many models . |
| Approach: | They will provide an overview of established long sequence NLP techniques and discuss memory-saving methods that are key to processing long sequences. |
| Outcome: | The tutorial will introduce the latest and ongoing techniques for document-level representation learning. |
Graph-tree Fusion Model with Bidirectional Information Propagation for Long Document Classification (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for document classification struggle with token limits and fail to adequately model hierarchical relationships within documents. |
| Approach: | They propose a novel model leveraging a graph-tree structure to capture local and global dependencies. |
| Outcome: | The proposed model captures syntactic relationships and broader document contexts without token limits and can handle arbitrarily long contexts. |
HeterGraphLongSum: Heterogeneous Graph Neural Network with Passage Aggregation for Extractive Long Document Summarization (2022.coling-1)
Copied to clipboard
| Challenge: | Existing models for extractive document summarization are based on sequence-to-sequence (Seq2Sequency) but long-form document summaries using graph-based methods are still an open research issue. |
| Approach: | They propose a heterogeneous graph neural network model to improve the performance of extractive document summarization using graph-based methods. |
| Outcome: | The proposed model can achieve state-of-the-art performance without pre-trained language models. |
Multi Graph Neural Network for Extractive Long Document Summarization (2022.coling-1)
Copied to clipboard
| Challenge: | Heterogeneous Graph Neural Networks (GNN) have been proposed as an emergent approach for extracting document summarization (EDS) but there are still limitations in applying it for long documents due to the lack of inter-sentence connections. |
| Approach: | They propose to build a graph on sentence-level nodes and combine it with HeterGNN to capture the semantic information in terms of both inter and intra-sentence connections. |
| Outcome: | Experiments on two datasets show that the proposed method achieves state-of-the-art in this research field. |
Text Level Graph Neural Network for Text Classification (D19-1)
Copied to clipboard
| Challenge: | Recent researches have explored graph neural network (GNN) techniques on text classification, but they are faced with the problems of fixed corpus level graph structure which don’t support online testing and high memory consumption. |
| Approach: | They propose a graph neural network model that builds graphs for each input text with global parameters sharing instead of a single graph for the whole corpus. |
| Outcome: | The proposed model outperforms existing models on several text classification datasets even with consuming less memory. |
Adapting Pretrained Text-to-Text Models for Long Text Sequences (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing short-context models are limited in their domain coverage and can be used for long-sequence inputs. |
| Approach: | They propose to replace full attention in transformers with pooling-augmented blockwise attention and pretrain the model with a masked-span prediction task with spans of varying lengths. |
| Outcome: | The proposed model outperforms existing models on long-sequence summarization tasks and achieves competitive performance on long document corpora. |
Exploiting Rich Syntactic Information for Semantic Parsing with Graph-to-Sequence Model (D18-1)
Copied to clipboard
| Challenge: | Existing neural semantic parsers extract word order features while neglecting other valuable syntactic information. |
| Approach: | They propose to use syntactic graph to represent three types of syntaktic information . they then employ a graph-to-sequence model to encode the syntastic graph and decode a logical form . |
| Outcome: | The proposed model is comparable to the state-of-the-art on Jobs640, ATIS, and Geo880. |
HEGEL: Hypergraph Transformer for Long Document Summarization (2022.emnlp-main)
Copied to clipboard
| Challenge: | Abstract: Extractive summarization for long documents is challenging due to the extended structured input context. |
| Approach: | They propose a hypergraph neural network for extractive summarization by capturing cross-sentence relations. |
| Outcome: | The proposed model can capture cross-sentence relations and latent topics and keywords coreference, and section structure, and can be applied to scientific papers. |
NextLevelBERT: Masked Language Modeling with Higher-Level Representations for Long Documents (2024.acl-long)
Copied to clipboard
| Challenge: | (large) language models struggle to process long sequences due to the quadratic scaling of the underlying attention mechanism. |
| Approach: | They propose a Masked Language Model operating on higher-level semantic representations in the form of text embeddings to solve this problem. |
| Outcome: | The proposed model outperforms larger embedding models on three types of tasks. |