Dimension-free estimators of gradients of functions with(out) non-independent variables
Matieyendou Lamboni

TL;DR
This paper introduces a unified stochastic framework for estimating gradients of smooth functions evaluated at non-independent variables, achieving dimension-free error bounds and improving efficiency over traditional methods.
Contribution
It develops a novel gradient estimation method that works for non-independent variables with dimension-free error bounds, extending traditional independent-variable estimators.
Findings
Bias bounds do not suffer from curse of dimensionality.
MSE bounds are dimension-free for certain p ranges.
Numerical results demonstrate the method's efficiency.
Abstract
This study proposes a unified stochastic framework for approximating and computing the gradient of every smooth function evaluated at non-independent variables, using -spherical distributions on with . The upper-bounds of the bias of the gradient surrogates do not suffer from the curse of dimensionality for any . Also, the mean squared errors (MSEs) of the gradient estimators are bounded by for any , and by when with the sample size and some constants. Taking allows for achieving dimension-free upper-bounds of MSEs. In the case where , the upper-bound is reached with a constant. Such results lead to dimension-free MSEs of the proposed estimators, which boil down to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Markov Chains and Monte Carlo Methods · Statistical Methods and Inference
