mlsanityData to 14 Oct 2026

Make LLM Learn to Synthesize from Streaming Experiences through Feedback

arXiv 2605.29940 ↗First posted 28 May 2026cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) have been widely adopted for synthetic data generation, significantly reducing annotation costs. However, most existing studies treat synthesis as a set of isolated tasks and overlook a more fundamental question: whether a model can learn to synthesize by accumulating experience from past tasks and transferring it to future ones. In this work, we introduce StreamSynth, a new setting in which synthesis tasks arrive sequentially and experience from historical tasks provides informative signals for future synthesis. To address this setting, we propose SynLearner, a general framework that enables synthesis models to acquire reusable synthesis experience over a task stream. Instead of generating data independently for each task, SynLearner encourages the model to explore diverse synthesis patterns, learn from feedback, and balance sample quality with set-level diversity as tasks evolve. Extensive experiments across multiple benchmarks show that SynLearner effectively leverages experience from earlier tasks to improve synthesis performance on later ones, exhibiting consistent cross-task transferability. These findings provide evidence for the feasibility of StreamSynth and highlight synthetic data generation as an experience-driven process that can benefit from task streams.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 37 references that are in the map. First posted on arXiv 28 May 2026.

Builds on

24 of 37 references.

References · 24

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  4. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  5. 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,724
  6. 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
  7. 2023WizardLM: Empowering large pre-trained language models to follow complex instructionscited by 1,125
  8. 2023TinyStories: How Small Can Language Models Be and Still Speak Coherent English?cited by 449
  9. 2024Continual Learning of Large Language Models: A Comprehensive Surveycited by 234
  10. 2023Large Language Model as Attributed Training Data Generator: A Tale of Diversity and Biascited by 232
  11. 2023Rephrase and Respond: Let Large Language Models Ask Better Questions for Themselvescited by 123
  12. 2024InsCL: A Data-efficient Continual Learning Paradigm for Fine-tuning Large Language Models with Instructionscited by 58
12 more
  1. 2025MathSmith: Towards Extremely Hard Mathematical Reasoning by Forging Synthetic Problems with a Reinforced Policycited by 24
  2. 2025Mitigating Catastrophic Forgetting in Large Language Models with Forgetting-aware Pruningcited by 13
  3. 2025Continual Gradient Low-Rank Projection Fine-Tuning for LLMscited by 11
  4. 2025Beyond Induction Heads: In-Context Meta Learning Induces Multi-Phase Circuit Emergencecited by 10
  5. 2026QuitoBench: A High-Quality Open Time Series Forecasting Benchmarkcited by 10
  6. 2025Teaching LLMs How to Learn with Contextual Fine-Tuningcited by 4
  7. 2025Experience Replay Addresses Loss of Plasticity in Continual Learningcited by 4
  8. 2025Thought Purity: A Defense Framework For Chain-of-Thought Attackcited by 4
  9. 2025Aligning Large Language Models via Fully Self-Synthetic Datacited by 4
  10. 2025MetaLoRA: Tensor-Enhanced Adaptive Low-Rank Fine-tuningcited by 2
  11. 2025Logical Structure as Knowledge: Enhancing LLM Reasoning via Structured Logical Knowledge Density Estimationcited by 1
  12. 2026Beyond Retrieval: A Multitask Benchmark and Model for Code Searchcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.