TL;DR
This paper introduces a method to quantify the worst-case error in emulating a black box function using minimal assumptions, providing bounds on uncertainty based on limited data, with applications to climate modeling.
Contribution
It develops the concept of mini-minimax uncertainty to assess emulator accuracy under minimal regularity assumptions, especially for high-dimensional models.
Findings
Lower bounds on observation requirements for desired accuracy.
Application to Community Atmosphere Model shows significant uncertainty bounds.
Provides confidence bounds for uncertainty quantiles and averages.
Abstract
Consider approximating a "black box" function by an emulator based on noiseless observations of . Let be a point in the domain of . How big might the error be? If could be arbitrarily rough, this error could be arbitrarily large: we need some constraint on besides the data. Suppose is Lipschitz with known constant. We find a lower bound on the number of observations required to ensure that for the best emulator based on the data, . But in general, we will not know whether is Lipschitz, much less know its Lipschitz constant. Assume optimistically that is Lipschitz-continuous with the smallest constant consistent with the data. We find the maximum (over such regular ) of for the best possible emulator ; we call this the "mini-minimax…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
