- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper addresses how autonomous research agents overfit to their own adaptively collected ML experimental histories, diagnosing two core failure modes: incumbent lock-in and self-confounding. To resolve this, it introduces CAUSALHARNESS, a three-layer middleware that treats every agent edit as a formal intervention to maintain a Bayesian posterior over causal DAG structures and Gaussian Process mechanisms -- seeded by an LLM structural prior, updated via interventional BGe scoring and Order MCMC, and returned to the agent as a non-binding Expected Information Gain (EIG) candidate ranking -- backed by a theoretical guarantee showing that prior structural errors only inflate initial exploration costs rather than the reduced-dimensional optimization rate. Across a large-scale blinded evaluation spanning different model architectures and agent LLMs, CAUSALHARNESS consistently accelerates convergence and reduces variance compared to unassisted agents, correlational dashboards, and Bayesian optimization. Ablation studies confirm that all three middleware layers are essential, and full-length pretraining verifies that the discovered configurations maintain their performance lead at scale.
Critical strengths
-
It identifies a fundamental bottleneck in auto-research -- agents overfitting to their own adaptively collected, self-confounded experimental logs -- and resolves it by returning a causal posterior as non-binding advice rather than a rigid algorithmic controller. This is consequential because it corrects the agent's beliefs about multi-parameter edits while preserving the open-ended flexibility of LLM agents to modify code and expand the search space dynamically.
-
Using infrastructure-level blinding and a matched correlational baseline, it cleanly isolates causal attribution -- rather than extra prompt feedback -- as the true driver of its gains across diverse architectures and agent LLMs. This supports acceptance because autonomous research is computationally expensive, and consistently eliminating stalled sessions where the worst causal session beats the median of every baseline, provides a vital improvement in practical reliability.
Critical weaknesses
The empirical evaluation is restricted solely to language-model pretraining using short proxy runs, and the absolute numerical improvements reported in Table 1 are quite small (e.g., a mean AUC of 0.9808 for CAUSALHARNESS versus 0.9827 for VANILLA, and a final best of 0.9756 versus 0.9780). This is consequential to the overall assessment because it makes it difficult to gauge the practical significance and generalizability of the method: it remains unclear whether these narrow metric margins on short pretraining proxies translate into meaningful breakthroughs across broader, more diverse ML research tasks.
Questions for authors
-
The absolute numerical improvements in Tables 1 appear relatively small. Could you contextualize what these numerical improvements translate to in terms of practical compute savings or effective training tokens/steps?
-
How can CAUSALHARNESS be adapted and evaluated beyond short-proxy LM pretraining -- such as on diverse ML engineering or algorithmic discovery benchmarks -- where interventions are less structured than hyperparameter overrides?
Response to Reviewer gr1n
Thank you for the positive assessment. We write CH for CausalHarness.
W, Q1 (practical significance). The gains are small in val_bpb because every run starts from a tuned configuration under the same fixed budget. They show up as reliability and as a lead that survives full-length training. CH's lead over the unassisted agent is 0.0019 in convergence AUC and 0.0024 in final best within the horizon (Table 1). For scale, the instructions in the original autoresearch repository (Karpathy, 2026) treat a 0.001 val_bpb improvement as a change worth keeping.
Q2 (beyond short-proxy pretraining). The harness needs a record of which variables each experiment sets and a scalar outcome. Code-level edits enter the mechanism model as variants, though not the structure layer: once a variant has enough runs, a variant-specific residual GP absorbs its effect (App. F.5). The same interface fits any loop whose edits can be described by the settings they change, such as data-mixture or architecture search (§7). The evaluation protocol transfers unchanged: blinded conditions, independent sessions, convergence AUC with exact tests, and the worst session and share of sessions that reach a target. The natural next test is open-ended engineering and algorithmic-discovery benchmarks, where edits are less structured.