An AI Scientist is presented for studying generalisation in quadruped robot navigation policies in simulation and an immutable experiment card that pairs each iteration's prediction with its outcome under a fixed schema, so a falsified hypothesis cannot be retconned.
Abstract
Autonomous research loops driven by large language models can run machine-learning experiments at scale but tend to drift toward local refinements of whichever metric they optimise rather than testing the hypotheses that motivate the experiments. We address this structurally and present an AI Scientist for studying generalisation in quadruped robot navigation policies in simulation. Building on the autoresearch paradigm of Karpathy, our loop adds three components: an immutable experiment card that pairs each iteration's prediction with its outcome under a fixed schema, so a falsified hypothesis cannot be retconned; specialised subagents restricted to mechanical roles; and kkanbu, a preference oracle that holds the user's research taste as a typed knowledge graph and is the only component permitted to make subjective judgements. To isolate the oracle we run the identical loop twice across eleven research streams, with and without kkanbu. Neither arm drifts: both falsify roughly three quarters of their own hypotheses, and the best trained policy comes from the oracle-less arm. What the oracle changes is direction, not score: it alone explores test-time adaptation, it authored the winning designs where its arm led, and it carried lessons across streams that the other arm repeatedly re-derived. The scaffold keeps the loop honest; kkanbu decides where it looks.
NIS-Agent is proposed, which applies context isolation at the two decision points most vulnerable to inertia bias: webpage triage and final-answer validation, and trains an 8B model to be intrinsically more resistant to inertia bias.
Xiang-Xin Zhang, Zhanwei Zhang, Zhihang Fu et al.· 1 citation
The Little Scientist is presented, a framework in which a LLM agent stepping through the scientific method can discover both new algorithms and new ensemble strategies that outperform prior solutions, and is demonstrated on two problems that require fundamentally different modes of discovery.
The nature of test-time exploration in RLVR-trained LLMs is investigated by employing controlled maze-solving experiments and extracting a tree structure from mathematical reasoning traces (BODHI-Trees) based on semantic equivalence to delineate between entropy arising from stylistic variations and genuine inferential...
Soumadeep Saha, Krish Sharma, Akshay Chaturvedi et al.· 1 citation
The mechanism is a halt vector: a difference-of-means direction at layer 18 of this model whose steering strength controls how long it thinks, while a replicated value axis does nothing, and what works is reconstructing the whole steered activation with those dimensions pinned to their natural values.
It is argued that a long-horizon agent must run continually without forgetting before it can learn continually, and that continual learning for these agents needs a substrate outliving every context and process.
E. Nijkamp, Anurag Koul, Egor Pakhomov et al.· 0 citations
This work proposes skill habit formation, a model that mines its own execution history for candidate skills, deterministic variants that compete against the incumbent rather than replacing it, and measures what this costs in accuracy.
T. Weber, R. Taneja· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.