TF-Coder: Program Synthesis for Tensor Manipulations (TOPLAS)
Thu 16 Jun 2022 04:10 - 04:30 at Kon-Tiki - Synthesis II
The success and popularity of deep learning is on the rise, partially due to powerful deep learning frameworks such as TensorFlow and PyTorch that make it easier to develop deep learning models. However, these libraries also come with steep learning curves, since programming in these frameworks is quite different from traditional imperative programming with explicit loops and conditionals. In this work, we present a tool called TF-Coder for programming by example in TensorFlow. TF-Coder uses a bottom-up weighted enumerative search, with value-based pruning of equivalent expressions and flexible type- and value-based filtering to ensure that expressions adhere to various requirements imposed by the TensorFlow library. We train models to predict TensorFlow operations from features of the input and output tensors and natural language descriptions of tasks, to prioritize relevant operations during search. TF-Coder solves 63 of 70 real-world tasks within 5 minutes, sometimes finding simpler solutions in less time compared to experienced human programmers.
Wed 15 JunDisplayed time zone: Pacific Time (US & Canada) change
15:30 - 16:55 | |||
15:30 20mTalk | Can Reactive Synthesis and Syntax-Guided Synthesis Be Friends? PLDI Wonhyuk Choi Meta; Columbia University, Bernd Finkbeiner CISPA Helmholtz Center for Information Security, Ruzica Piskac Yale University, Mark Santolucito Barnard College, Columbia University, USA DOI Pre-print | ||
15:50 20mTalk | Recursion Synthesis with Unrealizability Witnesses PLDI Azadeh Farzan University of Toronto, Danya Lette University of Toronto, Victor Nicolet University of Toronto DOI | ||
16:10 20mTalk | TF-Coder: Program Synthesis for Tensor Manipulations (TOPLAS) PLDI Link to publication DOI Authorizer link Pre-print | ||
16:30 20mTalk | “Synthesizing Input Grammars”: A Replication Study PLDI Bachir Bendrissou CISPA Helmholtz Center for Information Security, Rahul Gopinath University of Sydney, Andreas Zeller CISPA Helmholtz Center for Information Security DOI Pre-print | ||
16:50 5mTalk | Response by authors of "Synthesizing Input Grammars" PLDI Osbert Bastani University of Pennsylvania |
Thu 16 JunDisplayed time zone: Pacific Time (US & Canada) change
03:30 - 04:55 | |||
03:30 20mTalk | Can Reactive Synthesis and Syntax-Guided Synthesis Be Friends? PLDI Wonhyuk Choi Meta; Columbia University, Bernd Finkbeiner CISPA Helmholtz Center for Information Security, Ruzica Piskac Yale University, Mark Santolucito Barnard College, Columbia University, USA DOI Pre-print | ||
03:50 20mTalk | Recursion Synthesis with Unrealizability Witnesses PLDI Azadeh Farzan University of Toronto, Danya Lette University of Toronto, Victor Nicolet University of Toronto DOI | ||
04:10 20mTalk | TF-Coder: Program Synthesis for Tensor Manipulations (TOPLAS) PLDI Link to publication DOI Authorizer link Pre-print | ||
04:30 20mTalk | “Synthesizing Input Grammars”: A Replication Study PLDI Bachir Bendrissou CISPA Helmholtz Center for Information Security, Rahul Gopinath University of Sydney, Andreas Zeller CISPA Helmholtz Center for Information Security DOI Pre-print | ||
04:50 5mTalk | Response by authors of "Synthesizing Input Grammars" PLDI Osbert Bastani University of Pennsylvania |