Dimension-free estimators of gradients of functions with(out) non-independent variables
Matieyendou Lamboni
TL;DR
This work addresses gradient computation when inputs are non-independent by introducing a unified stochastic framework that uses $\ell_p$-spherical distributions to form gradient surrogates. It defines dependent gradients via a tensor metric $G$ so that $grad(f)(\mathbf{x}) = G^{-1}(\mathbf{x}) \nabla f(\mathbf{x})$, and constructs $L$-point surrogates with estimators based on random vectors from $\mathcal{S}_{d,p}$. The authors prove dimension-free bias under appropriate smoothness and provide MSE rates that adapt to the regime of $p$ relative to $d$, achieving parametric or dimension-free rates with suitable choices of $p$ and bandwidth $h$. Numerical experiments on Rosenbrock and synthetic functions demonstrate competitive performance against finite-difference and Monte Carlo baselines, particularly when Gram-Schmidt decorrelation is employed. The results suggest scalable, dimension-aware gradient estimation for dependent inputs, with practical implications for zeroth-order optimization and derivative-free methods in high dimensions.
Abstract
This study proposes a unified stochastic framework for approximating and computing the gradient of every smooth function evaluated at non-independent variables, using $\ell_p$-spherical distributions on $\R^d$ with $d, p\geq 1$. The upper-bounds of the bias of the gradient surrogates do not suffer from the curse of dimensionality for any $p\geq 1$. Also, the mean squared errors (MSEs) of the gradient estimators are bounded by $K_0 N^{-1} d$ for any $p \in [1, 2]$, and by $K_1 N^{-1} d^{2/p}$ when $2 \leq p \ll d$ with $N$ the sample size and $K_0, K_1$ some constants. Taking $\max\left\{2, \log(d) \right\} < p \ll d$ allows for achieving dimension-free upper-bounds of MSEs. In the case where $d\ll p< +\infty$, the upper-bound $K_2 N^{-1} d^{2-2/p}/ (d+2)^2$ is reached with $K_2$ a constant. Such results lead to dimension-free MSEs of the proposed estimators, which boil down to estimators of the traditional gradient when the variables are independent. Numerical comparisons show the efficiency of the proposed approach.
