TL;DR
This paper explores how recurrent and recursive neural networks process hierarchical language structures by visualizing their internal representations and developing diagnostic classifiers to interpret their strategies and generalization capabilities.
Contribution
It introduces a diagnostic classifier approach to analyze neural network strategies for hierarchical language processing, demonstrating their ability to generalize and process complex structures.
Findings
Recursive networks find generalizing solutions for hierarchical tasks
Recurrent networks with gated units perform well on nested expressions
Diagnostic classifiers reveal networks use a cumulative processing strategy
Abstract
We investigate how neural networks can learn and process languages with hierarchical, compositional semantics. To this end, we define the artificial task of processing nested arithmetic expressions, and study whether different types of neural networks can learn to compute their meaning. We find that recursive neural networks can find a generalising solution to this problem, and we visualise this solution by breaking it up in three steps: project, sum and squash. As a next step, we investigate recurrent neural networks, and show that a gated recurrent unit, that processes its input incrementally, also performs very well on this task. To develop an understanding of what the recurrent network encodes, visualisation techniques alone do not suffice. Therefore, we develop an approach where we formulate and test multiple hypotheses on the information encoded and processed by the network. For…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
