A Tsetlin Machine autoencoder that averages signed automaton states over all literals produces single-phase, reusable word embeddings with results close to mainstream embedding models.
Tsetlin machine embedding: Representing words using logical expressions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Omni TM-AE: A Scalable and Interpretable Embedding Model Using the Full Tsetlin Machine State Space
A Tsetlin Machine autoencoder that averages signed automaton states over all literals produces single-phase, reusable word embeddings with results close to mainstream embedding models.