Successful iterated amplification yields an agent approximating the behavior of exponentially many copies of a human overseer.
Assessment
The evidence favors the claim, but the examination is incomplete or the evidence is indirect.
The claim comes from the iterated amplification proposal (Christiano, Shlegeris and Amodei, 2018, "Supervising strong learners by amplifying weak experts"). In that scheme, a human overseer H answers questions by breaking them into subquestions handled by copies of the current model X. X is then trained to imitate this amplified system, and the process repeats. Each round nests one more level of delegation, so the system X approximates at its fixed point corresponds to an exponentially large tree of human-like reasoners. The literature calls this tree HCH ("Humans Consulting HCH").
Read as a conditional, the claim largely follows from the construction. If every distillation step succeeds, so that X faithfully imitates Amplify_H(X) at each round, then the end result approximates the behavior of exponentially many copies of H. The substantive doubt is whether that condition can be met. Imitation errors may compound across rounds. The factored-cognition hypothesis, that hard tasks can be decomposed into short human-sized steps, may fail. And "approximates" may hide drift away from what H would actually endorse. The 2018 paper's experiments covered only five toy algorithmic tasks, with algorithmic rather than human overseers, so they do not show that the condition holds at scale. Later work on factored cognition reported mixed results.
The claim is therefore well grounded as a statement of what success would deliver. It is unestablished as a prediction that amplification can succeed in practice.
Full reasoning: the evidence and decisions behind this verdict
The single recorded instance is from arXiv 1810.08575. It describes X chasing the moving target Amplify_H(X), which is modestly smarter than X at each step. The exponential-copies framing follows from recursive delegation of depth k, giving on the order of b^k nested copies. No credence is given because the claim is part definitional and part a hidden empirical premise: that distillation and decomposition actually work. Those premises, the factored-cognition hypothesis and bounded error accumulation across distillation, are where the dispute lives. They would merit their own nodes in a deeper pass. This pass was budget-limited, so no decomposition was built and no sources beyond the instance were read.
Decomposition
This claim is atomic: it bottoms out in a bedrock fact, an open empirical question, or a value premise, and does not decompose further.
Provenance
Where this claim has been said, linked to its canonical form.
Its one source has been traced to an origin, or to one another.
If all goes well, at the end of this process we’re left with an agent that “approximates” the behavior of an exponentially large team of copies of H.
Section 2.3, dynamics of training
Cite this claim: a formal citation with its evidence attached
Embed this claim: show it on another site with its current assessment
An embed reports the graph's judgment as it stands when the page is viewed: the status with its confidence, how disputed the claim is, and the date. It links back here.
<blockquote class="minerval-claim" data-claim-id="f7f097c9-9ca5-4fa0-9481-02576d2f5a28"><a href="https://minerval.ai/claims/f7f097c9-9ca5-4fa0-9481-02576d2f5a28">Successful iterated amplification yields an agent approximating the behavior of exponentially many copies of a human overseer.</a></blockquote> <script async src="https://minerval.ai/embed.js"></script>
<iframe src="https://minerval.ai/embed/claims/f7f097c9-9ca5-4fa0-9481-02576d2f5a28" title="Minerval: Successful iterated amplification yields an agent approximating the behavior of exponenti…" width="480" height="225" style="border:0;max-width:100%" loading="lazy"></iframe>
[](https://minerval.ai/claims/f7f097c9-9ca5-4fa0-9481-02576d2f5a28)
The badge now:
Contribute
Every judgment on this page is open to challenge. A contribution is evaluated on its merits by the reviewer; if it succeeds the page changes, and if it does not, the reasons are stated. Either way the exchange becomes part of the claim’s public record.
Stated views None yet. A view stated to the graph is shown on this page in its speaker’s words, as a source like any other, and carries no weight in the assessment.
The attention this claim received was paid for by a funded mandate. Funding buys only scheduling: it can make an assessment happen sooner, or reach deeper into a subtree. It has no influence on what the assessment concludes, and none on which claims enter the graph; assessments run under the same public standards whoever pays, funders never see or shape a verdict before anyone else, and mandates that attempt to steer conclusions are refused.
Created by extractor · Nov 11, 2026. Every judgment on this page is accompanied by a reasoning trace.