TL;DR
This paper evaluates pretrained language models BART and T5 for graph-to-text generation, demonstrating state-of-the-art results across multiple datasets and highlighting the benefits of task-adaptive pretraining strategies.
Contribution
It provides a comprehensive analysis of PLMs in graph-to-text tasks and introduces effective pretraining strategies that enhance their performance.
Findings
BART and T5 achieve new state-of-the-art BLEU scores.
Task-adaptive pretraining improves model performance.
PLMs' factual knowledge aids in graph-to-text generation.
Abstract
Graph-to-text generation aims to generate fluent texts from graph-based data. In this paper, we investigate two recently proposed pretrained language models (PLMs) and analyze the impact of different task-adaptive pretraining strategies for PLMs in graph-to-text generation. We present a study across three graph domains: meaning representations, Wikipedia knowledge graphs (KGs) and scientific KGs. We show that the PLMs BART and T5 achieve new state-of-the-art results and that task-adaptive pretraining strategies improve their performance even further. In particular, we report new state-of-the-art BLEU scores of 49.72 on LDC2017T10, 59.70 on WebNLG, and 25.66 on AGENDA datasets - a relative improvement of 31.8%, 4.5%, and 42.4%, respectively. In an extensive analysis, we identify possible reasons for the PLMs' success on graph-to-text tasks. We find evidence that their knowledge about…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsLinear Layer · Gated Linear Unit · Attention Dropout · Inverse Square Root Schedule · Byte Pair Encoding · Adam · Dense Connections · Residual Connection · Dropout · SentencePiece
