BriefGPT.xyz
Oct, 2018
使用加权自动机解释顺序数据上的黑盒子
Explaining Black Boxes on Sequential Data using Weighted Automata
HTML
PDF
Stephane Ayache, Remi Eyraud, Noe Goudian
TL;DR
研究了如何从学习黑匣子中提取加权自动机,以评估其全局可解释性,不需要访问数据集或内部表示,充分利用黑匣子的输出结果,实验结果表明此算法在48个合成数据集和2个实际数据集上的逼近效果出色。
Abstract
Understanding how a learned black box works is of crucial interest for the future of
machine learning
. In this paper, we pioneer the question of the global
interpretability
of learned
→