Learning Sampling Policy for Faster Derivative Free Optimization
Zhou Zhai, Bin Gu, and Heng Huang

TL;DR
This paper introduces ZO-RL, a reinforcement learning-based approach that learns an adaptive sampling policy to improve the efficiency and convergence speed of zeroth-order optimization methods.
Contribution
It is the first to apply reinforcement learning to learn sampling policies for ZO optimization, enhancing gradient estimation accuracy and convergence speed.
Findings
ZO-RL reduces gradient variance effectively.
It converges faster than existing ZO algorithms.
The learned policy improves optimization performance.
Abstract
Zeroth-order (ZO, also known as derivative-free) methods, which estimate the gradient only by two function evaluations, have attracted much attention recently because of its broad applications in machine learning community. The two function evaluations are normally generated with random perturbations from standard Gaussian distribution. To speed up ZO methods, many methods, such as variance reduced stochastic ZO gradients and learning an adaptive Gaussian distribution, have recently been proposed to reduce the variances of ZO gradients. However, it is still an open problem whether there is a space to further improve the convergence of ZO methods. To explore this problem, in this paper, we propose a new reinforcement learning based ZO algorithm (ZO-RL) with learning the sampling policy for generating the perturbations in ZO optimization instead of using random sampling. To find the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Advanced Bandit Algorithms Research · Reinforcement Learning in Robotics
