activity
20172021
most citedCoalesced Multi-Output Tsetlin Machines with Clause Sharing

17 citations · 17 across the 4 of their papers we have counts for

collaborators

5 papers

cs.AI202117 cited

Coalesced Multi-Output Tsetlin Machines with Clause Sharing

Sondre Glimsdal, Ole-Christoffer Granmo

Using finite-state machines to learn patterns, Tsetlin machines (TMs) have obtained competitive accuracy and learning speed across several benchmarks, with frugal memory- and energ…

cs.LG2020

Increasing the Inference and Learning Speed of Tsetlin Machines with Clause Indexing

Saeed Rahimi Gorji, Ole-Christoffer Granmo, Sondre Glimsdal +2

The Tsetlin Machine (TM) is a machine learning algorithm founded on the classical Tsetlin Automaton (TA) and game theory. It further leverages frequent pattern mining and resource…

cs.LG2019

The Convolutional Tsetlin Machine

Ole-Christoffer Granmo, Sondre Glimsdal, Lei Jiao +3

Convolutional neural networks (CNNs) have obtained astounding successes for important pattern recognition tasks, but they suffer from high computational complexity and the lack of…

cs.AI2017

Thompson Sampling Guided Stochastic Searching on the Line for Deceptive Environments with Applications to Root-Finding Problems

Sondre Glimsdal, Ole-Christoffer Granmo

The multi-armed bandit problem forms the foundation for solving a wide range of on-line stochastic optimization problems through a simple, yet effective mechanism. One simply casts…

cs.AI2017

An Optimal Bayesian Network Based Solution Scheme for the Constrained Stochastic On-line Equi-Partitioning Problem

Sondre Glimsdal, Ole-Christoffer Granmo

A number of intriguing decision scenarios revolve around partitioning a collection of objects to optimize some application specific objective function. This problem is generally re…