Formal analysis for practical gain sequence selection in recursive stochastic approximation algorithms
Qi Wang
Abstract
Qi Wang
Abstract
For many popular stochastic approximation algorithms, such as simultaneous perturbation stochastic approximation method and stochastic gradient method, the practical gain sequence selections are different from the optimal selection, which is theoretically derived from asymptotically performance. We provide formal justification for the reasons why we choose such gain sequence in practice.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For many popular stochastic approximation algorithms, such as simultaneous perturbation stochastic approximation method and stochastic gradient method, the practical gain sequence selections are different from the optimal selection, which is theoretically derived from asymptotically performance. We provide formal justification for the reasons why we choose such gain sequence in practice.
Key concepts: Stochastic approximation, Sequence (biology), Selection (genetic algorithm), Approximation algorithm, Computer science, Algorithm, Mathematical optimization, Stochastic process