arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2310.11481cs.FLcs.AI
收藏

具有吸收自动机的收缩Tsetlin机

Contracting Tsetlin Machine with Absorbing Automata

University of Agder(阿格德大学);Newcastle University(纽卡斯尔大学)

Bimal Bhattarai, Ole-Christoffer Granmo, Lei Jiao, Per-Arne Andersen, Svein Anders Tunheim, Rishad Shafik, Alex Yakovlev

AI总结:

本文提出一种具有吸收Tsetlin自动机状态的稀疏Tsetlin机,通过引入吸收Exclude和Include状态及稀疏数据结构,使模型在学习过程中不断缩小并加速计算,从而实现更快学习和更低能耗。

摘要:

在本文中,我们引入了一种具有吸收Tsetlin自动机(TA)状态的稀疏Tsetlin机(TM)。简而言之,每个子句文字的TA同时具有一个吸收Exclude状态和一个吸收Include状态,使得学习方案变为吸收型而非遍历型。当TA达到吸收状态时,它将永远不再离开该状态。如果吸收状态是Exclude状态,则自动机和文字都可以从后续考虑中移除。结果,该文字将永远不参与该子句。另一方面,如果吸收状态是Include状态,则该文字被存储为子句的永久部分,而TA被丢弃。一种新颖的稀疏数据结构通过三个动作列表支持这些更新:Absorbed Include、Include和Exclude。通过更新这些列表,随着文字及其TA的退出,TM变得越来越小。以这种方式,学习过程中的计算加速,从而实现更快的学习和更少的能耗。

英文摘要:

In this paper, we introduce a sparse Tsetlin Machine (TM) with absorbing Tsetlin Automata (TA) states. In brief, the TA of each clause literal has both an absorbing Exclude- and an absorbing Include state, making the learning scheme absorbing instead of ergodic. When a TA reaches an absorbing state, it will never leave that state again. If the absorbing state is an Exclude state, both the automaton and the literal can be removed from further consideration. The literal will as a result never participates in that clause. If the absorbing state is an Include state, on the other hand, the literal is stored as a permanent part of the clause while the TA is discarded. A novel sparse data structure supports these updates by means of three action lists: Absorbed Include, Include, and Exclude. By updating these lists, the TM gets smaller and smaller as the literals and their TA withdraw. In this manner, the computation accelerates during learning, leading to faster learning and less energy consumption.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