Research map / Learning theory and algorithms / Combinatorial and search optimization
Linear-time rule mining under formal guarantees
Jonathan Feldstein, Dominic Phillips, Efthymia Tsamoura
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Proposes a linear-time rule mining method for learning probabilistic logical theories from data with formal guarantees.
Problem
Handcrafted probabilistic logical theories are costly and error-prone to build, while existing rule-learning algorithms are prohibitively expensive computationally.
Approach
Mines logical rules for probabilistic logical models in linear time while retaining formal guarantees; the abstract is truncated so specifics are not stated.
Closest papers by meaning
- Neuro-Symbolic Temporal Point Processes (ICML 2024 · similarity 0.85)
- RULEBREAKERS: Challenging LLMs at the Crossroads between Formal Logic and Human-like Reasoning (ICML 2025 · similarity 0.84)
- Learning curves theory for hierarchically compositional data with power-law distributed features (ICML 2025 · similarity 0.84)
- On the Hardness of Probabilistic Neurosymbolic Learning (ICML 2024 · similarity 0.84)
- Right for the Right Reasons: Avoiding Reasoning Shortcuts via Prototypical Neurosymbolic AI (NeurIPS 2025 · similarity 0.84)
- The Gradient of Algebraic Model Counting (AAAI 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
