Multivariate root-n-consistent smoothing parameter free matching estimators and estimators of inverse density weighted expectations
Hajo Holzmann, Alexander Meister
TL;DR
This work delivers root-$n$-consistent, smoothing-parameter free estimators for inverse-density weighted functionals in multivariate settings by employing $K$-th order Voronoi tessellations with polynomial least-squares fits on each cell. The approach avoids nonparametric density or regression estimation, yet achieves the parametric rate under mild Hölder smoothness on the regression function $G$, with information-theoretic lower bounds showing some smoothness is required when $f_Z$ is unknown. The framework extends to estimating $\Psi$ and $\Phi$, provides applications to Berkson errors, random coefficient models, ATT/ATE, and transfer learning under covariate shift, and is supported by simulations illustrating practical performance. The results offer bias-corrected alternatives to traditional matching estimators and illuminate the fundamental trade-offs between design density, smoothness, and achievable rates in multivariate settings.
Abstract
Expected values weighted by the inverse of a multivariate density or, equivalently, Lebesgue integrals of regression functions with multivariate regressors occur in various areas of applications, including estimating average treatment effects, nonparametric estimators in random coefficient regression models or deconvolution estimators in Berkson errors-in-variables models. The frequently used nearest-neighbor and matching estimators suffer from bias problems in multiple dimensions. By using polynomial least squares fits on each cell of the $K^{\text{th}}$-order Voronoi tessellation for sufficiently large $K$, we develop novel modifications of nearest-neighbor and matching estimators which again converge at the parametric $\sqrt n $-rate under mild smoothness assumptions on the unknown regression function and without any smoothness conditions on the unknown density of the covariates. We stress that in contrast to competing methods for correcting for the bias of matching estimators, our estimators do not involve nonparametric function estimators and in particular do not rely on sample-size dependent smoothing parameters. We complement the upper bounds with appropriate lower bounds derived from information-theoretic arguments, which show that some smoothness of the regression function is indeed required to achieve the parametric rate. Simulations illustrate the practical feasibility of the proposed methods.
