This work develops a split conformal framework to guarantee that a calibrated pointwise band around the neural operator output contains the true solution on at least a $1-\gamma$ fraction of the evaluation domain, with probability at least $1-\alpha$ over test and calibration inputs.
Abstract
Neural operators provide fast surrogate models for approximating operators between function spaces, but their predictions often lack uncertainty quantification. We develop a split conformal framework to guarantee that a calibrated pointwise band around the neural operator output contains the true solution on at least a $1-\gamma$ fraction of the evaluation domain, with probability at least $1-\alpha$ over test and calibration inputs, where $\alpha,\gamma\in(0,1)$. Our method reduces a normalized residual field to its spatial $(1-\gamma)$-quantile and computes a scaling factor using a held-out calibration dataset. We prove marginal coverage guarantees for measurable residual fields defined on arbitrary probability spaces, covering both continuum domains and fixed discretizations. Under mild assumptions on the data distribution, we show that the coverage conditional on the calibration set follows a Beta distribution, which we verify with numerical experiments on Darcy flow and Navier--Stokes equations, where our calibration yields bands consistently tighter than existing corrections while retaining the target coverage.
A unified probabilistic perspective on CP and DRO is developed by viewing both as ways to turn finite calibration data into a data-dependent quantile estimator that a test score falls below with high probability.
Kehan Long, Yi-Qi Zhao, Pol Mestres et al.· 0 citations
Conformal-DRO is proposed, which uses nested conformal regions to construct an ambiguity set for the future latent law, which covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism.
Conformal prediction guarantees marginal coverage, but a single calibration threshold can still spread that coverage unevenly, over-covering easy regions and under-covering hard ones. SimplexUQ is, to our knowledge, the first benchmark and reproducible protocol for measuring this allocation problem on simplex-valued pr...
This paper reformulates SN parameter estimation as a convex optimization problem over a positive semidefinite matrix, replacing the original nonconvex likelihood search with a formulation amenable to standard optimization tools, and clarify the expressive power of the SN class by connecting polynomial log-density model...
Arindam Roychowdhury, Luis G. Crespo, H. Lam· 0 citations
This work introduces the class $\mathcal{P}_\psi(\mu)$ of measures that differ from a reference measure only through a finite-dimensional map $\psi$ while preserving the reference conditionals on its fibers, and develops approximation theory for fitting within it.
R. Baptista, Bamdad Hosseini, Alexander Hsu· 0 citations
A post hoc conformal prediction framework is developed that wraps any trained graph neural network (GNN) surrogate to produce prediction sets with coverage near-nominal levels, and componentwise adaptive (CW-Adaptive) method emerges as the robust universal choice.
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
With $2.1 million funding from Google.org, the open-source Public Transit Intelligence Hub will unify public transit monitoring, operations, and passenger communication.