Kai-Wei Chang, Di Wu, Wasi Ahmad
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.
Keyphrase Generation (KPG) is a longstanding task in NLP with widespread applications. The advent of sequence-to-sequence (seq2seq) pre-trained language models (PLMs) has ushered in a transformative era for KPG, yielding promising performance improvements. However, many design decisions remain unexplored and are often made arbitrarily. This paper undertakes a systematic analysis of the influence of model selection and decoding strategies on PLM-based KPG. We begin by elucidating why seq2seq PLMs are apt for KPG, anchored by an attention-driven hypothesis. We then establish that conventional wisdom for selecting seq2seq PLMs lacks depth: (1) merely increasing model size or performing task-specific adaptation is not parameter-efficient; (2) although combining in-domain pre-training with task adaptation benefits KPG, it does partially hinder generalization. Regarding decoding, we demonstrate that while greedy search achieves strong F1 scores, it lags in recall compared with samplingbased methods. Based on these insights, we propose DESEL, a likelihood-based decodeselect algorithm for seq2seq PLMs. DESEL improves greedy search by an average of 4.7% semantic F1 across five datasets. Our collective findings pave the way for deeper future investigations into PLM-based KPG.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2310.06374")
get_code_for_paper("2310.06374")
have("2310.06374")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2310.06374.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2310.06374)
Connect an agent — have() is free.