2023•Unpublished venueRequires access

Formal Comparison of Simultaneous Perturbation Stochastic Approximation and Random Direction Stochastic Approximation ∗

Ducheng Peng, Yiwen Chen, James C. Spall

Open publisher page 3 citations

Abstract

Stochastic approximation (SA) algorithms can be used in system optimization problems when only noisy measurements of a system are available. This paper formally compares the performance of two popular SA algorithms in a multivariate Kiefer-Wolfowitz setting of simultaneous-perturbation SA (SPSA) and the random-directions SA (RDSA). This paper provides sufficient conditions to demonstrate which algorithm has the smaller asymptotic mean squared error (MSE) and numerically presents comparison of SPSA and RDSA in a test function and a model-free control system. The theory and supporting numerics indicate that SPSA has better efficiency (lower MSE) across a broad range of problem settings.

About this research paper

What this paper is about

Stochastic approximation (SA) algorithms can be used in system optimization problems when only noisy measurements of a system are available. This paper formally compares the performance of two popular SA algorithms in a multivariate Kiefer-Wolfowitz setting of simultaneous-perturbation SA (SPSA) and the random-directions SA (RDSA). This paper provides sufficient conditions to demonstrate which algorithm has the smaller asymptotic mean squared error (MSE) and numerically presents comparison of SPSA and RDSA in a test function and a model-free control system. The theory and supporting numerics indicate that SPSA has better efficiency (lower MSE) across a broad range of problem settings.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Stochastic approximation (SA) algorithms can be used in system optimization problems when only noisy measurements of a system are available. This paper formally compares the performance of two popular SA algorithms in a multivariate Kiefer-Wolfowitz setting of simultaneous-perturbation SA (SPSA) and the random-directions SA (RDSA). This paper provides sufficient conditions to demonstrate which algorithm has the smaller asymptotic mean squared error (MSE) and numerically presents comparison of SPSA and RDSA in a test function and a model-free control system. The theory and supporting numerics indicate that SPSA has better efficiency (lower MSE) across a broad range of problem settings.

Key concepts: Simultaneous perturbation stochastic approximation, Stochastic approximation, Approximation algorithm, Applied mathematics, Stochastic process, Stochastic optimization, Mathematical optimization, Perturbation (astronomy)

Related papers

Back to paper searchBrowse research topicsOriginal source
Formal Comparison of Simultaneous Perturbation Stochastic Approximation and Random Direction Stochastic Approximation ∗ — Research Paper | ScholarLens