Boolean implementation of a Tsetlin machine

הרקע לפרויקט:

A Tsetlin Machine is a machine learning model based on propositional logic that learns patterns in data using simple, interpretable rules. It employs a group of Tsetlin Automata to form decisions, with each automaton selecting either to include or exclude specific logical clauses. These clauses are combined to represent complex patterns. Unlike neural networks, Tsetlin Machines operate on binary inputs and outputs, offering lower computational complexity, easier interpretability, and scalability. They are effective for classification tasks and are particularly suited to problems where rule-based learning is advantageous

מטרת הפרויקט:

In this project we would like to implement boolean functions with the help of the machine on an fpga board

תכולת הפרויקט:

The students will learn about the Tsetlin machine and use it to implement various boolean functions

קורסי קדם:

• קורס מעגלים ספרתיים
• מעבדה למעגלים ספרתיים

דרישות נוספות:

• The work will be in the Vivado software environment and they will experience working on an FPGA board
• The students will be required to write in Verilog and will have to learn how the board works

מקורות:

1. https://tsetlinmachine.org/
2. Ole-Christoffer Granmo,The Tsetlin Machine – A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logic,2021