Stage-wise fine-tuning for graph-to-text generation

12Citations
Citations of this article
60Readers
Mendeley users who have this article in their library.

Abstract

Graph-to-text generation has benefited from pre-trained language models (PLMs) in achieving better performance than structured graph encoders. However, they fail to fully utilize the structure information of the input graph. In this paper, we aim to further improve the performance of the pre-trained language model by proposing a structured graph-to-text model with a two-step fine-tuning mechanism which first fine-tunes the model on Wikipedia before adapting to the graph-to-text generation. In addition to using the traditional token and position embeddings to encode the knowledge graph (KG), we propose a novel tree-level embedding method to capture the interdependency structures of the input graph. This new approach has significantly improved the performance of all text generation metrics for the English WebNLG 2017 dataset.

Cite

CITATION STYLE

APA

Wang, Q., Yavuz, S., Lin, X. V., Ji, H., & Rajani, N. F. (2021). Stage-wise fine-tuning for graph-to-text generation. In ACL-IJCNLP 2021 - 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, Proceedings of the Student Research Workshop (pp. 16–22). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2021.acl-srw.2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free