Structural Enforcement of Statistical Rigor in AI-Driven Discovery: A Functional Architecture
Karen Sargsyan

TL;DR
This paper introduces a formal architecture that enforces statistical rigor in AI-driven research by preventing errors and data leakage, verified through machine-checked proofs and practical experiments.
Contribution
It presents a novel functional architecture with formal guarantees for statistical control in AI research systems, combining type systems, scaffolding, and formal verification.
Findings
The architecture controls FDR at 1.1% in simulations.
Naive approaches inflate FDR to 41%.
First verified chain from real analysis to floating-point implementation.
Abstract
AI-Scientist systems that use large language models to automate research risk generating spurious discoveries through uncontrolled multiple testing. We present a functional architecture that enforces statistical rigor at two levels: a Haskell embedded DSL (the Research monad) that makes it impossible to test a hypothesis without updating the error budget, and a declarative scaffolding technique that structurally prevents data leakage across the boundary into LLM-generated code. We ground these guarantees in a machine-checked Lean 4 formalization of the LORD++ online FDR control theorem (855 lines, zero sorry), which identifies four sufficient conditions for FDR control. Three are structural conditions -- about information flow, data separation, and test validity -- enforced by the architecture's type system and scaffolding. The fourth is an arithmetic condition: a budget invariant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScientific Computing and Data Management · Adversarial Robustness in Machine Learning · Explainable Artificial Intelligence (XAI)
