mlsanityData to 7 Oct 2026

TMComposites: Plug-and-Play Collaboration Between Specialized Tsetlin Machines

arXiv 2309.04801 ↗First posted 9 Sep 2023cs.CV cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Tsetlin Machines (TMs) provide a fundamental shift from arithmetic-based to logic-based machine learning. Supporting convolution, they deal successfully with image classification datasets like MNIST, Fashion-MNIST, and CIFAR-2. However, the TM struggles with getting state-of-the-art performance on CIFAR-10 and CIFAR-100, representing more complex tasks. This paper introduces plug-and-play collaboration between specialized TMs, referred to as TM Composites. The collaboration relies on a TM's ability to specialize during learning and to assess its competence during inference. When teaming up, the most confident TMs make the decisions, relieving the uncertain ones. In this manner, a TM Composite becomes more competent than its members, benefiting from their specializations. The collaboration is plug-and-play in that members can be combined in any way, at any time, without fine-tuning. We implement three TM specializations in our empirical evaluation: Histogram of Gradients, Adaptive Gaussian Thresholding, and Color Thermometers. The resulting TM Composite increases accuracy on Fashion-MNIST by two percentage points, CIFAR-10 by twelve points, and CIFAR-100 by nine points, yielding new state-of-the-art results for TMs. Overall, we envision that TM Composites will enable an ultra-low energy and transparent alternative to state-of-the-art deep learning on more tasks and datasets.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 8 of its 18 references that are in the map. First posted on arXiv 9 Sep 2023.

Builds on

8 of 18 references.

References · 8

  1. 2019Green AIcited by 620
  2. 2021Towards Causal Representation Learningcited by 207
  3. 2021Counterfactual Generative Networkscited by 111
  4. 2018The Tsetlin Machine -- A Game Theoretic Bandit Driven Approach to Optimal Pattern Recognition with Propositional Logiccited by 71
  5. 2019The Convolutional Tsetlin Machinecited by 37
  6. 2020Extending the Tsetlin Machine With Integer-Weighted Clauses for Increased Interpretabilitycited by 16
  7. 2023Building Concise Logical Patterns by Constraining Tsetlin Machine Clause Sizecited by 14
  8. 2021A Relational Tsetlin Machine with Applications to Natural Language Understandingcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 1.

4 papers.