Demian Ghalandari, Chris Hokamp, Georgiana Ifrim
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Sentence compression reduces the length of text by removing non-essential content while preserving important facts and grammaticality. Unsupervised objective driven methods for sentence compression can be used to create customized models without the need for ground-truth training data, while allowing flexibility in the objective function(s) that are used for learning and inference. Recent unsupervised sentence compression approaches use custom objectives to guide discrete search; however, guided search is expensive at inference time. In this work, we explore the use of reinforcement learning to train effective sentence compression models that are also fast when generating predictions. In particular, we cast the task as binary sequence labelling and fine-tune a pre-trained transformer using a simple policy gradient approach. Our approach outperforms other unsupervised models while also being more efficient at inference time.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2205.08221")
get_code_for_paper("2205.08221")
have("2205.08221")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2205.08221.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2205.08221)
Connect an agent — have() is free.