REVIEW 19 cited by
The Surprising Effectiveness of Test-Time Training for Few-Shot Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
Language models (LMs) have shown impressive performance on tasks within their training distribution, but often struggle with structurally novel tasks even when given a small number of in-context task examples. We investigate the effectiveness of test-time training (TTT) -- temporarily updating model parameters during inference using a loss derived from input data -- as a mechanism for improving LMs' reasoning and few-shot learning capabilities. On the Abstraction and Reasoning Corpus (ARC), performing TTT with in-context examples yields up to $6\times$ higher accuracy compared to fine-tuned baselines -- reaching $53.0\%$ on the public validation set with an 8B-parameter LM and $61.9\%$ when ensembled with program-synthesis methods, matching average human performance. On BIG-Bench Hard (BBH), TTT on in-context examples surpasses standard few-shot prompting in the $10$-shot setting by $7.3$ percentage points ($50.5\%$ to $57.8\%$). Our findings highlight the limitations of in-context learning for novel tasks and demonstrate the potential of test-time training to enhance language model adaptability.
Forward citations
Cited by 19 Pith papers
-
Consensus as Privileged Context for Label-Free Self-Distillation
CANON turns a model's majority-vote consensus into dense per-token supervision by distilling a frozen teacher conditioned on a consensus solution, improving label-free LLM reasoning by up to about 12 points and transf...
-
Test-Time Augmentation for LLMs: When Input Diversity Beats Output Diversity at Matched Compute
For mid-tier LLMs, generating paraphrased versions of an input and majority voting over answers converts inference budget into accuracy more efficiently than self-consistency sampling.
-
Self-Guided Test-Time Training for Long-Context LLMs
Model-selected evidence spans for test-time training beat random and full-context TTT on long-context reasoning benchmarks, with up to ~15% relative accuracy gains.
-
No Time Like the Present: Agentic Test-Time Training for LLM Agents
Continuous test-time training that downweights tokens in repeated n-grams improves multi-turn LLM agent success by up to about 5 points by limiting self-reinforcing drift.
-
LeMix: Unified Scheduling for LLM Training and Inference on Multi-GPU Systems
LeMix co-locates LLM serving and retraining on shared GPUs with profiler-driven scheduling, reporting up to 3.53x throughput gains over separated deployments.
-
Context Tuning for In-Context Optimization
Context Tuning initializes a trainable prompt or KV-cache prefix from the few-shot demonstrations and refines it by gradient descent, matching Test-Time Training accuracy on MMLU, BBH, and ARC at up to 2-3x less train...
-
EasyARC: Evaluating Vision Language Models on True Visual Reasoning
EasyARC is a new procedurally generated visual reasoning benchmark where state-of-the-art vision-language models score below 20%, despite tasks designed to be easy.
-
From Generation to Generalization: Emergent Few-Shot Learning in Video Diffusion Models
Frozen CogVideoX1.5, adapted with LoRA on 3 to 30 input-output videos, performs segmentation, pose estimation, and abstract reasoning (ARC-AGI 16.75%) with modest but real generalization.
-
Making Small Language Models Efficient Reasoners: Intervention, Supervision, Reinforcement
A length-penalized reinforcement learning method called TLDR reduces reasoning token use by about 50 percent in small math language models without hurting accuracy, and temperature scaling of the end-of-sequence token...
-
Product of Experts with LLMs: Boosting Performance on ARC Is a Matter of Perspective
An open-source LLM pipeline with augmentation-aware training, probability-thresholded depth-first search, and product-of-experts scoring reaches 71.6% on the public ARC-AGI evaluation set.
-
Test-time regression: a unifying framework for designing sequence models with associative memory
Sequence models that perform associative recall are unified as 'test-time regression' layers, reducing to weighted, kernel, or online least-squares regression depending on three design choices.
-
The broader spectrum of in-context learning
The authors propose a broad definition of in-context learning as any sequence task where context reduces loss, and argue research should study this wider spectrum.
-
Memoir: Should a Model Write to Its Memory While It Thinks?
Writing to fast memory during pondering slows associative-recall learning at a fixed budget, but does not reduce final performance once training is long enough.
-
RTTC: Reward-Guided Collaborative Test-Time Compute
RTTC uses a reward model to route each query to direct inference, retrieval-augmented generation, or test-time training, plus caching to cut redundant work.
-
Channel-Wise MLPs Improve the Generalization of Recurrent Convolutional Networks
Adding a gated channel-wise MLP to a recurrent convolutional network raises median exact-match accuracy on 185 Re-ARC tasks from 78.75% to 92.19% in-distribution and from 2.34% to 14.58% on harder out-of-distribution tasks.
-
Test-Time Learning for Large Language Models
TLM adapts LLMs at test time by minimizing input perplexity on unlabeled data, using high-perplexity sample selection and LoRA updates.
-
SLOT: Sample-specific Language Model Optimization at Test-time
SLOT adapts an LLM to each prompt by optimizing a lightweight final-layer vector to minimize prompt loss, boosting benchmark reasoning accuracy by a few points.
-
Few-Shot Test-Time Optimization Without Retraining for Semiconductor Recipe Generation and Beyond
A two-loop reverse-model method for test-time input optimization is claimed to find semiconductor etching recipes in five iterations, but the supporting evidence is simulation-only and not reproducible.
-
Towards Contamination Resistant Benchmarks
The authors define contamination resistance as a benchmark property and show that most tested LLMs score near zero on Caesar-cipher encoding and decoding when the shift is not 3 and the text is random nonsense.
Discussion (0). Continue with ORCID to comment.