Papers › Mini-Minimax Uncertainty Quantification for Emulators
Mini-Minimax Uncertainty Quantification for Emulators
Jeffrey C. Regier, Philip B. Stark
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Consider approximating a "black box" function f by an emulator f̂ based on n noiseless observations of f. Let w be a point in the domain of f. How big might the error |f̂(w) - f(w)| be? If f could be arbitrarily rough, this error could be arbitrarily large: we need some constraint on f besides the data. Suppose f is Lipschitz with known constant. We find a lower bound on the number of observations required to ensure that for the best emulator f̂ based on the n data, |f̂(w) - f(w)| ≤ϵ. But in general, we will not know whether f is Lipschitz, much less know its Lipschitz constant. Assume optimistically that f is Lipschitz-continuous with the smallest constant consistent with the n data. We find the maximum (over such regular f) of |f̂(w) - f(w)| for the best possible emulator f̂; we call this the "mini-minimax uncertainty" at w. In reality, f might not be Lipschitz or---if it is---it might not attain its Lipschitz constant on the data. Hence, the mini-minimax uncertainty at w could be much smaller than |f̂(w) - f(w)|. But if the mini-minimax uncertainty is large, then---even if f satisfies the optimistic regularity assumption---|f̂(w) - f(w)| could be large, no matter how cleverly we choose f̂. For the Community Atmosphere Model, the maximum (over w) of the mini-minimax uncertainty based on a set of 1154~observations of f is no smaller than it would be for a single observation of f at the centroid of the 21-dimensional parameter space. We also find lower confidence bounds for quantiles of the mini-minimax uncertainty and its mean over the domain of f. For the Community Atmosphere Model, these lower confidence bounds are an appreciable fraction of the maximum.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections