Searching for Programmatic Policies in Semantic Spaces
<|reference_start|>Searching for Programmatic Policies in Semantic Spaces: Syntax-guided synthesis is commonly used to generate programs encoding policies. In this approach, the set of programs, that can be written in a domain-specific language defines the search space, and an algorithm searches within this space for programs that encode strong policies. In this paper, we propose an alternative method for synthesizing programmatic policies, where we search within an approximation of the language's semantic space. We hypothesized that searching in semantic spaces is more sample-efficient compared to syntax-based spaces. Our rationale is that the search is more efficient if the algorithm evaluates different agent behaviors as it searches through the space, a feature often missing in syntax-based spaces. This is because small changes in the syntax of a program often do not result in different agent behaviors. We define semantic spaces by learning a library of programs that present different agent behaviors. Then, we approximate the semantic space by defining a neighborhood function for local search algorithms, where we replace parts of the current candidate program with programs from the library. We evaluated our hypothesis in a real-time strategy game called MicroRTS. Empirical results support our hypothesis that searching in semantic spaces can be more sample-efficient than searching in syntax-based spaces.<|reference_end|>
@article{moraes2024searching,
    title={Searching for Programmatic Policies in Semantic Spaces},
    author={Rubens O. Moraes and Levi H. S. Lelis},
    journal={arXiv preprint arXiv:2405.05431},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.05431},
    primaryClass={cs.LG cs.AI cs.PL}
}