arXiv — cs.AI preprintsInternational21 October 2026
Benefit and Cost of Random-Token Replacement under Repeated Data: A Known-Entropy Decomposition and Evidence from Ten Real Corpora
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2610.27590v1 Announce Type: cross Abstract: When unique pretraining data is scarce, models see the same tokens many times and are thought to memorize. Random-token replacement, an input-corruption augmentation, is one remedy reported to lower validation loss, but a lower loss alone does not reveal which source of error it reduces. On a controlled source whose entropy rate is known in closed form, we show that replacement shrinks predictions toward the corpus average. We also introduce a decomposition that separates validation loss into approximation, estimation, and memorization terms. T
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- Navalia: Advancing Cowork Agents through Verifiable Task Synthesis and Long-Horizon Post-Training21 October 2026
- Large language model and reinforcement learning based autonomous construction and progress updates21 October 2026
- Pareto-Optimal RTL Code Generation via Multi-Objective Reinforcement Learning with Large Language Models21 October 2026
- MedPAO-Assist: Edge-Deployable, Modality-Aware Agentic AI for Radiology Report Structuring21 October 2026
- DataPraxis: Scaling Analytics Tasks via Verified Workspace Evolution21 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.