Recognition: unknown
ConRAD: Conformal Risk-Aware Neural Databases
Pith reviewed 2026-05-07 04:20 UTC · model grok-4.3
The pith
ConRAD uses conformal risk control and a new conformal gate operator to enforce declarative recall guarantees in neural graph queries while maximizing precision and skipping unnecessary neural inferences.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
ConRAD strictly satisfies all risk budgets, with empirical recall falling below the target by at most 0.046 across all settings. It reduces neural invocations to zero in near-complete graph regions, and achieves precision that matches or exceeds best-case static baselines that offer no guarantees and require manual threshold search.
Load-bearing premise
The finite-sample, distribution-free validity of the derived thresholds rests on the exchangeability assumption of Conformal Risk Control holding for the calibration and test query instances, which may be strained by dependencies inherent in graph-structured data and multi-hop query topologies.
read the original abstract
Querying incomplete knowledge graphs with neural predictors is powerful but dangerous. Errors compound across multi-hop pipelines with no formal bound on the completeness of results. We introduce ConRAD, the first framework to enforce declarative recall guarantees natively within a neural graph database query engine. Given a user-specified risk budget, ConRAD automatically derives per-operator prediction thresholds that satisfy the recall target with finite-sample, distribution-free statistical validity via Conformal Risk Control, while maximizing end-to-end precision. To scale calibration across multi-operator query topologies, we introduce a quantile-space scalarization that reduces intractable high-dimensional threshold searches to a single parameter. We further design the conformal gate, a novel physical operator that dynamically bypasses neural inference when local graph evidence suffices, eliminating unnecessary model inferences in dense graph regions. Evaluated across three benchmarks and three query topologies, ConRAD strictly satisfies all risk budgets, with empirical recall falling below the target by at most 0.046 across all settings. It reduces neural invocations to zero in near-complete graph regions, and achieves precision that matches or exceeds best-case static baselines that offer no guarantees and require manual threshold search.
Editorial analysis
A structured set of objections, weighed in public.
Axiom & Free-Parameter Ledger
free parameters (1)
- quantile-space scalarization parameter
axioms (1)
- domain assumption Calibration and test instances are exchangeable.
invented entities (1)
-
conformal gate
no independent evidence
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.