3,400 research outputs found
Stability Analysis of Various Symbolic Rule Extraction Methods from Recurrent Neural Network
This paper analyzes two competing rule extraction methodologies: quantization
and equivalence query. We trained RNN models, extracting DFA
with a quantization approach (k-means and SOM) and DFA by equivalence
query() methods across initialization seeds. We sampled the
datasets from Tomita and Dyck grammars and trained them on RNN
cells: LSTM, GRU, O2RNN, and MIRNN. The observations from our experiments
establish the superior performance of O2RNN and quantization-based rule
extraction over others. , primarily proposed for regular grammars,
performs similarly to quantization methods for Tomita languages when neural
networks are perfectly trained. However, for partially trained RNNs,
shows instability in the number of states in DFA, e.g., for Tomita 5 and Tomita
6 languages, produced more than states. In contrast, quantization
methods result in rules with number of states very close to ground truth DFA.
Among RNN cells, O2RNN produces stable DFA consistently compared to other
cells. For Dyck Languages, we observe that although GRU outperforms other RNNs
in network performance, the DFA extracted by O2RNN has higher performance and
better stability. The stability is computed as the standard deviation of
accuracy on test sets on networks trained across seeds. On Dyck Languages,
quantization methods outperformed with better stability in accuracy and
the number of states. often showed instability in accuracy in the order
of for GRU and MIRNN while deviation for quantization methods
varied in . In many instances with LSTM and GRU, DFA's extracted by
even failed to beat chance accuracy (), while those extracted by
quantization method had standard deviation in the range. For O2RNN,
both rule extraction methods had deviation in the range
- β¦