The paper investigates how synthetic tasks influence language‑model pretraining by distinguishing diagnostic, teachable, and transferable signals. In a controlled setting where 70% of the data is general Python and 30% is a mixture of curated synthetic tasks, literature‑derived probes, and OpenCodeInstruct, 14 of 27 tasks show teachability, with curated tasks outperforming literature probes. Curated synthetic data provides conditional value: it boosts downstream performance when mixed with OpenCodeInstruct but is less effective when used alone, and a loss‑based scheduler can misalign short‑term loss reduction with long‑term transfer.
By Ohad Rubin
arXiv:2610.00873v1 Announce Type: cross
Abstract: In many industrial applications, 1) tabular data is scarce and imbalanced and thus requires synthetic expansion; 2) input distributions drift between...
By Hongyu Cao, Xinyuan Wang, Arun Vignesh Malarkkan, Kunpeng Liu, Haifeng Chen, Yanjie Fu
arXiv:2608.21386v1 Announce Type: cross
Abstract: Given a task described by a few examples, how should a model be specialized to it? Four mechanisms are available -- zero-shot, in-context attention,...
By John C. Howell
arXiv:2609. 22041v1 Announce Type: new Abstract: Reinforcement learning is increasingly used to align image generators with reward signals, and Flow-GRPO recently extended this paradigm to flow-matching models by treating the denoising sampler as a stochastic policy that can be optimized from reward feedback.
By Yufeng Wang, Parivesh Priye, Meeshawn Marathe, Ramit Pahwa
arXiv:2607. 03103v1 Announce Type: cross Abstract: Clinical cardiac imaging pipelines currently deploy separate models for each dataset and modality, incurring redundant training costs and precluding knowledge sharing across anatomically related tasks.
By Jiahao Liu, Hang Wei, Shuai Wu
The paper introduces a transformer-based framework that learns an in‑context score operator for diffusion models, allowing the model to perform reverse‑diffusion sampling on unseen target distributions specified by a small empirical context set. By representing the task‑dependent score as a Gaussian‑kernel conditional mean and approximating it with a transformer‑based query‑dependent attention architecture, the method can adapt to new tasks without retraining or parameter updates. The authors provide theoretical generalization‑error bounds and evaluate the approach on scientific and visual datasets, noting strong performance on simple task families and limitations as task complexity grows.
By Wuzhe Xu, Zhaiming Shen, Yulong Lu, Wenjing Liao, Rongjie Lai