title: Node perturbation learning without noiseless baseline.
abstract: Node perturbation learning is a stochastic gradient descent method for neural networks. It estimates the gradient by comparing an evaluation of the perturbed output and the unperturbed output performance, which we call the baseline. Node perturbation learning has primarily been investigated without taking noise on the baseline into consideration. In real biological systems, however, neural activities are intrinsically noisy, and hence, the baseline is likely contaminated with the noise. In this paper, we propose an alternative learning method that does not require such a noiseless baseline. Our method uses a "second perturbation", which is calculated with different noise than the first perturbation. By comparing the evaluation of the outcomes with the first perturbation and with the second perturbation, the network weights are updated. We reveal that the learning speed showed only a linear decrease with the variance of the second perturbation. Moreover, using the second perturbation can lead to a decrease in residual error compared to the case of using the noiseless baseline.
authors.affiliation: Graduate School of Frontier Sciences, The University of Tokyo, Kashiwa, Chiba 277-8561, Japan. cho@mns.k.u-tokyo.ac.jp
authors.forename: Tatsuya
authors.initials: T
authors.lastname: Cho
authors.forename: Kentaro
authors.initials: K
authors.lastname: Katahira
authors.forename: Kazuo
authors.initials: K
authors.lastname: Okanoya
authors.forename: Masato
authors.initials: M
authors.lastname: Okada
mesh_terms: D001185:Artificial Intelligence; D003198:Computer Simulation / Q000592:standards*; D016571:Neural Networks, Computer; D009622:Noise / Q000517:prevention & control