paper-with-me

Papers

Dynamic Context Evolution for Scalable Synthetic Data Generation

2026-04-08 · Ryan Lingo, Rajeev Chhajer arxiv

Large language models produce repetitive output when prompted independently across many batches, a phenomenon we term cross-batch mode collapse: the progressive loss of output diversity when a language model is prompted repeatedly without access to its prior generations. Practitioners have long mitigated this with ad hoc deduplication and seed rotation, but no principled framework exists. We introduce Dynamic Context Evolution (DCE), comprising three mechanisms: (1) verbalized tail sampling (the model labels each idea with a guess about how obvious it is, and obvious ideas are discarded), which filters high-probability candidates via model self-assessment; (2) semantic memory, which maintains a persistent embedding index to reject near-duplicates across batches; and (3) adaptive prompt evolution, which reconstructs the generation prompt each batch using memory state and rotating diversity strategies. In experiments across three domains (sustainable packaging concepts, educational exam questions, and creative writing prompts) and two model families (gpt-5-mini and claude-haiku-4-5), a component ablation across 2-3 random seeds per method shows that DCE achieves 0.0 +/- 0.0% collapse versus 5.6 +/- 2.0% for naive prompting, while producing 17-18 HDBSCAN clusters per seed versus naive's volatile 2-17, indicating reliably richer conceptual structure. These results are validated with an independent embedding model (all-MiniLM-L6-v2) and hold across sensitivity sweeps of the VTS threshold tau and dedup threshold delta. Deduplication and prompt evolution are individually insufficient but jointly effective, at approximately $0.50 per 1,000 candidates using only standard API calls, with no fine-tuning or custom architectures required.

📄 PDF Abstract BibTeX arXiv:2604.07147

Code (0)

등록된 구현이 없습니다.

Tasks

Synthetic Data Generation

Similar Papers 제목 키워드 기반

Dynamic benchmarking framework for LLM-based conversational data capture

2025-02-04 · Pietro Alessandro Aluffi, Patrick Zietkiewicz, Marya Bazzi, Matt Arderne 외

The rapid evolution of large language models (LLMs) has transformed conversational agents, enabling complex human-machine interactions. However, evaluation frameworks often focus on single tasks, failing to capture the d…

Benchmarking

Synthetic Counteradaptation: A Principle of Human-AI Co-evolution

2026-03-31 · Ivar Frisch, Jackie Kay, Philip Moreira Tomei arxiv

In this paper, we introduce the concept of synthetic counteradaptation, a process where human and AI systems co-evolve by adapting to each other's strategies and behaviors. Synthetic counteradaptation occurs when AI syst…

Game of Go

A Survey on Learnable Evolutionary Algorithms for Scalable Multiobjective Optimization

2022-06-23 · Songbai Liu, Qiuzhen Lin, Jianqiang Li, Kay Chen Tan

Recent decades have witnessed great advancements in multiobjective evolutionary algorithms (MOEAs) for multiobjective optimization problems (MOPs). However, these progressively improved MOEAs have not necessarily been eq…

Evolutionary AlgorithmsMultiobjective OptimizationSurvey

WFR-MFM: One-Step Inference for Dynamic Unbalanced Optimal Transport

2026-01-28 · Xinyu Wang, Ruoyu Wang, Qiangwei Peng, Peijie Zhou 외 arxiv

Reconstructing dynamical evolution from limited observations is a fundamental challenge in single-cell biology, where dynamic unbalanced optimal transport provides a principled framework for modeling coupled transport an…

Scalably learning quantum many-body Hamiltonians from dynamical data

2022-09-28 · Frederik Wilde, Augustine Kshetrimayum, Ingo Roth, Dominik Hangleiter 외

The physics of a closed quantum mechanical system is governed by its Hamiltonian. However, in most practical situations, this Hamiltonian is not precisely known, and ultimately all there is are data obtained from measure…

Tensor Networks