Faithful approaches to rule learning
Rule learning involves developing machine learning models that can be applied to a set of logical facts to predict additional facts, as well as providing methods for extracting from the learned model a set of logical rules that explain symbolically the model’s predictions. Existing such approaches,...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
IJCAI Organization
2022
|
| _version_ | 1826308350931894272 |
|---|---|
| author | Tena Cucala, DJ Cuenca Grau, B Motik, B |
| author_facet | Tena Cucala, DJ Cuenca Grau, B Motik, B |
| author_sort | Tena Cucala, DJ |
| collection | OXFORD |
| description | Rule learning involves developing machine learning models
that can be applied to a set of logical facts to predict additional
facts, as well as providing methods for extracting from the
learned model a set of logical rules that explain symbolically
the model’s predictions. Existing such approaches, however,
do not describe formally the relationship between the model’s
predictions and the derivations of the extracted rules; rather,
it is often claimed without justification that the extracted rules
‘approximate’ or ‘explain’ the model, and rule quality is evaluated by manual inspection. In this paper, we study the formal properties of Neural-LP—a prominent rule learning approach. We show that the rules extracted from Neural-LP
models can be both unsound and incomplete: on the same input dataset, the extracted rules can derive facts not predicted
by the model, and the model can make predictions not derived
by the extracted rules. We also propose a modification to the
Neural-LP model that ensures that the extracted rules are always sound and complete. Finally, we show that, on several
prominent benchmarks, the classification performance of our
modified model is comparable to that of the standard NeuralLP model. Thus, faithful learning of rules is feasible from
both a theoretical and practical point of view. |
| first_indexed | 2024-03-07T07:18:14Z |
| format | Conference item |
| id | oxford-uuid:509bde04-cbbb-4711-a5f0-44f4b21ef195 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T07:18:14Z |
| publishDate | 2022 |
| publisher | IJCAI Organization |
| record_format | dspace |
| spelling | oxford-uuid:509bde04-cbbb-4711-a5f0-44f4b21ef1952022-09-01T08:15:06ZFaithful approaches to rule learningConference itemhttp://purl.org/coar/resource_type/c_5794uuid:509bde04-cbbb-4711-a5f0-44f4b21ef195EnglishSymplectic ElementsIJCAI Organization2022Tena Cucala, DJCuenca Grau, BMotik, BRule learning involves developing machine learning models that can be applied to a set of logical facts to predict additional facts, as well as providing methods for extracting from the learned model a set of logical rules that explain symbolically the model’s predictions. Existing such approaches, however, do not describe formally the relationship between the model’s predictions and the derivations of the extracted rules; rather, it is often claimed without justification that the extracted rules ‘approximate’ or ‘explain’ the model, and rule quality is evaluated by manual inspection. In this paper, we study the formal properties of Neural-LP—a prominent rule learning approach. We show that the rules extracted from Neural-LP models can be both unsound and incomplete: on the same input dataset, the extracted rules can derive facts not predicted by the model, and the model can make predictions not derived by the extracted rules. We also propose a modification to the Neural-LP model that ensures that the extracted rules are always sound and complete. Finally, we show that, on several prominent benchmarks, the classification performance of our modified model is comparable to that of the standard NeuralLP model. Thus, faithful learning of rules is feasible from both a theoretical and practical point of view. |
| spellingShingle | Tena Cucala, DJ Cuenca Grau, B Motik, B Faithful approaches to rule learning |
| title | Faithful approaches to rule learning |
| title_full | Faithful approaches to rule learning |
| title_fullStr | Faithful approaches to rule learning |
| title_full_unstemmed | Faithful approaches to rule learning |
| title_short | Faithful approaches to rule learning |
| title_sort | faithful approaches to rule learning |
| work_keys_str_mv | AT tenacucaladj faithfulapproachestorulelearning AT cuencagraub faithfulapproachestorulelearning AT motikb faithfulapproachestorulelearning |