Exploring State Space and Reasoning by Elimination in Tsetlin Machines
Ahmed K. Kadhim, Ole-Christoffer Granmo, Lei Jiao, Rishad Shafik

TL;DR
This paper enhances Tsetlin Machines by introducing Reasoning by Elimination to improve clause descriptiveness and representation, employing TM-AE for dense word vectors, and demonstrating robustness across datasets with high accuracy.
Contribution
It proposes a novel Reasoning by Elimination approach within Tsetlin Machines and explores state space regulation to improve pattern representation and classification performance.
Findings
Achieved 90.62% accuracy on IMDB dataset.
Demonstrated improved clause descriptiveness with RbE.
Validated robustness across multiple datasets.
Abstract
The Tsetlin Machine (TM) has gained significant attention in Machine Learning (ML). By employing logical fundamentals, it facilitates pattern learning and representation, offering an alternative approach for developing comprehensible Artificial Intelligence (AI) with a specific focus on pattern classification in the form of conjunctive clauses. In the domain of Natural Language Processing (NLP), TM is utilised to construct word embedding and describe target words using clauses. To enhance the descriptive capacity of these clauses, we study the concept of Reasoning by Elimination (RbE) in clauses' formulation, which involves incorporating feature negations to provide a more comprehensive representation. In more detail, this paper employs the Tsetlin Machine Auto-Encoder (TM-AE) architecture to generate dense word vectors, aiming at capturing contextual information by extracting…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFuzzy Logic and Control Systems
MethodsSoftmax · Attention Is All You Need · Focus
