Markovian Foundations for Quasi-Stochastic Approximation with Applications to Extremum Seeking Control

This paper concerns quasi-stochastic approximation (QSA) to solve root finding problems commonly found in applications to optimization and reinforcement learning. The general constant gain algorithm may be expressed as the time-inhomogeneous ODE fracddtThetat=α ft (Thetat), with state process Theta evolving on ℝd. Theory is based on an almost periodic vector field, so that in particular the time average of ft(θ) defines the time-homogeneous mean vector field barf colon ℝd → ℝd with barf(θ^*)=0. Under smoothness assumptions on the functions involved, the following exact representation is obtained: [fracddtThetat=α[barf(Thetat)-αbarUpsilont+α2Wt0+αfracddtWt1+fracd2dt2Wt2]] along with formulae for the smooth signals bar Upsilont , Wti : i=0, 1, 2. This new representation, combined with new conditions for ultimate boundedness, has many applications for furthering the theory of QSA and its applications, including the following implications that are developed in this paper: (i) A proof that the estimation error |Thetat-θ^*| is of order O(α), but can be reduced to O(α2) using a second order linear filter. (ii) In application to extremum seeking control, it is found that the results do not apply because the standard algorithms are not Lipschitz continuous. A new approach is presented to ensure that the required Lipschitz bounds hold, and from this we obtain stability, transient bounds, and asymptotic bias of order O(α2), and asymptotic variance of order O(α4). (iii) It is in general possible to obtain better than O(α) bounds on error in traditional stochastic approximation when there is Markovian noise.