Differentiable Inductive Logic Programming in High-Dimensional Space
원문 초록
Synthesizing large logic programs through symbolic Inductive Logic Programming (ILP) typically requires intermediate definitions. However, cluttering the hypothesis space with intensional predicates typically degrades performance. In contrast, gradient descent provides an efficient way to find solutions within such high-dimensional spaces. Neuro-symbolic ILP approaches have not fully exploited this so far. We propose extending the {\delta}ILP approach to inductive synthesis with large-scale predicate invention, thus allowing us to exploit the efficacy of high-dimensional gradient descent. We show that large-scale predicate invention benefits differentiable inductive synthesis through gradient descent and allows one to learn solutions for tasks beyond the capabilities of existing neuro-symbolic ILP systems. Furthermore, we achieve these results without specifying the precise structure of the solution within the language bias.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Inductive Learning of Robot Task Knowledge from Raw Data and Online Expert Feedback
Learning Rules Explaining Interactive Theorem Proving Tactic Prediction
Learning Robust Reward Machines from Noisy Labels
Relational decomposition for program synthesis
AutoCoder: Enhancing Code Large Language Model with \textsc{AIEV-Instruct}
Learning big logical rules by joining small rules
토론
이 논문과 연결된 포럼 글이 아직 없습니다.