An Improved Method for Tsetlin Machine Based on Multi-level Feedback and Dynamic Parameter
DOI:
https://doi.org/10.62051/ijcsit.v5n2.05Keywords:
Tsetlin Machine, Learning Automata, Machine Learning, Artificial IntelligenceAbstract
Addressing the issues of slow convergence and insufficient stability in the training process of Tsetlin Machine (TM), this paper proposes an innovative approach that integrates a multi-level feedback mechanism with dynamic parameter adjustment. By introducing a four-level feedback mechanism, this method accelerates the reinforcement of high-contribution clauses and the correction of significant errors through fine-grained feedback intensity allocation. Additionally, a dynamic parameter adjustment strategy for s is proposed, which optimizes state transition probabilities across different training stages using periodic steps d, thereby enhancing the model's exploration-exploitation balance capabilities. Experimental results demonstrate that this method improves training speed by approximately two times on the MNIST dataset, with an accuracy enhancement of 0.5%. These findings confirm that the proposed method significantly enhances model convergence efficiency and generalization performance through graded feedback intensity and adaptive parameter mechanisms, offering new insights for the deployment of interpretable AI in resource-constrained scenarios.
Downloads
References
[1] O.-C. Granmo, “The tsetlin machine–a game theoretic bandit driven approach to optimal pattern recognition with propositional logic,” arXiv preprint arXiv:1804.01508, 2018.
[2] J. Lei, A. Wheeldon, R. Shafik, A. Yakovlev and O. -C. Granmo, "From Arithmetic to Logic based AI: A Comparative Analysis of Neural Networks and Tsetlin Machine," 2020 27th IEEE International Conference on Electronics, Circuits and Systems (ICECS), 2020, pp. 1-4.
[3] Phoulady A, Granmo O C, Gorji S R, et al. The weighted tsetlin machine: compressed representations with weighted clauses[J]. arxiv preprint arxiv:1911.12607, 2019.
[4] Tarasyuk O, Rahman T, Shafik R, et al. Systematic Search for Optimal Hyper-parameters of the Tsetlin Machine on MNIST Dataset[C]//2023 International Symposium on the Tsetlin Machine (ISTM). IEEE, 2023: 1-8.
[5] R. Shafik, A. Wheeldon, and A. Yakovlev, “Explainability and depend ability analysis of learning automata based ai hardware,” in 2020 IEEE 26th International Symposium on On-Line Testing and Robust System Design (IOLTS). IEEE, 2020, pp. 1–4.
[6] J. Lei, T. Rahman, R. Shafik, A. Wheeldon, A. Yakovlev, O.-C. Granmo, F. Kawsar, and A. Mathur, “Low-power audio keyword spotting using tsetlin machines,” Journal of Low Power Electronics and Applications, vol. 11, no. 2, p. 18, 2021.
[7] R. Saha, O.-C. Granmo, and M. Goodwin, “Mining interpretable rules for sentiment and semantic relation analysis using tsetlin machines,” in International Conference on Innovative Techniques and Applications of Artificial Intelligence. Springer, 2020, pp. 67–78.
[8] K. D. Abeyrathna, O.-C. Granmo, and M. Goodwin, “Extending the tsetlin machine with integer-weighted clauses for increased interpretability,” IEEE Access, vol. 9, pp. 8233–8248, 2021.
[9] Olsen A R. A Scalable Architecture for Parallel Execution of the Tsetlin Machine[D]. Universitetet i Agder; University of Agder, 2019.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 International Journal of Computer Science and Information Technology

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







