Improving on Very Large Neighborhood Search techniques in Program Synthesis
R. Hellinga (TU Delft - Technology, Policy and Management)
Sebastijan Dumancic – Mentor (TU Delft - Algorithmics)
M.L. Molenaar – Graduation committee member (TU Delft - Computer Graphics and Visualisation)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Inductive Program Synthesis (IPS) has been implemented by a two-stage search algorithm, Brute, and consequently improved upon with a Large Neighborhood Search (LNS) technique, in an algorithm named Vlute. Unmotivated values and design choices within Vlute caused limitations on the performance of IPS tasks. This research improves upon several of these limitations through experiments. Most significant improvements are found in the robot-planning domain through the implementation of a stochastic accept method and a best improvement neighbor search.