mlsanityData to 14 Oct 2026

Learning MDL logic programs from noisy data

arXiv 2308.09393 ↗First posted 18 Aug 2023cs.LG cs.LOcited by 15

Not on the map. Why?

Abstract (arXiv)

Many inductive logic programming approaches struggle to learn programs from noisy data. To overcome this limitation, we introduce an approach that learns minimal description length programs from noisy data, including recursive programs. Our experiments on several domains, including drug design, game playing, and program synthesis, show that our approach can outperform existing approaches in terms of predictive accuracies and scale to moderate amounts of noise.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Builds on 15 of its 63 references that are in the map. First posted on arXiv 18 Aug 2023.

Builds on

15 of 63 references.

References · 15

  1. 2017Learning Explanatory Rules from Noisy Datacited by 211
  2. 2020Inductive logic programming at 30: a new introductioncited by 85
  3. 2020Learning programs by learning from failurescited by 73
  4. 2014Clingo = ASP + Control: Preliminary Reportcited by 56
  5. 2021Inductive logic programming at 30cited by 47
  6. 2020Abductive Knowledge Induction From Raw Datacited by 38
  7. 2019Making sense of sensory inputcited by 29
  8. 2019Synthesizing Datalog Programs Using Numerical Relaxationcited by 23
  9. 2018Inductive Learning of Answer Set Programs from Noisy Examplescited by 22
  10. 2019Inductive general game playingcited by 18
  11. 2021Learning Higher-Order Programs without Meta-Interpretive Learningcited by 14
  12. 2022Learning logic programs by combining programscited by 7
3 more
  1. 2021Top Program Construction and Reduction for polynomial time Meta-Interpretive Learningcited by 6
  2. 2019Towards meta-interpretive learning of programming language semanticscited by 5
  3. 2021Learning Logic Programs From Noisy Failurescited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 5; 2025: 9; 2026: 1.

15 papers.

Sort:

By area: