title: Learning the pseudoinverse solution to network weights.
abstract: The last decade has seen the parallel emergence in computational neuroscience and machine learning of neural network structures which spread the input signal randomly to a higher dimensional space; perform a nonlinear activation; and then solve for a regression or classification output by means of a mathematical pseudoinverse operation. In the field of neuromorphic engineering, these methods are increasingly popular for synthesizing biologically plausible neural networks, but the "learning method"-computation of the pseudoinverse by singular value decomposition-is problematic both for biological plausibility and because it is not an online or an adaptive method. We present an online or incremental method of computing the pseudoinverse precisely, which we argue is biologically plausible as a learning method, and which can be made adaptable for non-stationary data streams. The method is significantly more memory-efficient than the conventional computation of pseudoinverses by singular value decomposition.
authors.affiliation: Bioelectronics and Neuroscience Group, The MARCS Institute, University of Western Sydney, Building XB, Kingswood Campus, Kingswood 2751 NSW, Australia. j.tapson@uws.edu.au
authors.forename: J
authors.initials: J
authors.lastname: Tapson
authors.forename: A
authors.initials: A
authors.lastname: van Schaik
mesh_terms: D001921:Brain / Q000502:physiology*; D058256:Brain Waves / Q000502:physiology*; D006801:Humans; D007858:Learning / Q000502:physiology*; D008433:Mathematics; D016571:Neural Networks, Computer
keywords: Biological plausibility; Extreme learning machine; Moore–Penrose pseudoinverse; Neural engineering