SOURCE-LINKED INTELLIGENCE

Optimal Recovery Meets Bayesian Learning: Where Worst-Case Bounds Pay Off

arXiv · AI, language, vision and robotics · article · Aug 29, 2026 · UTC

Worst-case Optimal Recovery (OR) and Bayesian learning describe the same Gaussian-quadratic-Hilbert problems in two vocabularies. We sharpen the correspondence - the radius of information equals a nugget-optimized GP posterior variance and is attained by the posterior mean at a closed-form balance nugget - and measure, inside three published Bayesian systems, where the worst-case side pays. The ledger is two-sided: the losses instruct as much as the wins. Morozov calibration tracks a test-access oracle within $1.00$-$1.19\times$ where $σ$-blind rules fail, is $4.9$-$6.3\times$ more reproducibl

Read original source ↗ Open in workspace

recordType

paper

region

Global