acceptodds
Under review as a conference paper at ICLR 2027

Loss-Guided Tsetlin Machines: Making the Learning Objective Explicit

Abstract

The Tsetlin Machine (TM) has no explicit notion of a loss function. Its learning signal is fixed to an implicit, margin-based update rule (MBUR), with no way to choose an objective function suited to a specific task. This paper introduces Loss-Guided TM, which replaces MBUR with an explicit and swappable loss function. In our proposed method, clause feedback and weight updates are driven by the loss, while keeping the Tsetlin Automaton and clause logic unchanged. The approach incorporates cross entropy (CE), symmetric cross entropy (SCE), and asymmetric loss (ASL). We evaluate Loss-Guided TM across six datasets that span multiclass, multi-label, and binary classification tasks. For each dataset, the best-performing Loss-Guided configuration is significantly better calibrated than the MBUR-based one, reducing calibration error by a factor of to . It further improves accuracy and F1 across all datasets. The gains are greatest for the imbalanced multilabel datasets, where ASL improves macro F1 by up to percentage points compared to MBUR. A qualitative inspection shows that the clause-based global interpretability, examined at the per-class level on image and text data, is preserved when using the Loss-Guided mechanism. These results show that our explicit TM learning objective allows direct targeting of uncertainty calibration, data imbalance, and task structure, opening the TM to the broader literature on loss functions.

open until 14 Dec 2026

est. 32% chance this paper gets accepted at ICLR 2027.

Reject 68%Accept 32%

What do you think this paper will get?

All positions stay anonymous.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.