Uncertainty Quantification in the Tsetlin Machine
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913929487187968 |
|---|---|
| author | Helin, Runar Granmo, Ole-Christoffer Shende, Mayur Kishor Jiao, Lei Zadorozhny, Vladimir I. Dumbre, Kunal Ganesh Shafik, Rishad Yakovlev, Alex |
| author_facet | Helin, Runar Granmo, Ole-Christoffer Shende, Mayur Kishor Jiao, Lei Zadorozhny, Vladimir I. Dumbre, Kunal Ganesh Shafik, Rishad Yakovlev, Alex |
| contents | Data modeling using Tsetlin machines (TMs) is all about building logical rules from the data features. The decisions of the model are based on a combination of these logical rules. Hence, the model is fully transparent and it is possible to get explanations of its predictions. In this paper, we present a probability score for TM predictions and develop new techniques for uncertainty quantification to increase the explainability further. The probability score is an inherent property of any TM variant and is derived through an analysis of the TM learning dynamics. Simulated data is used to show a clear connection between the learned TM probability scores and the underlying probabilities of the data. A visualization of the probability scores also reveals that the TM is less confident in its predictions outside the training data domain, which contrasts the typical extrapolation phenomenon found in Artificial Neural Networks. The paper concludes with an application of the uncertainty quantification techniques on an image classification task using the CIFAR-10 dataset, where they provide new insights and suggest possible improvements to current TM image classification models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_04175 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Uncertainty Quantification in the Tsetlin Machine Helin, Runar Granmo, Ole-Christoffer Shende, Mayur Kishor Jiao, Lei Zadorozhny, Vladimir I. Dumbre, Kunal Ganesh Shafik, Rishad Yakovlev, Alex Machine Learning Artificial Intelligence Data modeling using Tsetlin machines (TMs) is all about building logical rules from the data features. The decisions of the model are based on a combination of these logical rules. Hence, the model is fully transparent and it is possible to get explanations of its predictions. In this paper, we present a probability score for TM predictions and develop new techniques for uncertainty quantification to increase the explainability further. The probability score is an inherent property of any TM variant and is derived through an analysis of the TM learning dynamics. Simulated data is used to show a clear connection between the learned TM probability scores and the underlying probabilities of the data. A visualization of the probability scores also reveals that the TM is less confident in its predictions outside the training data domain, which contrasts the typical extrapolation phenomenon found in Artificial Neural Networks. The paper concludes with an application of the uncertainty quantification techniques on an image classification task using the CIFAR-10 dataset, where they provide new insights and suggest possible improvements to current TM image classification models. |
| title | Uncertainty Quantification in the Tsetlin Machine |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2507.04175 |