原帖引用 · 原文
New UC Santa Barbara paper shows that LLM math discovery can skip test-time training, since an evolving memory scored better and used far less compute.
i.e. evolving memory beats test-time training on math discovery, with far less compute.
Test-time training lets a model improve during a search by running RL on its own scored attempts. Those weight updates are slow and costly, so the method is hard to scale to bigger models.
They built TTME, which keeps the weights fixed and stores lessons in memory. The memory holds practical coding rules from earlier tries and the ideas behind score gains, which guide later attempts.
Across 5 math tasks, 2 frameworks, and 3 models, TTME beat the reported test-time training scores every time. With Qwen3-8B on 3 tasks, it used 82.8% to 84.6% fewer FLOPs and 47.7% to 58.4% less runtime than test-time training.
If your LLM search loop has an automatic checker, try a memory of lessons before paying for weight updates mid-search.