On the Convergence of Tsetlin Machines for the AND and the OR Operators

by   Lei Jiao, et al.

The Tsetlin Machine (TM) is a novel machine-learning algorithm based on propositional logic, which has obtained state-of-the-art performance on several pattern recognition problems. In previous studies, the convergence properties of TM for 1-bit operation and XOR operation have been analyzed. To make the analyses for the basic digital operations complete, in this article, we analyze the convergence when input training samples follow AND and OR operators respectively. Our analyses reveal that the TM can converge almost surely to reproduce AND and OR operators, which are learnt from training data over an infinite time horizon. The analyses on AND and OR operators, together with the previously analysed 1-bit and XOR operations, complete the convergence analyses on basic operators in Boolean algebra.


page 1

page 2

page 3

page 4


On the Convergence of Tsetlin Machines for the IDENTITY- and NOT Operators

The Tsetlin Machine (TM) is a recent machine learning algorithm with sev...

On the Convergence of Tsetlin Machines for the XOR Operator

The Tsetlin Machine (TM) is a novel machine learning algorithm with seve...

Results on bivariate Szasz-Mirakyan type operators in polynomial weight spaces

In this paper, bivariate Szasz-Mirakjan type operators are introduced al...

First Degree Entailment with Group Attitudes and Information Updates

We extend the epistemic logic with De Morgan negation by Fagin et al. (A...

Learning Algorithms via Neural Logic Networks

We propose a novel learning paradigm for Deep Neural Networks (DNN) by u...

Privacy-Preserving Distributed Machine Learning Made Faster

With the development of machine learning, it is difficult for a single s...

Toggling operators in computability logic

Computability logic (CL) (see http://www.cis.upenn.edu/ giorgi/cl.html )...