Two Timescale Analysis of the Alopex Algorithm for Optimization
P. SESHADRI SASTRY, M. Magesh, K. P. Unnikrishnan · Neural Computation · 2002
Alopex is a correlation-based gradient-free optimization technique useful in many learning problems. However, there are no analytical results on the asymptotic behavior of this algorithm. This article presents a new version of Alopex that can be analyzed using techniques of two timescale stochastic approximation method. It is shown that the algorithm asymptotically behaves like a gradient-descent method, though it does not need (or estimate) any gradient information. It is also shown, through simulations, that the algorithm is quite effective.