Extracting automata from neural networks using active learning

被引:2
作者
Xu, Zhiwu [1 ]
Wen, Cheng [1 ]
Qin, Shengchao [1 ,2 ]
He, Mengda [2 ]
机构
[1] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China
[2] Teesside Univ, Sch Comp Engn & Digital Technol, Middlesbrough, Cleveland, England
基金
中国国家自然科学基金;
关键词
Automata learning; Neural network; Active learning;
D O I
10.7717/peerj-cs.436
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Deep learning is one of the most advanced forms of machine learning. Most modern deep learning models are based on an artificial neural network, and benchmarking studies reveal that neural networks have produced results comparable to and in some cases superior to human experts. However, the generated neural networks are typically regarded as incomprehensible black-box models, which not only limits their applications, but also hinders testing and verifying. In this paper, we present an active learning framework to extract automata from neural network classifiers, which can help users to understand the classifiers. In more detail, we use Angluin's L* algorithm as a learner and the neural network under learning as an oracle, employing abstraction interpretation of the neural network for answering membership and equivalence queries. Our abstraction consists of value, symbol and word abstractions. The factors that may affect the abstraction are also discussed in the paper. We have implemented our approach in a prototype. To evaluate it, we have performed the prototype on a MNIST classifier and have identified that the abstraction with interval number 2 and block size 1 x 28 offers the best performance in terms of F1 score. We also have compared our extracted DFA against the DFAs learned via the passive learning algorithms provided in LearnLib and the experimental results show that our DFA gives a better performance on the MNIST dataset.
引用
收藏
页码:1 / 28
页数:28
相关论文
共 30 条
[1]  
Adriaans P, 2006, LECT NOTES ARTIF INT, V4201, P293
[2]   Model Learning and Model-Based Testing [J].
Aichernig, Bernhard K. ;
Mostowski, Wojciech ;
Mousavi, Mohammad Reza ;
Tappler, Martin ;
Taromirad, Masoumeh .
MACHINE LEARNING FOR DYNAMIC SOFTWARE ANALYSIS: POTENTIALS AND LIMITS, 2018, 11026 :74-100
[3]   LEARNING REGULAR SETS FROM QUERIES AND COUNTEREXAMPLES [J].
ANGLUIN, D .
INFORMATION AND COMPUTATION, 1987, 75 (02) :87-106
[4]  
[Anonymous], 2018, LEARNING INTERPRETAB
[5]  
Berant J, 2017, INDUCING REGULAR GRA
[6]  
Biggio Battista, 2013, Machine Learning and Knowledge Discovery in Databases. European Conference, ECML PKDD 2013. Proceedings: LNCS 8190, P387, DOI 10.1007/978-3-642-40994-3_25
[7]  
Cechin AL, 2003, SCCC 2003: XXIII INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY, PROCEEDINGS, P73
[8]  
Cicchello O, 2002, LECT NOTES ARTIF INT, V2484, P37
[9]  
Dupont P., 1996, Grammatical Inference: Learning Syntax from Sentences. Third International Colloquium, ICGI-96 Proceedings, P222, DOI 10.1007/BFb0033357
[10]  
Frasconi P, 1996, MACH LEARN, V23, P5