Omni TM-AE: A Scalable and Interpretable Embedding Model Using the Full Tsetlin Machine State Space
Ahmed K. Kadhim, Lei Jiao, Rishad Shafik, Ole-Christoffer Granmo

TL;DR
Omni TM-AE is a scalable, interpretable embedding model leveraging the Tsetlin Machine's full state space, achieving competitive performance in NLP tasks while maintaining transparency and reusability.
Contribution
It introduces a novel embedding approach that fully utilizes the Tsetlin Machine's state matrix, enhancing interpretability and scalability in NLP embeddings.
Findings
Performs competitively with mainstream models in semantic tasks.
Enables reusable, interpretable embeddings in a single training phase.
Balances performance, scalability, and interpretability without opaque architectures.
Abstract
The increasing complexity of large-scale language models has amplified concerns regarding their interpretability and reusability. While traditional embedding models like Word2Vec and GloVe offer scalability, they lack transparency and often behave as black boxes. Conversely, interpretable models such as the Tsetlin Machine (TM) have shown promise in constructing explainable learning systems, though they previously faced limitations in scalability and reusability. In this paper, we introduce Omni Tsetlin Machine AutoEncoder (Omni TM-AE), a novel embedding model that fully exploits the information contained in the TM's state matrix, including literals previously excluded from clause formation. This method enables the construction of reusable, interpretable embeddings through a single training phase. Extensive experiments across semantic similarity, sentiment classification, and document…
Peer Reviews
Decision·ICLR 2026 Conference Withdrawn Submission
- Leveraging the full TM state space (including excluded literals) is conceptually innovative and practically impactful, addressing both interpretability and reusability. - Results across diverse datasets show that Omni TM-AE can exceed traditional embeddings, particularly in tasks involving semantic similarity.
### W1. Limited task coverage The method produces only word-level embeddings, with sentence/document representations obtained by simple averaging. It's shallow compared to modern contextual or sentence-level embeddings (e.g., SBERT, SimCSE) used in real-world retrieval and classification pipelines. Extending experiments to sentence-level benchmarks (e.g., MTEB) would clarify scalability and real-world utility. ### W2. Missing interpretability baselines. Comparisons are limited to black-box and
I have not conducted a technical review of this paper because of its style and anonymity violations.
I have not conducted a technical review of this paper because of its style and anonymity violations.
1. The design encourages traceability: because each dimension corresponds directly to literal states, the model allows users to track how reward and penalty signals contribute to the final embedding. This kind of mechanistic interpretability is not common in standard neural embedding approaches. 2. The empirical coverage is reasonably broad, spanning similarity, clustering, and classification settings. The inclusion of implementation details and code facilitates reproducibility, even if the ben
1. The proposed approach is limited to word-level representations. Sentence and document vectors are derived through simple averaging, a composition strategy that lags behind the richer contextual embedding techniques now standard in practice (e.g., SBERT-like models). Importantly, the method is not evaluated on the MTEB benchmark, which has become the principal standard for embedding model comparisons across retrieval, STS, reranking, clustering, and classification tasks. This omission weakens
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExplainable Artificial Intelligence (XAI) · Multimodal Machine Learning Applications · Topic Modeling
MethodsGloVe Embeddings
