SOTAVerified

Knowledge Refactoring for Inductive Program Synthesis

2020-04-21Code Available0· sign in to hype

Sebastijan Dumancic, Tias Guns, Andrew Cropper

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Humans constantly restructure knowledge to use it more efficiently. Our goal is to give a machine learning system similar abilities so that it can learn more efficiently. We introduce the knowledge refactoring problem, where the goal is to restructure a learner's knowledge base to reduce its size and to minimise redundancy in it. We focus on inductive logic programming, where the knowledge base is a logic program. We introduce Knorf, a system which solves the refactoring problem using constraint optimisation. We evaluate our approach on two program induction domains: real-world string transformations and building Lego structures. Our experiments show that learning from refactored knowledge can improve predictive accuracies fourfold and reduce learning times by half.

Tasks

Reproductions