Fetching the paper…
Reading the bibliography…
A key feature of human intelligence is the ability to generalize beyond the training distribution, for instance, parsing longer sentences than seen in the past.
Verification of forecasts expressed in terms of probability
Brier, G. W. et al · 1950
Earlier work this paper cites.
Essai d’une recherche statistique sur le texte du roman” eugene onegin” illustrant la liaison des epreuve en chain (’example of a statistical investigation of the text of” eugene onegin” illustrating the dependence between samples in chain’). izvistia imperatorskoi akademii nauk (bulletin de l’académie impériale des sciences de st.-pétersbourg), 7: 153–162, 1913
Markov, A · 1956
Earlier work this paper cites.
Connectionism and cognitive architecture: A critical analysis
Fodor, J. A. and Pylyshyn, Z. W · 1988
Earlier work this paper cites.
Extraction of rules from discrete-time recurrent neural networks
Omlin, C. W. and Giles, C. L · 1996
Earlier work this paper cites.
Introduction to the theory of computation
Sipser, M · 1996
Earlier work this paper cites.
Learning a deterministic finite automaton with a recurrent neural network
Firoiu, L., Oates, T., and Cohen, P. R · 1998
Earlier work this paper cites.
Finite state machines and recurrent neural networks—automata and dynamical systems approaches
Tiňo, P., Horne, B. G., Giles, C. L., and Collingwood, P. C · 1998
Earlier work this paper cites.
Lstm recurrent networks learn simple context-free and context-sensitive languages
Gers, F. A. and Schmidhuber, E · 2001
Earlier work this paper cites.
A mathematical theory of communication
Shannon, C. E · 2001
Earlier work this paper cites.
Learning bounds for domain adaptation
Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., and Wortman, J · 2008
Earlier work this paper cites.
The application of hidden markov models in speech recognition
Gales, M. and Young, S · 2008
Earlier work this paper cites.
Applications of weighted automata in natural language processing
Knight, K. and May, J · 2009
Cited alongside, same era.
Literature survey: domain adaptation algorithms for natural language processing
Li, Q · 2012
Cited alongside, same era.
On calibration of modern neural networks
Guo, C., Pleiss, G., Sun, Y., and Weinberger, K. Q · 2017
Cited alongside, same era.
Recurrent neural networks as weighted language recognizers
Chen, Y., Gilroy, S., Maletti, A., May, J., and Knight, K · 2018
Cited alongside, same era.
Generalization without systematicity: On the compositional skills of sequence-to-sequence recurrent networks
Lake, B. and Baroni, M · 2018
Cited alongside, same era.
Rearranging the familiar: Testing compositional generalization in recurrent networks
Loula, J., Baroni, M., and Lake, B · 2018
Connecting weighted automata and recurrent neural networks through spectral learning
Rabusseau, G., Li, T., and Precup, D · 2019
Later among the works it cites.
Bridging theory and algorithm for domain adaptation
Zhang, Y., Liu, T., Long, M., and Jordan, M · 2019
Later among the works it cites.
Compositional generalization in semantic parsing: Pre-training vs. specialized architectures
Furrer, D., van Zee, M., Scales, N., and Schärli, N · 2020
Later among the works it cites.
Compositionality decomposed: how do neural networks generalise?
Hupkes, D., Dankers, V., Mul, M., and Bruni, E · 2020
Later among the works it cites.
Cogs: A compositional generalization challenge based on semantic interpretation
Kim, N. and Linzen, T · 2020
Later among the works it cites.
A survey on domain adaptation theory: learning bounds and theoretical guarantees
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Pac learning guarantees under covariate shift
Pagnoni, A., Gramatovici, S., and Liu, S · 2018
Cited alongside, same era.
Extracting automata from recurrent neural networks using queries and counterexamples
Weiss, G., Goldberg, Y., and Yahav, E · 2018
Cited alongside, same era.
Cnns found to jump around more skillfully than rnns: Compositional generalization in seq2seq convolutional networks
Dessì, R. and Baroni, M · 2019
Cited alongside, same era.
Compositional generalization through meta sequence-to-sequence learning
Lake, B. M · 2019
Cited alongside, same era.
Representing formal languages: A comparison between finite automata and recurrent neural networks
Michalenko, J. J · 2019
Cited alongside, same era.
Learning and extracting finite state automata with second-order recurrent neural networks
Giles, C. L., Miller, C. B., Chen, D., Chen, H.-H., Sun, G.-Z., and Lee, Y.-C
Cited in the paper.
Redko, I., Morvant, E., Habrard, A., Sebban, M., and Bennani, Y · 2020
Later among the works it cites.
A benchmark for systematic generalization in grounded language understanding
Ruis, L., Andreas, J., Baroni, M., Bouchacourt, D., and Lake, B. M · 2020
Later among the works it cites.
*-cfq: Analyzing the scalability of machine learning on a compositional task
Tsarkov, D., Tihon, T., Scales, N., Momchev, N., Sinopalnikov, D., and Schärli, N · 2020
Later among the works it cites.
Proceedings of the second workshop on domain adaptation for nlp
Ben-David, E., Cohen, S. B., McDonald, R., Plank, B., Reichart, R., Rotman, G., and Ziser, Y · 2021
Later among the works it cites.
Wilds: A benchmark of in-the-wild distribution shifts
Koh, P. W., Sagawa, S., Xie, S. M., Zhang, M., Balsubramani, A., Hu, W., Yasunaga, M., Phillips, R. L., Gao, I., Lee, T., et al · 2021
Later among the works it cites.
Approximating probabilistic models as weighted finite automata
Suresh, A. T., Roark, B., Riley, M., and Schogol, V · 2021
Later among the works it cites.