Low-Power Audio Keyword Spotting using Tsetlin Machines
Not on the map. Why?
Abstract (arXiv)
The emergence of Artificial Intelligence (AI) driven Keyword Spotting (KWS) technologies has revolutionized human to machine interaction. Yet, the challenge of end-to-end energy efficiency, memory footprint and system complexity of current Neural Network (NN) powered AI-KWS pipelines has remained ever present. This paper evaluates KWS utilizing a learning automata powered machine learning algorithm called the Tsetlin Machine (TM). Through significant reduction in parameter requirements and choosing logic over arithmetic based processing, the TM offers new opportunities for low-power KWS while maintaining high learning efficacy. In this paper we explore a TM based keyword spotting (KWS) pipeline to demonstrate low complexity with faster rate of convergence compared to NNs. Further, we investigate the scalability with increasing keywords and explore the potential for enabling low-power on-chip KWS.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Jan 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 0; 2023: 3; 2024: 0; 2025: 2; 2026: 2.
11 papers.
- 2021Coalesced Multi-Output Tsetlin Machines with Clause Sharingcited by 22
- 2023Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Sizecited by 14
- 2021A Relational Tsetlin Machine with Applications to Natural Language Understandingcited by 8
- 2021Drop Clause: Enhancing Performance, Interpretability and Robustness of the Tsetlin Machinecited by 7
- 2021Ultra-Low Power Keyword Spotting at the Edgecited by 6
- 2023IMBUE: In-Memory Boolean-to-CUrrent Inference ArchitecturE for Tsetlin Machinescited by 3
- 2025Dynamic Tsetlin Machine Accelerators for On-Chip Training at the Edge using FPGAscited by 2
- 2025Runtime Tunable Tsetlin Machines for Edge Inference on eFPGAscited by 1
- 2023Verifying Properties of Tsetlin Machinescited by 0
- 2026FastOmniTMAE: Parallel Clause Learning for Scalable and Hardware-Efficient Tsetlin Embeddingscited by 0
- 2026Autonomous Collaborative Learning Among an Ensemble of Tsetlin Machines with Consensus-Based Inferencecited by 0
- 2026Autonomous Collaborative Learning Among an Ensemble of Tsetlin Machines with Consensus-Based Inference22 Jul 2026
- 2026FastOmniTMAE: Parallel Clause Learning for Scalable and Hardware-Efficient Tsetlin Embeddings7 May 2026
- 2025Dynamic Tsetlin Machine Accelerators for On-Chip Training at the Edge using FPGAs28 Apr 2025
- 2025Runtime Tunable Tsetlin Machines for Edge Inference on eFPGAs10 Feb 2025
- 2023IMBUE: In-Memory Boolean-to-CUrrent Inference ArchitecturE for Tsetlin Machines22 May 2023
- 2023Verifying Properties of Tsetlin Machines25 Mar 2023
- 2023Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Size19 Jan 2023
- 2021Ultra-Low Power Keyword Spotting at the Edge9 Nov 2021
- 2021Coalesced Multi-Output Tsetlin Machines with Clause Sharing17 Aug 2021
- 2021Drop Clause: Enhancing Performance, Interpretability and Robustness of the Tsetlin Machine30 May 2021
- 2021A Relational Tsetlin Machine with Applications to Natural Language Understanding22 Feb 2021