Ingen frist angitt
Please see the ISTM web site for programme, registration and updated information.
The emerging paradigm of Tsetlin machines makes a fundamental shift from arithmetic-based to logic-based machine learning. At the core, finite-state machines, based on learning automata, learn patterns using logical clauses, and these constitute a global description of the task learnt. In this way, the Tsetlin machine introduces the concept of logical interpretable learning, where both the learned model and the process of learning are easy to follow and explain. As a result, it reduces the expertise needed to apply ML techniques efficiently in various domains. The paradigm has enabled competitive accuracy, scalability, memory footprint, inference speed, and energy consumption across diverse tasks, including classification, convolution, regression, natural language processing (NLP), and speech understanding.