Adaptive Stochastic Natural Gradient Method for Safe Optimization on Binary Space
Kento Uchida, Ryoki Hamano, Masahiro Nomura, Shinichi Shirakawa

TL;DR
This paper introduces a safe optimization method for binary search spaces, extending the adaptive stochastic natural gradient approach with safety mechanisms to prevent unsafe evaluations in critical applications.
Contribution
It develops safe ASNG, a novel binary safe optimization algorithm that estimates safety boundaries and suppresses unsafe solutions during the search process.
Findings
Safe ASNG effectively suppresses unsafe evaluations in benchmark problems.
Compared to other methods, safe ASNG achieves more efficient optimization.
Experimental results demonstrate the robustness of safe ASNG in safety-critical scenarios.
Abstract
Optimization problems in real-world applications across the medical and engineering domains often involve potential risks when evaluating candidate solutions. Safe optimization aims to perform optimization while suppressing unsafe solution evaluations in such situations. For continuous search spaces, there exist safe optimization methods based on evolutionary computation. However, the algorithm development of safe optimization methods for binary search spaces has not been adequately addressed. In this study, we incorporate additional mechanisms for safe optimization into a binary optimization method, the adaptive stochastic natural gradient method (ASNG) with a family of Bernoulli distributions. For safety functions that must be kept non-negative during optimization, the proposed method, safe ASNG, estimates the Lipschitz constants with respect to the Hamming distance by constructing…
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.
