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

用整数加权子句扩展Tsetlin机以提高可解释性

Extending the Tsetlin Machine With Integer-Weighted Clauses for Increased Interpretability

Centre for Artificial Intelligence Research(人工智能研究中心);University of Agder(阿格德大学)

K. Darshana Abeyrathna, Ole-Christoffer Granmo, Morten Goodwin

摘要:

尽管付出了巨大的努力,但对于许多模式识别问题来说,构建既可解释又准确的模型仍然是一个尚未解决的挑战。一般来说,基于规则的线性模型缺乏准确性,而深度学习的可解释性是基于对底层推理的粗略近似。在命题逻辑中使用合取子句的线性组合,Tsetlin机器(TM)在不同的基准测试中表现出有竞争力的性能。然而,要做到这一点,需要许多子句,这影响了可解释性。在这里,我们通过为TM子句配备整数权重来解决机器学习中的准确性-可解释性挑战。由此产生的加权TM(IWTM)处理的问题,学习哪些条款是不准确的,因此必须组队,以获得高精度作为一个团队(低权重条款),以及哪些条款是足够准确,更独立地操作(高权重条款)。由于每个TM子句是由一组Tsetlin自动机自适应地形成的,因此识别有效权重成为一个具有挑战性的在线学习问题。我们解决这个问题,通过扩展每个团队的Tsetlin自动机与随机搜索线(SSL)自动机。在我们的新方案中,SSL自动机在与相应的Tsetlin自动机团队的交互中学习其子句的权重,而Tsetlin自动机团队又通过调整权重来适应子句的组成。我们评估IWTM经验使用五个数据集,包括可解释性的研究。平均而言,IWTM使用的文字比普通TM少6.5倍,比具有实值权重的TM少120倍。此外,在平均F1分数方面,IWTM优于简单的多层人工神经网络,决策树,支持向量机,K-最近邻,随机森林,XGBoost,可解释提升机以及标准和实值加权TM。

英文摘要:

Despite significant effort, building models that are both interpretable and accurate is an unresolved challenge for many pattern recognition problems. In general, rule-based and linear models lack accuracy, while deep learning interpretability is based on rough approximations of the underlying inference. Using a linear combination of conjunctive clauses in propositional logic, Tsetlin Machines (TMs) have shown competitive performance on diverse benchmarks. However, to do so, many clauses are needed, which impacts interpretability. Here, we address the accuracy-interpretability challenge in machine learning by equipping the TM clauses with integer weights. The resulting Integer Weighted TM (IWTM) deals with the problem of learning which clauses are inaccurate and thus must team up to obtain high accuracy as a team (low weight clauses), and which clauses are sufficiently accurate to operate more independently (high weight clauses). Since each TM clause is formed adaptively by a team of Tsetlin Automata, identifying effective weights becomes a challenging online learning problem. We address this problem by extending each team of Tsetlin Automata with a stochastic searching on the line (SSL) automaton. In our novel scheme, the SSL automaton learns the weight of its clause in interaction with the corresponding Tsetlin Automata team, which, in turn, adapts the composition of the clause by the adjusting weight. We evaluate IWTM empirically using five datasets, including a study of interpetability. On average, IWTM uses 6.5 times fewer literals than the vanilla TM and 120 times fewer literals than a TM with real-valued weights. Furthermore, in terms of average F1-Score, IWTM outperforms simple Multi-Layered Artificial Neural Networks, Decision Trees, Support Vector Machines, K-Nearest Neighbor, Random Forest, XGBoost, Explainable Boosting Machines, and standard and real-value weighted TMs.

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

↑