← 研踪 PaperTrailarXiv:2409.16238 · v4
Linear-time Rule Mining Under Formal Guarantees
首次提交 2024-09-25 00:54
版本更新 2026-11-16 23:32
雷达观测 2026-11-17 16:10
摘要
Probabilistic logical models are a core component of neurosymbolic AI and are important in their own right for tasks that require high explainability. Unlike neural networks, logical theories that underlie the model are often handcrafted using domain expertise, making their development costly and prone to errors. While there are algorithms that learn logical theories from data, they are generally prohibitively expensive, limiting their applicability in real-world settings. Here, we introduce precision and recall for logical rules and define their composition as rule utility -- a measure of the predictive power of logical theories that can be computed in linear time in the data size. We then present SPECTRUM, a linear-time framework for learning logical theories from relational data, that mines recurrent patterns in the data, and subsequently uses our utility measure to evaluate and rank the rules derived from these patterns. Finally, we prove theoretical guarantees on the utility of the learnt logical theory. As a result, we demonstrate across various tasks that SPECTRUM scales to databases with orders of magnitude more relations and entities, often learning more accurate logical theories on CPUs in < 1% of the runtime of state-of-the-art neural network approaches on GPUs.
作者备注:29 pages
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v4 · 2026-11-16 23:32 · 最新观测版本
Linear-time Rule Mining Under Formal Guarantees
Probabilistic logical models are a core component of neurosymbolic AI and are important in their own right for tasks that require high explainability. Unlike neural networks, logical theories that underlie the model are often handcrafted using domain expertise, making their development costly and prone to errors. While there are algorithms that learn logical theories from data, they are generally prohibitively expensive, limiting their applicability in real-world settings. Here, we introduce precision and recall for logical rules and define their composition as rule utility -- a measure of the predictive power of logical theories that can be computed in linear time in the data size. We then present SPECTRUM, a linear-time framework for learning logical theories from relational data, that mines recurrent patterns in the data, and subsequently uses our utility measure to evaluate and rank the rules derived from these patterns. Finally, we prove theoretical guarantees on the utility of the learnt logical theory. As a result, we demonstrate across various tasks that SPECTRUM scales to databases with orders of magnitude more relations and entities, often learning more accurate logical theories on CPUs in < 1% of the runtime of state-of-the-art neural network approaches on GPUs.
查看此版本解读 →查看此版本原文 ↗