A Novel Tsetlin Machine with Enhanced Generalization

Tsetlin machine (TM) is a novel machine learning approach that implements propositional logic to perform different tasks like classification and regression. The TM can not only achieves competitive accuracy in these tasks but it is also able to provide results that are explainable and easy to implement using simple hardware. The TM learns using clauses based off the features of the data. Final classification is done using a combination of the clauses. In this paper, we propose the novel idea of adding regularizers to TM, called as Regularized TM (RegTM), to improve generalization. Regularizers have been widely used in machine learning to improve accuracy. We explore different regularization strategies and how they would influence performance. We show the feasibility of our methodology by different experiments on benchmark datasets.