Neural Reasoning Networks: Efficient Interpretable Neural Networks With Automatic Textual Explanations
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912067647176704 |
|---|---|
| author | Carrow, Stephen Erwin, Kyle Harper Vilenskaia, Olga Ram, Parikshit Klinger, Tim Khan, Naweed Aghmad Makondo, Ndivhuwo Gray, Alexander |
| author_facet | Carrow, Stephen Erwin, Kyle Harper Vilenskaia, Olga Ram, Parikshit Klinger, Tim Khan, Naweed Aghmad Makondo, Ndivhuwo Gray, Alexander |
| contents | Recent advances in machine learning have led to a surge in adoption of neural networks for various tasks, but lack of interpretability remains an issue for many others in which an understanding of the features influencing the prediction is necessary to ensure fairness, safety, and legal compliance. In this paper we consider one class of such tasks, tabular dataset classification, and propose a novel neuro-symbolic architecture, Neural Reasoning Networks (NRN), that is scalable and generates logically sound textual explanations for its predictions. NRNs are connected layers of logical neurons which implement a form of real valued logic. A training algorithm (R-NRN) learns the weights of the network as usual using gradient descent optimization with backprop, but also learns the network structure itself using a bandit-based optimization. Both are implemented in an extension to PyTorch (https://github.com/IBM/torchlogic) that takes full advantage of GPU scaling and batched training. Evaluation on a diverse set of 22 open-source datasets for tabular classification demonstrates performance (measured by ROC AUC) which improves over multi-layer perceptron (MLP) and is statistically similar to other state-of-the-art approaches such as Random Forest, XGBoost and Gradient Boosted Trees, while offering 43% faster training and a more than 2 orders of magnitude reduction in the number of parameters required, on average. Furthermore, R-NRN explanations are shorter than the compared approaches while producing more accurate feature importance scores. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_07966 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Neural Reasoning Networks: Efficient Interpretable Neural Networks With Automatic Textual Explanations Carrow, Stephen Erwin, Kyle Harper Vilenskaia, Olga Ram, Parikshit Klinger, Tim Khan, Naweed Aghmad Makondo, Ndivhuwo Gray, Alexander Machine Learning Artificial Intelligence I.2.6; I.5.1 Recent advances in machine learning have led to a surge in adoption of neural networks for various tasks, but lack of interpretability remains an issue for many others in which an understanding of the features influencing the prediction is necessary to ensure fairness, safety, and legal compliance. In this paper we consider one class of such tasks, tabular dataset classification, and propose a novel neuro-symbolic architecture, Neural Reasoning Networks (NRN), that is scalable and generates logically sound textual explanations for its predictions. NRNs are connected layers of logical neurons which implement a form of real valued logic. A training algorithm (R-NRN) learns the weights of the network as usual using gradient descent optimization with backprop, but also learns the network structure itself using a bandit-based optimization. Both are implemented in an extension to PyTorch (https://github.com/IBM/torchlogic) that takes full advantage of GPU scaling and batched training. Evaluation on a diverse set of 22 open-source datasets for tabular classification demonstrates performance (measured by ROC AUC) which improves over multi-layer perceptron (MLP) and is statistically similar to other state-of-the-art approaches such as Random Forest, XGBoost and Gradient Boosted Trees, while offering 43% faster training and a more than 2 orders of magnitude reduction in the number of parameters required, on average. Furthermore, R-NRN explanations are shorter than the compared approaches while producing more accurate feature importance scores. |
| title | Neural Reasoning Networks: Efficient Interpretable Neural Networks With Automatic Textual Explanations |
| topic | Machine Learning Artificial Intelligence I.2.6; I.5.1 |
| url | https://arxiv.org/abs/2410.07966 |