TL;DR
This paper presents a tight, non-asymptotic uncertainty bound for kernel regression that accounts for correlated noise, improving the assessment of estimation accuracy in safety-critical applications.
Contribution
It introduces a novel, computationally efficient uncertainty bound for kernel-based estimation under correlated noise, extending existing methods with a mild norm-boundedness assumption.
Findings
The bound is tight and non-asymptotic.
It effectively handles correlated noise sequences.
The approach outperforms existing bounds in accuracy and computational simplicity.
Abstract
Non-conservative uncertainty bounds are key for both assessing an estimation algorithm's accuracy and in view of downstream tasks, such as its deployment in safety-critical contexts. In this paper, we derive a tight, non-asymptotic uncertainty bound for kernel-based estimation, which can also handle correlated noise sequences. Its computation relies on a mild norm-boundedness assumption on the unknown function and the noise, returning the worst-case function realization within the hypothesis class at an arbitrary query input location. The value of this function is shown to be given in terms of the posterior mean and covariance of a Gaussian process for an optimal choice of the measurement noise covariance. By rigorously analyzing the proposed approach and comparing it with other results in the literature, we show its effectiveness in returning tight and easy-to-compute bounds for…
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.
Videos
