Pith. sign in

REVIEW 2 cited by

Fast Abstractive Summarization with Reinforce-Selected Sentence Rewriting

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

arxiv 1805.11080 v1 pith:YPY6WC4M submitted 2018-05-28 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords modelachievedatasetfastfasterfirsthigherneural
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Inspired by how humans summarize long documents, we propose an accurate and fast summarization model that first selects salient sentences and then rewrites them abstractively (i.e., compresses and paraphrases) to generate a concise overall summary. We use a novel sentence-level policy gradient method to bridge the non-differentiable computation between these two neural networks in a hierarchical way, while maintaining language fluency. Empirically, we achieve the new state-of-the-art on all metrics (including human evaluation) on the CNN/Daily Mail dataset, as well as significantly higher abstractiveness scores. Moreover, by first operating at the sentence-level and then the word-level, we enable parallel decoding of our neural generative model that results in substantially faster (10-20x) inference speed as well as 4x faster training convergence than previous long-paragraph encoder-decoder models. We also demonstrate the generalization of our model on the test-only DUC-2002 dataset, where we achieve higher scores than a state-of-the-art model.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An Empirical Comparison on Imitation Learning and Reinforcement Learning for Paraphrase Generation

    cs.CL 2019-08 conditional novelty 5.0 of 10

    DAgger-style imitation learning outperforms REINFORCE reinforcement learning for paraphrase generation with a pointer-generator, and the best model reaches state-of-the-art scores on Quora.

  2. GeneSUM: Large Language Model-based Gene Summary Extraction

    q-bio.GN 2024-12 reject novelty 4.0 of 10

    A two-stage LLM pipeline that selects key sentences from gene literature via GO annotations and fine-tunes Gemma-7B to generate gene summaries, reporting large ROUGE gains that may be inflated by training/evaluation overlap.

Pith tools