The Garden, the Multiverse, and What History Cannot Teach
Turning the garden of forking paths into a resource gives us robustness without a verifier, right up to the wall it eventually runs into.

At the heart of data analysis sits a curse that, once you see it clearly, contains its own partial cure; and when you push that cure far enough, it runs into a wall that is a fact about what discovery is rather than an engineering limit. Walking the whole arc is worthwhile because it connects a famous statistical worry to the question of what a machine could ever be trained to do.
The garden of forking paths
The worry is Andrew Gelman's, and its power lies in how it survives every defense you would normally raise. The naive concern about untrustworthy results is that someone went fishing, trying analysis after analysis until something crossed the significance threshold. The forking-paths argument is that even a completely honest analyst, who fixed their hypothesis in advance and ran exactly one analysis, can produce an untrustworthy result.
This happens because the analysis is full of small decisions made after seeing the data: how to filter outliers, which normalization to use, how to group, whether to drop a sample, which model to choose, and where to set a threshold. Each decision is reasonable on its own, yet each is data-dependent: had the data looked different, the analyst would have decided differently. Because of that, the paths not taken still bear on the credibility of the result. Without any conscious cheating required, the analyst walked one route through a garden of thousands of branching paths, believing it was the only sensible route, when in fact a slightly different dataset would have sent them down another branch to a different conclusion. Every untraveled branch is an invisible deduction from how much the single result should be believed.
Turning the curse into a resource
Traditionally, this has been a curse precisely because you cannot walk all the paths when there is only one analyst, one lifetime, and one route. That constraint is the exact one that cheap, capable agents dissolve. When running an analysis is nearly free, you can actually walk most of the paths. Instead of choosing one pipeline and praying it is robust, you can run the field's whole space of reasonable pipelines and observe how a conclusion behaves across them.
This is the industrialized form of the cure: turning the garden of forking paths from an enemy into a resource. Rather than treating a conclusion as a binary that holds or does not, you can give it a robustness profile, a map of how stable it is across the space of tool choices, parameter settings, and data subsets: whether it survives switching the differential-expression method, moving the threshold, or bootstrapping the data. That profile is rich, and, crucially, it requires no verifier. Because you only need to observe the distribution of the conclusion across all reasonable pipelines without knowing which pipeline is correct, the approach works in domains with no cheap ground truth, where compute is abundant and truth is scarce.
Three things robustness can reward, and which two matter
Once you can run the whole space, you can extract a training signal from it, though there are three different things you could reward and they are not the same.
First, you could reward robust conclusions directly, giving a high score to a result that holds across ninety percent of reasonable pipelines. While this trains the model to produce robust conclusions, it also punishes true-but-fragile findings. Some real discoveries are visible only under one specific method, because only that method had the power to see them. Rewarding convergence breeds a conservative parrot that only reports what holds no matter how you look, which is the same as only reporting the bland.
Second, you could reward honest calibration: not "the conclusion is robust," but "the model's stated confidence in its conclusion's robustness was accurate." When the model claims something is robust, you run the multiverse to check, rewarding it if it was right and penalizing it if it overclaimed. This trains the model to know honestly how fragile its own conclusions are. Instead of punishing fragile discoveries, it punishes calling a fragile thing robust, turning the anti-laundering principle into a reward.
Third, you could reward noticing disagreement. When two pipelines diverge, that divergence is information rather than noise, pointing at a methodologically sensitive spot that might be real biological heterogeneity or might be one tool's artifact. A good system notices and explains the divergence rather than silently picking one. That turns disagreement into a source of value, specifically into a guide to which next experiment would resolve it.
The calibration reward and the disagreement reward are the ones worth having because they train honesty and judgment, whereas the convergence reward is a trap that trains a coward. All three are free of any verifier; they need only the multiverse and the compute to run it.
The trap inside the cure
Still, there is a flaw at the heart of all this, the same one the map-territory picture predicts: "All the mainstream tools agree" does not mean "close to the truth."
The field's mainstream tools share enormous amounts of structure, including the same assumptions, the same statistical frame, and sometimes the same underlying bugs. When they agree, it may be because they are wrong in the same way rather than because the conclusion is right. If the entire field's methodology assumes some false premise, then "runs through all the mainstream tools and stays stable" yields a high robustness score for a conclusion that is wholly wrong. This is the map-territory gap in its local form: walk all the maps, and you get the maps' consensus rather than the territory. Multiverse agreement verifies stability within the field's methodological consensus, not truth, and the gap between those two is the exact space in which an entire field can be collectively mistaken.
Because of that, the robustness signal must honestly mark itself as "stable within methodological consensus": agreed, not verified. The only thing that closes the gap is the territory talking back through rare ground-truth anchors, used not as a dense training signal but to calibrate how well consensus-robustness actually tracks truth. Discovering that gap, measuring how often a high-robustness conclusion later proves false, is itself among the most valuable things one could produce, because it quantifies the distance between the consensus of maps and the territory.
What history can and cannot teach
There is a seductive way to manufacture a verifier for free: use past scientific discoveries whose answers history has already revealed. You give a model the situation a scientist faced before the discovery, let it infer, and reward it against the answer that was later confirmed, replacing a slow, expensive verifier with one history has already run. Clever as this is, it has two failure modes of very different severity.
The shallow one is answer leakage. Because the model read every textbook in pretraining, it does not infer the answer, it retrieves it, and the reward then trains "remembering" rather than "inferring." This is partly fixable: you can use very new or unpublished findings the model could not have seen, reward the quality of the reasoning path rather than the answer, or, most interestingly, use historical cases that were later overturned and reward identifying their fragility, the experiment that would break them, rather than reproducing the old conclusion. That last move turns leakage from a bug into a feature: the model knows the later truth, yet it never memorized how to recognize, at the time, that the old consensus would fall, and that recognition cannot be retrieved.
The deep failure mode cannot be fixed, and it is the more important one. Hindsight reshapes the question as well as revealing the answer. Before the discovery, the scientist faced an un-conceptualized mess, not knowing which variables to measure, what to ask, or what was even relevant; the discovery revealed, simultaneously, how to see the problem. When you construct the training environment today, you stand on the far side of the answer, so the data you hand the model, the variables, and the very framing of the task already leak the discovery. The hardest part, realizing what to ask and inventing the new concept the old frame could not hold, has been pre-solved by your environment, leaving the model to fill in only the last step on a stage you already set.
This points to the unfixable wall that everything else in this terrain runs into. You can train inference within an already-correct framing, but you cannot train the creation of a new framing, because training requires ground truth, and the ground truth for a new frame does not exist until the frame has been created. Once the answer is known, the new concept already exists, and the act of discovering it has vanished. Rather than an engineering limit, this is the logical structure of discovery: the irreducible part of a real discovery, realizing the old vocabulary cannot hold what you are seeing, is the exact part no environment with a known answer can ever contain.
The corner that remains
What survives all of this is narrow and, for that reason, valuable. The overturned consensus of the past is a badly underpriced resource, because its reward, was later refuted, is a definite historical fact, while the capability it would train, recognizing, at the time, that it would be refuted, cannot be gotten by retrieving an answer. You cannot train a machine to reproduce science's successes without it cheating, yet you might be able to train it to reproduce science's self-correction; and self-correction, the organized skepticism that is the real source of trustworthy knowledge, is the one thing history offers in enormous, well-labeled supply. The goal worth aiming at may therefore be a machine that doubts well rather than a machine that discovers, and of doubt, done honestly and then vindicated by history, there is no shortage of training data at all.
花园、多重宇宙,以及历史无法教授的事
将分叉路径的花园转化为一种资源,使我们无需验证者就能衡量稳健性,直到它撞上那堵终将遇到的高墙。

