Optimal inference for the mean of random functions
By: Omar Kassi, Valentin Patilea
Potential Business Impact:
Finds patterns in messy, scattered data.
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.
Similar Papers
Statistical Limits for Finite-Rank Tensor Estimation
Information Theory
Find hidden patterns in complex data.
Debiased inference in error-in-variable problems with non-Gaussian measurement error
Methodology
Fixes math mistakes in sports data.
A Fourier-based inference method for learning interaction kernels in particle systems
Statistics Theory
Figures out how tiny things push each other.