A Novel Multi-Step Finite-State Automaton for Arbitrarily Deterministic Tsetlin Machine Learning
K. Darshana Abeyrathna, Ole-Christoffer Granmo, Rishad Shafik, Alex, Yakovlev, Adrian Wheeldon, Jie Lei, Morten Goodwin

TL;DR
This paper introduces a deterministic multi-step automaton for Tsetlin Machines, reducing energy consumption by controlling randomization, and balancing accuracy with power savings for energy-efficient machine learning.
Contribution
It proposes a novel finite-state automaton replacing stochastic Tsetlin Automata, enabling adjustable determinism and energy savings in Tsetlin Machine learning.
Findings
Higher determinism slightly reduces accuracy.
Random number generation consumes significant energy.
Power savings up to 11 mW with high determinism.
Abstract
Due to the high energy consumption and scalability challenges of deep learning, there is a critical need to shift research focus towards dealing with energy consumption constraints. Tsetlin Machines (TMs) are a recent approach to machine learning that has demonstrated significantly reduced energy usage compared to neural networks alike, while performing competitively accuracy-wise on several benchmarks. However, TMs rely heavily on energy-costly random number generation to stochastically guide a team of Tsetlin Automata to a Nash Equilibrium of the TM game. In this paper, we propose a novel finite-state learning automaton that can replace the Tsetlin Automata in TM learning, for increased determinism. The new automaton uses multi-step deterministic state jumps to reinforce sub-patterns. Simultaneously, flipping a coin to skip every 'th state update ensures diversification by…
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.
