Optimal kernel regression bounds under energy-bounded noise

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Lahr, Amon, Köhler, Johannes, Scampicchio, Anna, Zeilinger, Melanie N.
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918289536450560
author Lahr, Amon
Köhler, Johannes
Scampicchio, Anna
Zeilinger, Melanie N.
author_facet Lahr, Amon
Köhler, Johannes
Scampicchio, Anna
Zeilinger, Melanie N.
contents 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 kernel-based estimates.
format Preprint
id arxiv_https___arxiv_org_abs_2505_22235
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Optimal kernel regression bounds under energy-bounded noise
Lahr, Amon
Köhler, Johannes
Scampicchio, Anna
Zeilinger, Melanie N.
Machine Learning
68T37 (Primary) 46E22, 60G15 (Secondary)
G.3
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 kernel-based estimates.
title Optimal kernel regression bounds under energy-bounded noise
topic Machine Learning
68T37 (Primary) 46E22, 60G15 (Secondary)
G.3
url https://arxiv.org/abs/2505.22235