mlsanityData to 14 Oct 2026

Improving Kernel-Based Nonasymptotic Simultaneous Confidence Bands

arXiv 2401.15791 ↗First posted 28 Jan 2024stat.ML cs.LG math.STcited by 4

Not on the map. Why?

Abstract (arXiv)

The paper studies the problem of constructing nonparametric simultaneous confidence bands with nonasymptotic and distribition-free guarantees. The target function is assumed to be band-limited and the approach is based on the theory of Paley-Wiener reproducing kernel Hilbert spaces. The starting point of the paper is a recently developed algorithm to which we propose three types of improvements. First, we relax the assumptions on the noises by replacing the symmetricity assumption with a weaker distributional invariance principle. Then, we propose a more efficient way to estimate the norm of the target function, and finally we enhance the construction of the confidence bands by tightening the constraints of the underlying convex optimization problems. The refinements are also illustrated through numerical experiments.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 5 of its 17 references that are in the map. First posted on arXiv 28 Jan 2024.

Builds on

5 of 17 references.

References · 5

  1. 2021Convex optimizationcited by 2,515
  2. 2018Sign-Perturbed Sums: A New System Identification Approach for Constructing Exact Non-Asymptotic Confidence Regions in Linear Regression Modelscited by 14
  3. 2018Distribution-Free Uncertainty Quantification for Kernel Methods by Gradient Perturbationscited by 9
  4. 2022Nonparametric, Nonasymptotic Confidence Bands with Paley-Wiener Kernels for Band-Limited Functionscited by 8
  5. 2014Perturbed Datasets Methods for Hypothesis Testing and Structure of Corresponding Confidence Setscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 1.

4 papers.