Overfitting in Synthesis: Theory and Practice
Overfitting in Synthesis: Theory and Practice
复制标题
综合中的过度拟合:理论与实践
DOI:
10.1007/978-3-030-25540-4_17
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
Sharma, Rahul
中科院分区:
文献类型:
--
作者:
Padhi, Saswat;Millstein, Todd;Nori, Aditya;Sharma, Rahul
In syntax-guided synthesis (SyGuS), a synthesizer’s goal is to automatically generate a program belonging to a grammar of possible implementations that meets a logical specification. We investigate a common limitation across state-of-the-art SyGuS tools that perform counterexample-guided inductive synthesis (CEGIS). We empirically observe that as the expressiveness of the provided grammar increases, the performance of these tools degrades significantly.We claim that this degradation is not only due to a larger search space, but also due tooverfitting. We formally define this phenomenon and proveno-free-lunchtheorems for SyGuS, which reveal a fundamental tradeoff between synthesizer performance and grammar expressiveness.A standard approach to mitigate overfitting in machine learning is to run multiple learners with varying expressiveness in parallel. We demonstrate that this insight can immediately benefit existing SyGuS tools. We also propose a novel single-threaded technique calledhybrid enumerationthat interleaves different grammars and outperforms the winner of the 2018 SyGuS competition (Invtrack), solving more problems and achieving amean speedup.