# Derandomizing Simultaneous Confidence Regions for Band-Limited Functions by Improved Norm Bounds and Majority-Voting Schemes

arXiv: https://arxiv.org/abs/2506.17764 · HTML: https://mlsanity.com/paper/2506.17764/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 7 of its 23 references that are in the map.
- First posted on arXiv 21 Jun 2025.

## Builds on (most cited first, 7 of 7)

- [Convex optimization](https://mlsanity.com/paper/2106.01946/) (2021)
- [Merging uncertainty sets via majority vote](https://mlsanity.com/paper/2401.09379/) (2024)
- [Randomized and Exchangeable Improvements of Markov's, Chebyshev's and Chernoff's Inequalities](https://mlsanity.com/paper/2304.02611/) (2023)
- [Robust Uncertainty Bounds in Reproducing Kernel Hilbert Spaces: A Convex Optimization Approach](https://mlsanity.com/paper/2104.09582/) (2021)
- [Distribution-Free Uncertainty Quantification for Kernel Methods by Gradient Perturbations](https://mlsanity.com/paper/1812.09632/) (2018)
- [Nonparametric, Nonasymptotic Confidence Bands with Paley-Wiener Kernels for Band-Limited Functions](https://mlsanity.com/paper/2206.13629/) (2022)
- [Improving Kernel-Based Nonasymptotic Simultaneous Confidence Bands](https://mlsanity.com/paper/2401.15791/) (2024)

## Built on by (most cited first, 1 of 1)

- [MiNCE: Nonparametric, Strongly Consistent Confidence Envelopes for Band-Limited Functions and their Smoothed Spectra](https://mlsanity.com/paper/2609.09436/) (2026)

## Abstract (arXiv)

Band-limited functions are fundamental objects that are widely used in systems theory and signal processing. In this paper we refine a recent nonparametric, nonasymptotic method for constructing simultaneous confidence regions for band-limited functions from noisy input-output measurements, by working in a Paley-Wiener reproducing kernel Hilbert space. Kernel norm bounds are tightened using a uniformly-randomized Hoeffding's inequality for small samples and an empirical Bernstein bound for larger ones. We derive an approximate threshold, based on the sample size and how informative the inputs are, that governs which bound to deploy. Finally, we apply majority voting to aggregate confidence sets from random subsamples, boosting both stability and region size. We prove that even per-input aggregated intervals retain their simultaneous coverage guarantee. These refinements are also validated through numerical experiments.