cd /news/artificial-intelligence/what-fits-into-few-tokens-doesn-t-ov… · home topics artificial-intelligence article
[ARTICLE · art-132521] src=arxiv.org ↗ pub= topic=artificial-intelligence verified=true sentiment=· neutral

What Fits (Into Few Tokens) Doesn't Overfit

A June 9, 2026 arXiv paper finds that LLM-driven ML research agents reproduce and discover high-performance models even when constrained to extremely short prompts or one-bit feedback, across 8 datasets spanning tabular classification, vision, language modeling, diffusion modeling, and reward modeling. The authors attribute the lack of overfitting in benchmark-driven ML to a description-length effect: successful strategies occupy a low-complexity region of strategy space. When validation-set overfitting was deliberately induced, the results failed to reproduce with short prompts, supporting the hypothesis.

read2 min views2 publishedSep 17, 2026
What Fits (Into Few Tokens) Doesn't Overfit
Image: source
  [Submitted on 9 Jun 2026]


[View PDF](https://arxiv.org/pdf/2606.11045)

[HTML (experimental)](https://arxiv.org/html/2606.11045v1)

Abstract:Reusing a held-out benchmark adaptively should, in principle, invite overfitting. Yet benchmark-driven machine learning (ML) has produced surprisingly little overfitting in practice. An attractive hypothesis is that successful ML strategies are highly compressible. We study this in the setting of LLM-driven research agents, where the hypothesis becomes directly testable via two complementary information bottlenecks. In \emph{output compression}, an exploration agent adaptively searches for high-performance models using a validation set, and we test whether a fresh ``reproducer agent'' can reproduce its performance given only an extremely short prompt and the training data. In \emph{input compression}, the explorer receives only one-bit feedback indicating whether each submitted model improves on the running best. Across 8 datasets spanning tabular classification, vision, language modeling, diffusion modeling, and reward modeling, we find that these bottlenecks have little effect on performance: short prompts and compressible feedback are sufficient to reproduce and find high-performance models. The hypothesis is falsifiable: when we deliberately induce validation-set overfitting, the results fail to reproduce with short prompts. Taken together, our results support a description-length explanation for the lack of overfitting in benchmark-driven ML: successful strategies occupy a low-complexity region of strategy space.

References & Citations

...

Bibliographic Explorer

(What is the Explorer?) Connected Papers

(What is Connected Papers?) Litmaps

(What is Litmaps?) scite Smart Citations

(What are Smart Citations?) alphaXiv

(What is alphaXiv?) CatalyzeX Code Finder for Papers

(What is CatalyzeX?) DagsHub

(What is DagsHub?) Gotit.pub

(What is GotitPub?) Hugging Face

(What is Huggingface?) ScienceCast

(What is ScienceCast?) Influence Flower

(What are Influence Flowers?) CORE Recommender

(What is CORE?) arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

── more in #artificial-intelligence 4 stories · sorted by recency
── more on @arxiv 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
Live at https://your-agent.zahid.host
Get free account → Pricing
from €0/mo · no card required
LIVE [news/what-fits-into-few-t…] indexed:0 read:2min 2026-09-17 ·