mlsanityData to 7 Oct 2026

An overview of SPSA: recent development and applications

arXiv 2012.06952 ↗First posted 13 Dec 2020math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

There is an increasing need in solving high-dimensional optimization problems under non-deterministic environment. The simultaneous perturbation stochastic approximation (SPSA) algorithm has recently attracted considerable attention for solving high-dimensional optimization problems where the analytical formula cannot be attained. SPSA is designed to estimate the gradient by applying perturbation on a random subset of dimensions at each iteration. SPSA can be easily implemented and is highly efficient in that that it relies on measurements of the objective function, not on measurements of the gradient of the objective function. Since its invention, SPSA has been implemented in various fields such as reinforcement learning, production optimization etc. The paper briefly discuss the recent development of SPSA and its applications.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 13 Dec 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1.

1 paper.