A Comparison Between Tsetlin Machines and Deep Neural Networks in the Context of Recommendation Systems
Not on the map. Why?
Abstract (arXiv)
Recommendation Systems (RSs) are ubiquitous in modern society and are one of the largest points of interaction between humans and AI. Modern RSs are often implemented using deep learning models, which are infamously difficult to interpret. This problem is particularly exasperated in the context of recommendation scenarios, as it erodes the user's trust in the RS. In contrast, the newly introduced Tsetlin Machines (TM) possess some valuable properties due to their inherent interpretability. TMs are still fairly young as a technology. As no RS has been developed for TMs before, it has become necessary to perform some preliminary research regarding the practicality of such a system. In this paper, we develop the first RS based on TMs to evaluate its practicality in this application domain. This paper compares the viability of TMs with other machine learning models prevalent in the field of RS. We train and investigate the performance of the TM compared with a vanilla feed-forward deep learning model. These comparisons are based on model performance, interpretability/explainability, and scalability. Further, we provide some benchmark performance comparisons to similar machine learning solutions relevant to RSs.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 7 of its 18 references that are in the map. First posted on arXiv 20 Dec 2022.
Builds on
7 of 18 references.
References · 7
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
- 2018The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logiccited by 72
- 2019The Convolutional Tsetlin Machinecited by 37
- 2021Explainable Tsetlin Machine framework for fake news detection with credibility score assessmentcited by 23
- 2020Massively Parallel and Asynchronous Tsetlin Machine Architecture Supporting Almost Constant-Time Scalingcited by 20
- 2020Extending the Tsetlin Machine With Integer-Weighted Clauses for Increased Interpretabilitycited by 16
Built on by
Citing papers per year: 2023: 2.
2 papers.