activity
20192025
most citedLearning Minimalistic Tsetlin Machine Clauses with Markov Boundary-Guided Pruning

1 citations · 1 across the 3 of their papers we have counts for

collaborators

5 papers

cs.LG2025

The Tsetlin Machine Goes Deep: Logical Learning and Reasoning With Graphs

Ole-Christoffer Granmo, Youmna Abdelwahab, Per-Arne Andersen +12

Pattern recognition with concise and flat AND-rules makes the Tsetlin Machine (TM) both interpretable and efficient, while the power of Tsetlin automata enables accuracy comparable…

cs.LG20231 cited

Learning Minimalistic Tsetlin Machine Clauses with Markov Boundary-Guided Pruning

Ole-Christoffer Granmo, Per-Arne Andersen, Lei Jiao +3

A set of variables is the Markov blanket of a random variable if it contains all the information needed for predicting the variable. If the blanket cannot be reduced without losing…

math.OC2023

Jointly Improving the Sample and Communication Complexities in Decentralized Stochastic Minimax Optimization

Xuan Zhang, Gabriel Mancino-Ball, Necdet Serhat Aybat +1

We propose a novel single-loop decentralized algorithm called DGDA-VR for solving the stochastic nonconvex strongly-concave minimax problem over a connected network of agents.…

cs.LG2021

On the Convergence of Tsetlin Machines for the XOR Operator

Lei Jiao, Xuan Zhang, Ole-Christoffer Granmo +1

The Tsetlin Machine (TM) is a novel machine learning algorithm with several distinct properties, including transparent inference and learning using hardware-near building blocks. A…

cs.LG2019

A Scheme for Continuous Input to the Tsetlin Machine with Applications to Forecasting Disease Outbreaks

K. Darshana Abeyrathna, Ole-Christoffer Granmo, Xuan Zhang +1

In this paper, we apply a new promising tool for pattern classification, namely, the Tsetlin Machine (TM), to the field of disease forecasting. The TM is interpretable because it i…