数据分析的核心处藏着一个诅咒,一旦看清它,你会发现它本身就包含着一部分解药;而当你把这剂解药推到极致时,它又会撞上一堵墙,这堵墙并非工程上的局限,而是关于"发现究竟是什么"的一个基本事实。这整条脉络很值得从头梳理一遍,因为它把统计学里一个著名的忧虑,同"机器究竟能被训练去做什么"这个问题连在了一起。
分叉路径的花园
这个忧虑出自安德鲁·盖尔曼(Andrew Gelman),它的杀伤力在于能够击穿人们通常用来辩护的每一道防线。面对不可信的研究结果,朴素的担忧是有人在数据里"钓鱼",换着花样试了一遍又一遍分析方法,直到某个结果碰巧跨过显著性阈值。但分叉路径的花园(garden of forking paths)这一论点要犀利得多:哪怕是一位完全诚实的分析者,事先固定了研究假设、只跑了一次分析,同样可能得出不可信的结果。
原因在于,分析过程中充满了在看到数据之后才做出的细小决定:怎样过滤异常值、选用哪种标准化方法、如何分组、要不要剔除某个样本、采用哪个模型、把阈值定在哪里。每一个决定单看都合情合理,但每一个又都取决于手头的数据;假如数据呈现出另一副模样,分析者当初就会做出不同的选择。因此,那些没有选走的岔路,依然左右着结果的可信度。不需要任何蓄意作弊,分析者穿过一座由成千上万条岔路组成的花园,只走了其中一条,并深信那是唯一合理的路线;可实际上,只要数据集略有不同,他们就会拐上另一条岔路,得出另一个结论。每一条未曾踏足的分支,都在无形中扣减着那个单一结果值得采信的程度。
将诅咒转化为资源
在过去,这之所以是个诅咒,恰恰是因为人不可能走遍所有岔路:只有一个分析者、一段有限的人生,自然只能走一条路线。而廉价又能干的智能体(agent)所消解的,正是这一约束。当跑一次分析的成本近乎为零时,你就真的可以把大部分路径都走上一遍。你不再需要选定一条分析流程,然后祈祷它足够稳健,而是可以把该领域所有合理的分析流程统统跑一遍,直接观察某个结论在这些流程中的表现。
这就是解药的工业化形态:把分叉路径的花园从敌人变成资源。一个结论不再只是"成立"或"不成立"的二元判定,而是拥有了一份稳健性剖面(robustness profile),一张描绘它在工具选择、参数设定和数据子集所构成的空间里有多稳定的地图:切换差异表达方法、移动阈值,或者对数据做自助抽样(bootstrap),它还能站得住脚吗?这份剖面信息量充足,而且最关键的是,它不需要验证者(verifier)。你不必知道哪一条流程才是正确的,只需观察结论在所有合理流程上的分布情况。正因如此,这套做法在缺乏廉价真值(ground truth)、算力充裕而真相稀缺的领域里格外管用。
稳健性能够奖励的三件事,以及哪两件真正重要
一旦能把整个流程空间都跑通,你就可以从中提取训练信号;不过可供奖励的目标有三种,效果截然不同。
第一种是直接奖励稳健的结论:只要某个结果在百分之九十的合理流程中都成立,就给高分。这确实能训练模型产出稳健的结论,却也会惩罚那些真实但脆弱的发现。有些真正的发现只有在某一种特定方法下才会显露出来,因为只有那种方法具备捕捉到它们的能力。一味奖励收敛,只会养出一只保守的鹦鹉,永远只汇报那些怎么看都成立、因而也平淡无奇的结论。
第二种是奖励诚实的校准(calibration):奖励的不是"结论本身很稳健",而是"模型对自身结论稳健性的置信度评估很准确"。模型声称某项结论稳健,你就跑一遍多重宇宙分析(multiverse analysis)来核验;说准了就给奖励,夸大其词就给予惩罚。这能训练模型诚实地认清自己结论的脆弱程度。它并不惩罚脆弱的发现,惩罚的是把脆弱的东西吹成稳健的,相当于把反洗白原则做成了一项奖励。
第三种是奖励发现分歧。当两条流程得出不同结果时,这种分歧并非噪声,而是有价值的信息,指向一个方法论上的敏感位置,背后既可能是真实的生物学异质性,也可能是某个工具造成的伪影。一套优秀的系统会敏锐地捕捉并解释这种分歧,而不是闷声挑一个结果了事。这就把分歧转化成了价值来源,具体而言,转化成了一份指南,指明下一步做哪个实验才能真正解开分歧。
在这三者当中,校准奖励和分歧奖励真正值得采用,因为它们训练的是诚实与判断力;而收敛奖励是个陷阱,只会训练出懦夫。同时,这三种奖励全都无需依赖任何验证者,只要有多重宇宙和运行它的算力就够了。
解药内部的陷阱
然而,这一切的核心处仍然留着一个缺陷,正是地图与疆域(map and territory)那幅图景所预示的缺陷:"所有主流工具都同意"并不等于"接近真相"。
一个领域里的主流工具共享着极其庞大的底层结构:相同的假设、相同的统计框架,有时甚至连底层代码的漏洞都如出一辙。它们之所以达成一致,可能不是因为结论正确,而是因为它们以同样的方式犯了错。假如整个领域的方法论都建立在某个错误的前提之上,那么"跑遍所有主流工具都保持稳定",就会给一个彻头彻尾错误的结论打出高额的稳健性分数。这就是地图与疆域之间的鸿沟(map-territory gap)在此处的局部形态:走遍所有地图,你得到的只是地图之间的共识,而不是疆域本身。多重宇宙分析的一致性所验证的,只是领域方法论共识内部的稳定性,而非真理;二者之间的夹缝,恰恰是整个领域可能集体犯错的空间。
因此,稳健性信号必须诚实地把自己标注为"在方法论共识内部稳定":达成了共识,但尚未得到验证。唯一能弥合这道鸿沟的,是疆域亲自开口回应,也就是那些罕见的真值锚点;它们不适合拿来做密集的训练信号,却可以用来校准共识稳健性究竟在多大程度上追踪了真相。去测量这道鸿沟,统计高稳健性的结论后来被证伪的频率,本身就是人们能做出的最有价值的工作之一,因为它量化了地图共识与真实疆域之间的距离。
历史能教的和不能教的
还有一种很诱人的思路,想要免费造出一个验证者:利用过去那些答案已被历史揭晓的科学发现。把一位科学家在做出发现之前所面对的处境交给模型,让它做推断,再用后来被证实的答案作为奖励信号,从而用历史已经跑完的验证取代漫长而昂贵的现实验证。这个办法很巧妙,但包含两种严重程度截然不同的失效模式。
较浅的一层失效是答案泄漏(answer leakage)。模型在预训练阶段读过了所有教科书,它并不是在推断答案,而是在检索答案,结果奖励信号训练出来的只是"记忆"而非"推断"。这个问题在一定程度上可以修补:可以选用模型不可能见过的最新或未发表成果;可以不奖励答案本身,改为奖励推理路径的质量;或者更有意思的是,专门挑那些后来被推翻的历史案例,不奖励模型复现当年的旧结论,而是奖励它识别出旧结论的脆弱之处、找出那个能击碎旧结论的实验。最后这一招把泄漏从缺陷变成了优势:模型固然在预训练里知道了后来的真相,却从未背过当年该如何一眼看出旧共识即将崩塌,而这种识别能力是没法靠检索现成答案混过去的。
更深的一层失效模式则无法修补,也更为关键。后见之明不仅揭晓了答案,还重塑了问题本身。在发现诞生之前,科学家面对的是一团尚未概念化的乱麻,根本不知道该测量哪些变量、该问什么问题、哪些因素才算相关;而发现在给出答案的同时,一并揭示了应当如何看待这个问题。今天当我们动手搭建训练环境时,自己已经站在了答案揭晓之后的那一侧;你喂给模型的数据、挑选的变量,乃至任务的整个提问框架,其实都已经把那项发现泄漏了出去。最艰难的那一步,即意识到该问什么问题、发明出旧框架容纳不下的新概念,早已被你的环境预先解完了;模型不过是在你搭好的戏台上迈出了最后一步。
这就把我们带到了这片领域里其他一切尝试都会撞上的那堵不可修复的墙。你可以在一个已经正确的框架内部训练推理,却无法训练新框架的创造,因为训练离不开真值,而在新框架被创造出来之前,关于它的真值根本无从谈起。等答案水落石出,新概念早已存在,当初发现它的那个瞬间也就烟消云散了。这并非工程上的局限,而是发现本身的逻辑结构:真正发现中最核心、不可化约的那部分,也就是意识到旧词汇装不下眼前所见之物的那一刻,恰恰是任何已知答案的训练环境都永远无法装进去的东西。
留存的那个角落
历经这番筛洗,最终留存下来的空间很窄,却也正因为窄而格外珍贵。过去那些后来被推翻的学术共识,是一座被严重低估的富矿:它的奖励信号(后来被证伪了)是确凿无疑的历史事实,而它所要训练的能力(在当时就敏锐识别出它终将被证伪)又无法靠检索标准答案来投机取巧。你无法在不让机器作弊的前提下训练它复现科学的成功,但你也许能训练它复现科学的自我纠错;而自我纠错,也就是作为可信知识真正源泉的有组织的怀疑(organized skepticism),恰恰是历史能够海量提供、且自带清晰标注的唯一一样东西。因此,真正值得瞄准的目标或许不是一台会做出发现的机器,而是一台善于怀疑的机器;至于那些当年诚实提出、事后又被历史证明无误的怀疑,我们手里根本不缺训练数据。