Abstract
This work treats various random directions Kiefer-Wolfowitz type algorithms in stochastic approximation. The key point is the scaling of the random direction vectors. Under mild conditions, methods that choose the random direction vectors to be symmetric (with respect to the axes) with 0 mean and squared Euclidean length r (where r is the dimension of the underlying optimization problem) behave more or less the same, no matter how the actual direction vectors are selected. There can be advantages to using random directions if the dimension is high and bias is reasonable. But caution is needed if the number of iterations is not high.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
