Meta-interpretive learning as metarule specialisation

Author:

Patsantzis S.ORCID,Muggleton S. H.

Abstract

AbstractIn 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. We define a generality ordering of metarules by $$\theta$$ θ -subsumption and show that user-defined sort metarules are derivable by specialisation of the most-general matrix metarules in a language class; and that these matrix metarules are in turn derivable by specialisation of third-order punch metarules with variables quantified over the set of atoms and for which only an upper bound on their number of literals need be user-defined. We show that the cardinality of a metarule language is polynomial in the number of literals in punch metarules. We re-frame MIL as metarule specialisation by resolution. We modify the MIL metarule specialisation operator to return new metarules rather than first-order clauses and prove the correctness of the new operator. We implement the new operator as TOIL, a sub-system of the MIL system Louise. Our experiments show that as user-defined sort metarules are progressively replaced by sort metarules learned by TOIL, Louise’s predictive accuracy and training times are maintained. We conclude that automatically derived metarules can replace user-defined metarules.

Funder

UK ESPRC

UK ESPRC Human Like Computing Network

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Software

Reference32 articles.

1. Ceri, S., Gottlob, G., & Tanca, L. (1989). What you always wanted to know about datalog (and never dared to ask). IEEE Transactions on Knowledge and Data Engineering, 1(1), 146–166.

2. Colmerauer, A. (1978). Metamorphosis grammars (pp. 133–188). Berlin: Springer. https://doi.org/10.1007/BFb0031371.

3. Cormen., T, Leiserson., C, Rivest., R, & Stein., C. (2001). Introduction to algorithms, second edition.

4. Cropper, A., & Morel, R. (2021). Learning programs by learning from failures. Machine Learning. https://doi.org/10.1007/s10994-020-05934-z

5. Cropper., A, & Muggleton., S. (2016a). Learning higher-order logic programs through abstraction and invention. In Proceedings of the 25th international joint conference artificial intelligence (IJCAI 2016), IJCAI (pp. 1418–1424). http://www.doc.ic.ac.uk/~shm/Papers/metafunc.pdf

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Towards One-Shot Learning for Text Classification using Inductive Logic Programming;Electronic Proceedings in Theoretical Computer Science;2023-09-12

2. Hypothesizing an algorithm from one example: the role of specificity;Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences;2023-06-05

3. Correction to: Meta-interpretive learning as metarule specialisation;Machine Learning;2022-05-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3