Score: 0

Optimal inference for the mean of random functions

Published: April 15, 2025 | arXiv ID: 2504.11025v1

By: Omar Kassi, Valentin Patilea

Potential Business Impact:

Finds patterns in messy, scattered data.

Business Areas:
A/B Testing Data and Analytics

We study estimation and inference for the mean of real-valued random functions defined on a hypercube. The independent random functions are observed on a discrete, random subset of design points, possibly with heteroscedastic noise. We propose a novel optimal-rate estimator based on Fourier series expansions and establish a sharp non-asymptotic error bound in $L^2-$norm. Additionally, we derive a non-asymptotic Gaussian approximation bound for our estimated Fourier coefficients. Pointwise and uniform confidence sets are constructed. Our approach is made adaptive by a plug-in estimator for the H\"older regularity of the mean function, for which we derive non-asymptotic concentration bounds.

Country of Origin
🇫🇷 France

Page Count
33 pages

Category
Mathematics:
Statistics Theory