A Tsetlin machine's class sum is mapped to a probability score by P=(1+v/T)/2 and used for uncertainty quantification, but the derivation is heuristic and the validation is weak.
Massively parallel and asynchronous Tsetlin Machine architecture supporting almost constant-time scaling
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
-
Uncertainty Quantification in the Tsetlin Machine
A Tsetlin machine's class sum is mapped to a probability score by P=(1+v/T)/2 and used for uncertainty quantification, but the derivation is heuristic and the validation is weak.