This is the authors' abstract. We don't add key points for this paper.
Networks of linear units are the simplest kind of networks, where the basic questions related to learning, generalization, and self-organization can sometimes be answered analytically. We survey most of the known results on linear networks, including: 1) backpropagation learning and the structure of the error function landscape, 2) the temporal evolution of generalization, and 3) unsupervised learning algorithms and their properties. The connections to classical statistical ideas, such as principal component analysis (PCA), are emphasized as well as several simple but challenging open questions. A few new results are also spread across the paper, including an analysis of the effect of noise on backpropagation networks and a unified view of all unsupervised algorithms.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Baldi et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: