Turaco: Complexity-Guided Data Sampling for Training Neural Surrogates of Programs
Not on the map. Why?
Abstract (arXiv)
Programmers and researchers are increasingly developing surrogates of programs, models of a subset of the observable behavior of a given program, to solve a variety of software development challenges. Programmers train surrogates from measurements of the behavior of a program on a dataset of input examples. A key challenge of surrogate construction is determining what training data to use to train a surrogate of a given program. We present a methodology for sampling datasets to train neural-network-based surrogates of programs. We first characterize the proportion of data to sample from each region of a program's input space (corresponding to different execution paths of the program) based on the complexity of learning a surrogate of the corresponding execution path. We next provide a program analysis to determine the complexity of different paths in a program. We evaluate these results on a range of real-world programs, demonstrating that complexity-guided sampling results in empirical improvements in accuracy.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 53 references that are in the map. First posted on arXiv 21 Sep 2023.
Builds on
7 of 53 references.
References · 7
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2020Active learning of deep surrogates for PDEs: Application to metasurface designcited by 28
- 2018NEUZZ: Efficient Fuzzing with Neural Program Smoothingcited by 19
- 2020DiffTune: Optimizing CPU Simulator Parameters with Learned Differentiable Surrogatescited by 14
- 2021One Network Fits All? Modular versus Monolithic Task Formulations in Neural Networkscited by 8
- 2013On Sound Compilation of Realscited by 4
- 2021Programming with Neural Surrogates of Programscited by 3
Built on by
Not cited yet.