SAGE: A Set-based Adaptive Gradient Estimator
Lorenzo Sabug Jr., Fredy Ruiz, Lorenzo Fagiano

TL;DR
SAGE introduces a set-based adaptive approach for gradient estimation that improves accuracy and robustness in noisy environments, outperforming existing methods in numerical optimization tasks.
Contribution
The paper presents a novel set-based framework for gradient estimation, including an adaptive sampling method and an algorithm that enhances accuracy and noise robustness.
Findings
SAGE outperforms existing gradient estimators under high noise conditions.
Theoretical analysis provides bounds on gradient estimate accuracy.
SAGE achieves competitive performance with noiseless data.
Abstract
A new paradigm to estimate the gradient of a black-box scalar function is introduced, considering it as a member of a set of admissible gradients that are computed using existing function samples. Results on gradient estimate accuracy, derived from a multivariate Taylor series analysis, are used to express the set of admissible gradients through linear inequalities. An approach to refine this gradient estimate set to a desired precision is proposed as well, using an adaptive sampling approach. The resulting framework allows one to estimate gradients from data sets affected by noise with finite bounds, to provide the theoretical best attainable gradient estimate accuracy, and the optimal sampling distance from the point of interest to achieve the best refinement of the gradient set estimates. Using these results, a new algorithm is proposed, named Set-based Adaptive Gradient Estimator…
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.
