Promoting Unsupervised Data‐To‐Text Generation Using Retraining and Unified Linearization

ABSTRACT In recent years, many studies have focused on unsupervised data‐to‐text generation methods. However, existing unsupervised methods still require a large amount of unlabeled sample training, leading to significant data collection overhead. We propose a low‐resource unsupervised method called CycleRUR. This method first converts various forms of structured data (such as tables, knowledge graph(KG) triples, and meaning representations(MR)) into unified KG triples to improve the model's ability to adapt to different structured data. Additionally, CycleRUR incorporates a retraining module and a contrastive learning module within a cycle training framework, enabling the model to learn and converge from a small amount of unpaired KG triples and reference text corpus, thereby improving the model's accuracy and convergence speed. We evaluated the model's performance on the WebNLG and E2E datasets. Using only 10% of unpaired training data, our method achieved the effects of fully supervised fine‐tuning. On the WebNLG dataset, it resulted in an 18.41% improvement in METEOR compared to supervised models. On the E2E dataset, it achieved improvements of 1.37% in METEOR and 4.97% in BLEU. Experiments also demonstrated that under unified linearization, CycleRUR exhibits good generalization capabilities.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2025-09-03
DOI
https://doi.org/10.1002/cpe.70254
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Promoting Unsupervised Data‐To‐Text Generation Using Retraining and Unified Linearization

Jing Cheng, Xuan Zhang, Chen Gao, Xiaobo Wang et al.
Concurrency and Computation Practice and Experience
Topic Modeling
article

Promoting Unsupervised Data‐To‐Text Generation Using Retraining and Unified Linearization

Jing Cheng, Xuan Zhang, Chen Gao, Xiaobo Wang, F. Liu, Kunpeng Du, Zhiyuan Ma
article en

Abstract

ABSTRACT In recent years, many studies have focused on unsupervised data‐to‐text generation methods. However, existing unsupervised methods still require a large amount of unlabeled sample training, leading to significant data collection overhead. We propose a low‐resource unsupervised method called CycleRUR. This method first converts various forms of structured data (such as tables, knowledge graph(KG) triples, and meaning representations(MR)) into unified KG triples to improve the model's ability to adapt to different structured data. Additionally, CycleRUR incorporates a retraining module and a contrastive learning module within a cycle training framework, enabling the model to learn and converge from a small amount of unpaired KG triples and reference text corpus, thereby improving the model's accuracy and convergence speed. We evaluated the model's performance on the WebNLG and E2E datasets. Using only 10% of unpaired training data, our method achieved the effects of fully supervised fine‐tuning. On the WebNLG dataset, it resulted in an 18.41% improvement in METEOR compared to supervised models. On the E2E dataset, it achieved improvements of 1.37% in METEOR and 4.97% in BLEU. Experiments also demonstrated that under unified linearization, CycleRUR exhibits good generalization capabilities.

Concurrency and Computation Practice and ExperienceVol. 37(23-24)
Yunnan University (CN), Yuntianhua Group (China) (CN), Yunnan Metallurgical Group (China) (CN)
Openalex Percentile: Top 88%
Topic Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.