Data augmentation (DA) plays a vital role in improving model performance in low-resource or limited-supervision scenarios within Natural Language Processing (NLP). Existing DA methods, such as synonym replacement and back-translation, have demonstrated effectiveness on the word or sentence level; however, they frequently neglect discourse-level coherence and logical flow, which are essential for complex tasks dependent on inter-sentential relationships. In this paper, we propose a structure-preserving document-level data augmentation framework based on large language models (LLMs) and document-level discourse structure parsing. Our approach identifies rhetorical relations between sentence pairs and extracts key phrases, which are then replaced with semantically coherent but topically shifted content while preserving the original discourse structure. Experimental results on text summarization and question answering show that the proposed augmented data provides complementary supervision and improves combined-data training across the evaluated tasks. Comparisons with a standard RST parser and controlled ablations further support the proposed discourse representation.
Figures & tables
Figure 1: Structure-preserving document-level data augmentation.
Training Configuration
Chinese Abstractive Corpus
Newsroom
IndoSum
B
R1
R2
RL
B
R1
R2
RL
B
R1
R2
RL
Reference Settings
Zero-shot LLM 4
0.139
0.290
0.193
0.265
0.267
0.401
0.290
0.364
0.151
0.290
0.248
0.273
Inp
0.249
0.391
0.312
0.372
0.634
0.697
0.657
0.686
0.728
0.749
0.741
0.747
Con
0.228
0.370
0.289
0.351
0.653
0.712
0.676
0.703
0.746
0.765
0.756
0.763
Inp+Con
0.269
0.392
0.318
0.376
0.686
0.741
0.709
0.733
0.757
0.783
0.776
0.782
Table 1: Performance of fine-tuning and data augmentation methods on the Chinese Abstractive Corpus, Newsroom, and IndoSum. B, R1, R2, and RL denote BLEU, ROUGE-1, ROUGE-2, and ROUGE-L.
Training Configuration
SQuAD
JaQuAD
EM
F1
EM
F1
Reference Settings
Zero-shot LLM 4
0.636
0.791
0.659
0.773
Inp
0.708
0.780
0.547
0.713
Con
0.690
0.742
0.598
0.743
Inp+Con
0.697
0.746
0.681
0.729
Table 2: Performance of fine-tuning and data augmentation methods on the English SQuAD and Japanese JaQuAD question answering tasks.
Method
Configuration
Chinese Abstractive Corpus
Newsroom
SQuAD
BLEU
R1
R2
RL
BLEU
R1
R2
RL
EM
F1
Proposed method
Full method
Aug
0.247
0.383
0.304
0.360
0.639
0.696
0.658
0.686
0.698
0.740
Inp+Aug
0.269
0.395
0.319
0.379
0.775
0.796
0.765
0.787
0.701
0.751
Inp+Con+Aug
0.276
0.417
0.343
0.400
0.780
0.789
0.757
0.780
0.731
0.779
Comparison with UniRST
Table 3: Comparison with UniRST and controlled discourse ablations under matched training configurations.
Dataset
Training Configuration
BertSum
SimCLS
BLEU
R-1
R-2
R-L
BLEU
R-1
R-2
R-L
Chinese Abstractive Corpus
Inp
0.430
0.515
0.462
0.502
0.439
0.522
0.466
0.507
Con
0.411
0.497
0.440
0.482
0.423
0.507
0.450
0.492
Aug
0.415
0.496
0.445
0.484
0.439
0.517
0.463
0.503
Inp+Con
0.422
0.505
0.452
0.492
0.424
0.509
0.453
0.493
Inp+Aug
0.422
0.508
0.451
0.493
0.431
0.516
0.458
0.501
Table 4: Performance of BertSum and SimCLS on the text summarization task. Inp, Con, and Aug denote the original input, control data, and our augmented data, respectively. Aug-MixSumm denotes the training configuration using MixSumm-generated augmented data ( Sahu et al., 2025 ) .
Training Configuration
RoBERTa
ELECTRA
EM
F1
EM
F1
Inp
0.611
0.748
0.618
0.749
Con
0.620
0.762
0.602
0.750
Aug
0.625
0.748
0.609
0.751
Inp+Con
0.633
0.775
0.624
0.775
Inp+Aug
0.621
0.761
0.627
0.762
Table 5: Performance of RoBERTa and ELECTRA on SQuAD. Inp, Con, and Aug denote the original input, control data, and our augmented data, respectively. Aug-Two-Step denotes the training configuration using Two-Step QA augmentation ( Chowdhury and Chadha, 2024 ) .
Coarse relation families: Evaluation and Summary. Source relation labels: evaluation-comment , restatement-partial , and restatement-repetition .
Continuation & Expansion
Coarse relation families: Textual Organization, Same-Unit, Span, and other structural relations. Source relation labels: organization-heading , organization-phatic , organization-preparation , same-unit , and other unmatched structural labels.
Appendix
Table 6: Relation label mapping used in our framework, where fine-grained discourse relation labels predicted by UniRST are grouped into six target categories. The grouping is designed for document augmentation purposes and follows semantic correspondence between relations rather than modifying the original UniRST relation definitions.
Topic-controlled summarisation enables users to generate summaries focused on specific aspects of source documents. This paper investigates a data augmentation strategy for training small language models (sLMs) to perform topic-controlled summarisation. We propose a pairwise data augmentation method that combines contexts from different documents to create contrastive training examples, enabling models to learn the relationship between topics and summaries more effectively. Using the SciTLDR dataset enriched with Wikipedia-derived topics, we systematically evaluate how augmentation scale affects model performance. Results show consistent improvements in win rate and semantic alignment as the augmentation scale increases, while the amount of real training data remains fixed. Consequently, a T5-base model trained with our augmentation approach achieves competitive performance relative to larger models, despite using significantly fewer parameters and substantially fewer real training examples.
Nathikan Yodthapa, Thanapong Intharah, Sahan Bulathwela
Visual Intelligence Laboratory, Department of Statistics, Faculty of Science, Khon Kaen University, Khon Kaen 40002, Thailand · Centre for Artificial Intelligence, Department of Computer Science, University College London, London WC1E 6BT, The United Kingdom
Document parsing has recently advanced with multimodal large language models (MLLMs) that directly map document images to structured outputs. Traditional cascaded pipelines depend on precise layout analysis and often fail under casually captured or non-standard conditions. Although end-to-end approaches mitigate this dependency, they still exhibit repetitive, hallucinated, and structurally inconsistent predictions - primarily due to the scarcity of large-scale, high-quality full-page (document-level) end-to-end parsing data and the lack of structure-aware training strategies. To address these challenges, we propose a data-training co-design framework for robust end-to-end document parsing. A Realistic Scene Synthesis strategy constructs large-scale, structurally diverse full-page end-to-end supervision by composing layout templates with rich document elements, while a Document-Aware Training Recipe introduces progressive learning and structure-token optimization to enhance structural fidelity and decoding stability. We further build Wild-OmniDocBench, a benchmark derived from real-world captured documents for robustness evaluation. Integrated into a 1B-parameter MLLM, our method achieves superior accuracy and robustness across both scanned/digital and real-world captured scenarios. All models, data synthesis pipelines, and benchmarks will be publicly released to advance future research in document understanding.
Gengluo Li, Pengyuan Lyu, Chengquan Zhang +7
Institute of Information Engineering, Chinese Academy of Sciences · University of Chinese Academy of Sciences · Tencent +2
As language-model compute continues to scale, high-quality training data is becoming an increasingly important bottleneck. Conventional next-token prediction supervises what follows a context but leaves the intermediate reasoning behind that continuation implicit. We introduce REER-PT, a scalable framework that extends Reverse-Engineered Reasoning (REER) to raw pre-training data. REER-PT identifies continuations that are difficult to predict but can still be inferred from the preceding context, and inserts concise reasoning annotations that reconstruct the missing connection between context and continuation. Candidate annotations are generated and refined offline, with perplexity serving as the optimization signal. Constraints on length and target leakage filter out unhelpful or trivial annotations. This sparse transformation preserves the source text and remains compatible with standard next-token prediction, avoiding online reasoning rollouts during pre-training. We apply REER-PT to transform a source pre-training corpus into an augmented one. Across augmented-data, original-token, and selected-continuation comparisons, perplexity reductions range from 0.42 to 7.29, and only about 0.05% of annotation 13-grams appear verbatim in the source text. We then train two 680M-parameter models with the same architecture and training configuration on the source and augmented corpora, respectively. The augmented-data model gains up to 2.07 percentage points on several knowledge and reasoning benchmarks. Together, the perplexity analysis indicates improved continuation predictability, while the controlled pre-training experiments suggest that this augmentation can improve model performance without changing the standard pre-training objective.
Haoran Que, Jiajun Shi, Ting Huang +7
Peking University · ByteDance Seed · Work done at ByteDance Seed +1