Fetching the paper…
Reading the bibliography…
Understanding recurrent networks through rule extraction has a long history.
N. Chomsky, “Three models for the description of language,” IRE Transactions on information theory , vol. 2, no. 3, pp. 113–124, 1956
1956
Earlier work this paper cites.
M. Feinberg, “Fibonacci-tribonacci,” The Fibonacci Quarterly , vol. 1, no. 1, pp. 71–74, 1963
1963
Earlier work this paper cites.
M. L. Minsky, Computation: finite and infinite machines . Prentice-Hall, Inc., 1967
1967
Earlier work this paper cites.
M. Tomita, “Dynamic construction of finite automata from example using hill-climbing,” Proceedings of the Fourth Annual Cognitive Science Conference , pp. 105–108, 1982
1982
Earlier work this paper cites.
D. Angluin, “Learning regular sets from queries and counterexamples,” Inf. Comput. , vol. 75, no. 2, pp. 87–106, 1987
1987
Earlier work this paper cites.
J. L. Elman, “Finding structure in time,” Cognitive science , vol. 14, no. 2, pp. 179–211, 1990
1990
Earlier work this paper cites.
C. L. Giles, G.-Z. Sun, H.-H. Chen, Y.-C. Lee, and D. Chen, “Higher order recurrent networks and grammatical inference,” in Advances in neural information processing systems , 1990, pp. 380–387
1990
Earlier work this paper cites.
C. L. Giles, D. Chen, C. Miller, H. Chen, G. Sun, and Y. Lee, “Second-order recurrent neural networks for grammatical inference,” in Neural Networks, 1991., IJCNN-91-Seattle International Joint Conference on , vol. 2. IEEE, 1991, pp. 273–281
1991
Earlier work this paper cites.
C. L. Giles, C. B. Miller, D. Chen, H.-H. Chen, G.-Z. Sun, and Y.-C. Lee, “Learning and extracting finite state automata with second-order recurrent neural networks,” Neural Computation , vol. 4, no. 3, pp. 393–405, 1992
1992
Earlier work this paper cites.
R. L. Watrous and G. M. Kuhn, “Induction of finite-state languages using second-order recurrent networks,” Neural Computation , vol. 4, pp. 406–414, 1992
1992
Earlier work this paper cites.
Z. Zeng, R. M. Goodman, and P. Smyth, “Learning finite state machines with self-clustering recurrent networks,” Neural Computation , vol. 5, no. 6, pp. 976–990, 1993
1993
Earlier work this paper cites.
J. F. Kolen, “Fool’s gold: Extracting finite state machines from recurrent network dynamics,” in Advances in neural information processing systems , 1994, pp. 501–508
1994
Earlier work this paper cites.
A. Sanfeliu and R. Alquezar, “Active grammatical inference: a new learning methodology,” in in Shape, Structure and Pattern Recogniton, D. Dori and A. Bruckstein (eds.), World Scientific Pub . Citeseer, 1994
1994
Earlier work this paper cites.
D. Lind and B. Marcus, An introduction to symbolic dynamics and coding . Cambridge university press, 1995
1995
Earlier work this paper cites.
P. Tiňo and J. Šajda, “Learning and extracting initial mealy automata with a modular neural network model,” Neural Computation , vol. 7, no. 4, pp. 822–844, 1995
1995
Earlier work this paper cites.
T. Lin, B. G. Horne, P. Tiño, and C. L. Giles, “Learning long-term dependencies in NARX recurrent neural networks,” IEEE Trans. Neural Networks , vol. 7, no. 6, pp. 1329–1338, 1996
1996
Cited alongside, same era.
C. W. Omlin and C. L. Giles, “Extraction of rules from discrete-time recurrent neural networks,” Neural Networks , vol. 9, no. 1, pp. 41–52, 1996
1996
Cited alongside, same era.
M. Casey, “The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction,” Neural computation , vol. 8, no. 6, pp. 1135–1178, 1996
1996
Cited alongside, same era.
P. Frasconi, M. Gori, M. Maggini, and G. Soda, “Representation of finite state automata in recurrent radial basis function networks,” Machine Learning , vol. 23, no. 1, pp. 5–32, 1996
1996
Cited alongside, same era.
K. Cho, B. Van Merriënboer, D. Bahdanau, and Y. Bengio, “On the properties of neural machine translation: Encoder-decoder approaches,” in Proceedings of SSST@EMNLP 2014, Eighth Workshop on Syntax, Semantics and Structure in Statistical Translation, Doha, Qatar, 25 October 2014 , 2014, pp. 103–111
2014
Later among the works it cites.
Y. Wu, S. Zhang, Y. Zhang, Y. Bengio, and R. Salakhutdinov, “On multiplicative integration with recurrent neural networks,” in Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, December 5-10, 2016, Barcelona, Spain , 2016, pp. 2856–2864
2016
Later among the works it cites.
K. Li and J. C. Príncipe, “The kernel adaptive autoregressive-moving-average algorithm,” IEEE transactions on neural networks and learning systems , vol. 27, no. 2, pp. 334–346, 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1997
Cited alongside, same era.
R. C. Carrasco, “Accurate computation of the relative entropy between stochastic regular grammars,” RAIRO-Theoretical Informatics and Applications , vol. 31, no. 5, pp. 437–444, 1997
1997
Cited alongside, same era.
M. Gori, M. Maggini, E. Martinelli, and G. Soda, “Inductive inference from noisy examples using the hybrid finite state filter,” IEEE Transactions on Neural Networks , vol. 9, no. 3, pp. 571–575, 1998
1998
Cited alongside, same era.
I. Schellhammer, J. Diederich, M. Towsey, and C. Brugman, “Knowledge extraction and recurrent neural networks: An analysis of an elman network trained on a natural language learning task,” in Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning . Association for Computational Linguistics, 1998, pp. 73–78
1998
Cited alongside, same era.
C. W. Omlin and C. L. Giles, “Symbolic knowledge representation in recurrent neural networks: Insights from theoretical models of computation,” Knowledge based neurocomputing , pp. 63–115, 2000
2000
Cited alongside, same era.
F. Thollard, P. Dupont, C. de la Higuera et al. , “Probabilistic dfa inference using kullback-leibler divergence and minimality,” in ICML , 2000, pp. 975–982
2000
Cited alongside, same era.
J. E. Hopcroft, R. Motwani, and J. D. Ullman, “Introduction to automata theory, languages, and computation - international edition (2. ed),” 2003
2003
Cited alongside, same era.
H. Jacobsson, “Rule extraction from recurrent neural networks: Ataxonomy and review,” Neural Computation , vol. 17, no. 6, pp. 1223–1263, 2005
2005
Cited alongside, same era.
2016
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
J. Du, S. Ma, Y. Wu, S. Kar, and J. M. F. Moura, “Convergence analysis of distributed inference with vector-valued gaussian belief propagation,” Journal of Machine Learning Research , vol. 18, pp. 172:1–172:38, 2017
2017
Later among the works it cites.
N. Frosst and G. E. Hinton, “Distilling a neural network into a soft decision tree,” in Proceedings of the First International Workshop on Comprehensibility and Explanation in AI and ML 2017 co-located with 16th International Conference of the Italian Association for Artificial Intelligence (AI*IA 2017), Bari, Italy, November 16th and 17th, 2017. , 2017
2017
Later among the works it cites.
Q. Wang, K. Zhang, A. G. Ororbia II, X. Xing, X. Liu, and C. L. Giles, “An empirical evaluation of rule extraction from recurrent neural networks,” Neural Computation , vol. 30, no. 9, pp. 2568–2591, 2018
2018
Closest in time.
G. Weiss, Y. Goldberg, and E. Yahav, “Extracting automata from recurrent neural networks using queries and counterexamples,” Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsmässan, Stockholm, Sweden, July 10-15, 2018 , pp. 5244–5253, 2018
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
G. Weiss, Y. Goldberg, and E. Yahav, “Extracting automata from recurrent neural networks using queries and counterexamples,” in Proceedings of the 35th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, vol. 80. PMLR, 10–15 Jul 2018, pp. 5247–5256
2018
Closest in time.