Improving Kernel-Based Nonasymptotic Simultaneous Confidence Bands
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929226451517440 |
|---|---|
| author | Csáji, Balázs Csanád Horváth, Bálint |
| author_facet | Csáji, Balázs Csanád Horváth, Bálint |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_15791 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Improving Kernel-Based Nonasymptotic Simultaneous Confidence Bands Csáji, Balázs Csanád Horváth, Bálint Machine Learning Statistics Theory 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. |
| title | Improving Kernel-Based Nonasymptotic Simultaneous Confidence Bands |
| topic | Machine Learning Statistics Theory |
| url | https://arxiv.org/abs/2401.15791 |