Learning Higher-Order Programs without Meta-Interpretive Learning
Learning complex programs through inductive logic programming (ILP) remains a formidable challenge. Existing higher-order enabled ILP systems show improved accuracy and learning performance, though remain hampered by the limitations of the underlying learning mechanism. Experimental results show that our extension of the versatile Learning From Failures paradigm by higher-order definitions significantly improves learning performance without the burdensome human guidance required by existing systems. Our theoretical framework captures a class of higher-order definitions preserving soundness of existing subsumption-based pruning methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Inductive logic programmingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Learning higher-order logic programs
A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher…
Inductive logic programmingRefinement Type Directed Search for Meta-Interpretive-Learning of Higher-Order Logic Programs
The program synthesis problem within the Inductive Logic Programming (ILP) community has typically been seen as untyped. We consider the benefits of user provided types on background knowledge. Building on the Meta-Inter…
Inductive logic programmingProgram SynthesisMeta-Interpretive Learning as Metarule Specialisation
In Meta-Interpretive Learning (MIL) the metarules, second-order datalog clauses acting as inductive bias, are manually defined by the user. In this work we show that second-order metarules for MIL can be learned by MIL. …
Inductive BiasAbductive Knowledge Induction From Raw Data
For many reasoning-heavy tasks involving raw inputs, it is challenging to design an appropriate end-to-end learning pipeline. Neuro-Symbolic Learning, divide the process into sub-symbolic perception and symbolic reasonin…
Higher-Order Generalization Bounds: Learning Deep Probabilistic Programs via PAC-Bayes Objectives
Deep Probabilistic Programming (DPP) allows powerful models based on recursive computation to be learned using efficient deep-learning optimization techniques. Additionally, DPP offers a unified perspective, where infere…
Generalization BoundsMeta-LearningProbabilistic Programming