- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This work targets the inherent limitation of TM that the absence of an explicit loss function and exclusive reliance on the built-in margin-based heuristic update rule and presents Loss-Guided TM. While preserving the original Tsetlin automata and clause logic intact, the proposed framework uses a pluggable explicit loss to drive clause feedback and weight updates, supporting cross-entropy, symmetric cross-entropy, asymmetric loss and other customized loss formulations. Experiments on six datasets spanning binary, multi-class and multi-label tasks show that compared with the original MBUR mechanism, Loss-Guided TM improves accuracy and F1 scores on most tasks, and significantly reduces calibration error, where the asymmetric loss variant is particularly effective for imbalanced multi-label scenarios. Visualization further verifies that the proposed method does not compromise the native interpretability of TM, and can even learn more reasonable patterns with more stable training dynamics. The main limitation is that the current experiments only adopt limited hyperparameter tuning, without large-scale hyperparameter search.
Critical strengths
-
The original MBUR of TM is a fixed heuristic rule that cannot connect to mature loss function research. This paper implements loss-driven updates without modifying the underlying Tsetlin automata and logical clause structure, expanding the capability of TM to adapt to different task objectives such as imbalance handling and calibration.
-
The paper not only demonstrates on multiple types of datasets that Loss-Guided TM can boost model performance, improve confidence calibration and mitigate training degradation issues, but also verifies through global interpretability visualization on image and text tasks that the introduced loss mechanism does not impair the interpretability of clause rules, and in some scenarios can even learn feature patterns that better fit the task semantics.
Critical weaknesses
-
The paper mainly proves the effectiveness of the proposed method through experimental phenomena, but does not theoretically analyze whether the model can still guarantee the stable learning of logical clauses after using loss gradients to drive Tsetlin automata clause updates, nor does it explain how different loss functions affect the update behavior of the automata. As a modification to the core learning rule of TM, the lack of theoretical support will reduce the trust in the reliability of the method.
-
Both MBUR and Loss-Guided TM in the paper are compared using only one set of hyperparameters, without a complete grid search. This makes it impossible to rule out the possibility that the advantages of Loss-Guided TM merely stem from its more adapted hyperparameter configuration.
Questions for authors
-
The loss‑guided mechanism involves both discrete Tsetlin Automaton feedback based on and gradient‑based weight updates for joint training. Could you further elaborate on the coupling relationship between these two components? For instance, can gradient‑driven weight updates alter clause outputs and thereby interfere with automaton feedback signals? Have you observed any conflicting training behaviours between the two parts?
-
Comparisons are conducted only over a limited set of hyperparameters in this work. Without exhaustive grid‑search tuning, how do you rule out the possibility that sufficiently well‑tuned MBUR could narrow or even close the performance gaps in terms of ECE and F‑score against Loss‑Guided TM? Are there any control experiments that support the claim that the observed performance gains stem from the loss‑guided mechanism itself rather than hyperparameter choices?
-
ASL yields substantial F‑score improvements for multi‑label tasks yet produces higher ECE than vanilla MBUR. Could you explain the underlying cause for this trade‑off? Is this phenomenon caused by inherent mismatches between the ASL loss and the probability mapping derived from model voting outputs?
We thank the reviewer again for the constructive review. Following the questions, the revised pdf now includes the following, with references in the main text.
We hope these address the reviewer's concerns, and we would be grateful to hear whether any points remain, which we are happy to clarify.