Learning the Maximum of a Hölder Function from Inexact Data
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912615342538752 |
|---|---|
| author | Foucart, Simon |
| author_facet | Foucart, Simon |
| contents | Within the theoretical framework of Optimal Recovery, one determines in this article the {\em best} procedures to learn a quantity of interest depending on a Hölder function acquired via inexact point evaluations at fixed datasites. {\em Best} here refers to procedures minimizing worst-case errors. The elementary arguments hint at the possibility of tackling nonlinear quantities of interest, with a particular focus on the function maximum. In a local setting, i.e., for a fixed data vector, the optimal procedure (outputting the so-called Chebyshev center) is precisely described relatively to a general model of inexact evaluations. Relatively to a slightly more restricted model and in a global setting, i.e., uniformly over all data vectors, another optimal procedure is put forward, showing how to correct the natural underestimate that simply returns the data vector maximum. Jitterred data are also briefly discussed as a side product of evaluating the minimal worst-case error optimized over the datasites. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_25209 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Learning the Maximum of a Hölder Function from Inexact Data Foucart, Simon General Mathematics Within the theoretical framework of Optimal Recovery, one determines in this article the {\em best} procedures to learn a quantity of interest depending on a Hölder function acquired via inexact point evaluations at fixed datasites. {\em Best} here refers to procedures minimizing worst-case errors. The elementary arguments hint at the possibility of tackling nonlinear quantities of interest, with a particular focus on the function maximum. In a local setting, i.e., for a fixed data vector, the optimal procedure (outputting the so-called Chebyshev center) is precisely described relatively to a general model of inexact evaluations. Relatively to a slightly more restricted model and in a global setting, i.e., uniformly over all data vectors, another optimal procedure is put forward, showing how to correct the natural underestimate that simply returns the data vector maximum. Jitterred data are also briefly discussed as a side product of evaluating the minimal worst-case error optimized over the datasites. |
| title | Learning the Maximum of a Hölder Function from Inexact Data |
| topic | General Mathematics |
| url | https://arxiv.org/abs/2509.25209 |