Noisy derivative-free optimization with value suppression

9Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Derivative-free optimization has shown advantage in solving sophisticated problems such as policy search, when the environment is noise-free. Many real-world environments are noisy, where solution evaluations are inaccurate due to the noise. Noisy evaluation can badly injure derivative-free optimization, as it may make a worse solution looks better. Sampling is a straightforward way to reduce noise, while previous studies have shown that delay the noise handling to the comparison time point (i.e., threshold selection) can be helpful for derivative-free optimization. This work further delays the noise handling, and proposes a simple noise handling mechanism, i.e., value suppression. By value suppression, we do nothing about noise until the best-so-far solution has not been improved for a period, and then suppress the value of the best-so-far solution and continue the optimization. On synthetic problems as well as reinforcement learning tasks, experiments verify that value suppression can be significantly more effective than the previous methods.

Cite

CITATION STYLE

APA

Wang, H., Qian, H., & Yu, Y. (2018). Noisy derivative-free optimization with value suppression. In 32nd AAAI Conference on Artificial Intelligence, AAAI 2018 (pp. 1447–1454). AAAI press. https://doi.org/10.1609/aaai.v32i1.11534

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free