REVIEW 2 cited by
Meta-Transfer Learning for Low-Resource Abstractive Summarization
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
Signed reviews
read the original abstract
Neural abstractive summarization has been studied in many pieces of literature and achieves great success with the aid of large corpora. However, when encountering novel tasks, one may not always benefit from transfer learning due to the domain shifting problem, and overfitting could happen without adequate labeled examples. Furthermore, the annotations of abstractive summarization are costly, which often demand domain knowledge to ensure the ground-truth quality. Thus, there are growing appeals for Low-Resource Abstractive Summarization, which aims to leverage past experience to improve the performance with limited labeled examples of target corpus. In this paper, we propose to utilize two knowledge-rich sources to tackle this problem, which are large pre-trained models and diverse existing corpora. The former can provide the primary ability to tackle summarization tasks; the latter can help discover common syntactic or semantic information to improve the generalization ability. We conduct extensive experiments on various summarization corpora with different writing styles and forms. The results demonstrate that our approach achieves the state-of-the-art on 6 corpora in low-resource scenarios, with only 0.7% of trainable parameters compared to previous work.
Forward citations
Cited by 2 Pith papers
-
State Space Models for Extractive Summarization in Low Resource Scenarios
A Mamba-based extractive summarizer with Poincare distance features posts mixed ROUGE results on a small Amazon split, but circular ROUGE-derived labels and unreported baselines undermine the claimed gains.
-
A Split-then-Join Approach to Abstractive Summarization for Very Long Documents in a Low Resource Setting
On arXiv and BigPatent documents longer than 20,000 tokens, the SPIN 3 variant, which splits documents into 4,096-token chunks and selects the best chunk summary by ROUGE-L, improves ROUGE scores over a truncated BIGB...
Discussion (0). Continue with ORCID to comment.