Self-timed Reinforcement Learning using Tsetlin Machine
Not on the map. Why?
Abstract (arXiv)
We present a hardware design for the learning datapath of the Tsetlin machine algorithm, along with a latency analysis of the inference datapath. In order to generate a low energy hardware which is suitable for pervasive artificial intelligence applications, we use a mixture of asynchronous design techniques - including Petri nets, signal transition graphs, dual-rail and bundled-data. The work builds on previous design of the inference hardware, and includes an in-depth breakdown of the automaton feedback, probability generation and Tsetlin automata. Results illustrate the advantages of asynchronous design in applications such as personalized healthcare and battery-powered internet of things devices, where energy is limited and latency is an important figure of merit. Challenges of static timing analysis in asynchronous circuits are also addressed.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 6 of its 17 references that are in the map. First posted on arXiv 2 Sep 2021.
Builds on
6 of 17 references.
References · 6
- 2018The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logiccited by 71
- 2018Using the Tsetlin Machine to Learn Human-Interpretable Rules for High-Accuracy Text Categorization with Medical Applicationscited by 24
- 2020Measuring the Novelty of Natural Language Text Using the Conjunctive Clauses of a Tsetlin Machine Text Classifiercited by 15
- 2020Closed-Form Expressions for Global and Local Interpretation of Tsetlin Machines with Applications to Explaining High-Dimensional Datacited by 6
- 2020A Novel Multi-Step Finite-State Automaton for Arbitrarily Deterministic Tsetlin Machine Learningcited by 5
- 2020Low-Latency Asynchronous Logic Design for Inference at the Edgecited by 5
Built on by
Citing papers per year: 2025: 2.
2 papers.