Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.19400 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915465880666112 |
|---|---|
| author | Sabug Jr., Lorenzo Ruiz, Fredy Fagiano, Lorenzo |
| author_facet | Sabug Jr., Lorenzo Ruiz, Fredy Fagiano, Lorenzo |
| contents | 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 (SAGE), which features both sample efficiency and robustness to noise. The performance of SAGE are demonstrated by comparing it with commonly-used and latest gradient estimators from literature and practice, in the context of numerical optimization with a first-order method. The results of an extensive statistical test show that SAGE performs competitively when faced with noiseless data, and emerges as the best method when faced with high noise bounds where other gradient estimators result in large errors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_19400 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | SAGE: A Set-based Adaptive Gradient Estimator Sabug Jr., Lorenzo Ruiz, Fredy Fagiano, Lorenzo Optimization and Control 03E75, 90C56 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 (SAGE), which features both sample efficiency and robustness to noise. The performance of SAGE are demonstrated by comparing it with commonly-used and latest gradient estimators from literature and practice, in the context of numerical optimization with a first-order method. The results of an extensive statistical test show that SAGE performs competitively when faced with noiseless data, and emerges as the best method when faced with high noise bounds where other gradient estimators result in large errors. |
| title | SAGE: A Set-based Adaptive Gradient Estimator |
| topic | Optimization and Control 03E75, 90C56 |
| url | https://arxiv.org/abs/2508.19400 |