AIBullisharXiv – CS AI · Jun 237/10
🧠Researchers propose ARTS (Agentic Reasoning for Tree Search), a novel approach using language models to automate scientific discovery by intelligently navigating hypothesis and experiment spaces. The method outperforms existing algorithms by 15.3% and enables smaller models like Qwen3-4B to match frontier AI systems at a fraction of the computational cost.
🧠 Gemini
AIBullisharXiv – CS AI · Jun 57/10
🧠Researchers introduce ReLAT, a test-time training method that improves latent reasoning in large language models by reconstructing the original query from intermediate latent states, ensuring task-relevant information is preserved. The approach demonstrates significant performance gains across mathematical reasoning, QA, and code generation tasks, with Qwen3-8B achieving a 16.6-point improvement on AIME 2024.
AIBearisharXiv – CS AI · Mar 177/10
🧠Researchers discovered that test-time reinforcement learning (TTRL) methods used to improve AI reasoning capabilities are vulnerable to harmful prompt injections that amplify both safety and harmfulness behaviors. The study shows these methods can be exploited through specially designed 'HarmInject' prompts, leading to reasoning degradation while highlighting the need for safer AI training approaches.
AIBullisharXiv – CS AI · Mar 56/10
🧠Researchers introduce TTSR, a new framework that enables AI models to improve their reasoning abilities during test time by having a single model alternate between student and teacher roles. The system allows models to learn from their mistakes by analyzing failed reasoning attempts and generating targeted practice questions for continuous improvement.
AINeutralarXiv – CS AI · Jun 116/10
🧠Researchers formalize test-time training (TTT) as a theoretical framework for sampling from complex probability distributions, proving that the Jerrum-Sinclair random walk approach is query-optimal with a quadratic lower bound. The work bridges generative AI sampling efficiency with classical algorithmic theory, establishing foundational principles for adapting language models during inference.
AINeutralarXiv – CS AI · Jun 86/10
🧠Researchers present EASE-TTT, a novel framework combining within-context retrieval with test-time adaptation to improve long-context question answering in smaller language models. The method identifies evidence chunks and converts them into soft attention supervision targets, allowing models to focus on relevant information while processing the full context, outperforming existing retrieval-only and generic adaptation baselines.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers propose DART, a test-time training method that improves dense retrieval reranking without requiring labeled data. By adapting scoring functions at inference time using pseudo-labels from document rankings, DART achieves 2.1% NDCG improvements across BEIR benchmarks with minimal latency overhead, addressing a key limitation in zero-resource information retrieval systems.
AINeutralarXiv – CS AI · May 296/10
🧠Researchers propose Test-Time Training for Supervised Causal Learning (TTT-SCL), a framework addressing critical limitations in causal discovery by generating test-specific training sets. The approach significantly improves performance gaps between synthetic benchmarks and real-world applications while enhancing robustness to distribution shifts.
AINeutralarXiv – CS AI · Mar 27/1017
🧠Researchers reveal that Test-Time Training (TTT) with KV binding, previously understood as online meta-learning for memorization, can actually be reformulated as a learned linear attention operator. This new perspective explains previously puzzling behaviors and enables architectural simplifications and efficiency improvements.