Mixed Finite Differences Scheme for Gradient Approximation
Marco Boresta, Tommaso Colombo, Alberto De Santis, Stefano Lucidi

TL;DR
This paper introduces a novel gradient approximation method using a filtered derivative approach with Gaussian kernels, providing deterministic error bounds and demonstrating improved performance over traditional stochastic methods in noisy and noise-free scenarios.
Contribution
The paper proposes a new finite differences scheme for gradient approximation that offers deterministic error estimates, differing from traditional stochastic sampling approaches.
Findings
Shows improved accuracy in gradient estimation
Performs well in noisy and noise-free conditions
Provides deterministic error bounds for the approximation
Abstract
In this paper we focus on the linear functionals defining an approximate version of the gradient of a function. These functionals are often used when dealing with optimization problems where the computation of the gradient of the objective function is costly or the objective function values are affected by some noise. These functionals have been considered to estimate the gradient of the objective function by the expected value of the function variations in the space of directions. The expected value is then approximated by a sample average over a proper (random) choice of sample directions in the domain of integration. In this way the approximation error is characterized by statistical properties of the sample average estimate, typically its variance. This work instead is aimed at deriving a new approximation scheme, where linear functionals are no longer considered as expected values…
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.
