title: Optimal node perturbation in linear perceptrons with uncertain eligibility trace.
abstract: Node perturbation learning has been receiving much attention as a method for achieving stochastic gradient descent. As it does not require direct gradient calculations, it can be applied to a reinforcement learning framework. However, in conventional node perturbation learning, the residual error due to perturbation is not eliminated even after convergence. Using infinitesimal perturbations suppresses the residual error, but such perturbations are less robust against uncertainty and noise in an eligibility trace, which is a memory of perturbation and input. We derive an optimal parameter schedule for node perturbation learning used with linear perceptrons with uncertainty in the eligibility trace. Our adaptive learning rule resolves the trade-off between robustness against the uncertainty and residual error reduction. The results obtained will be useful in designing learning rules and interpreting related biological knowledge.
authors.affiliation: Graduate School of Frontier Sciences, The University of Tokyo, Kashiwa, Chiba, Japan. katahira@mns.k.u-tokyo.ac.jp
authors.forename: Kentaro
authors.initials: K
authors.lastname: Katahira
authors.forename: Tatsuya
authors.initials: T
authors.lastname: Cho
authors.forename: Kazuo
authors.initials: K
authors.lastname: Okanoya
authors.forename: Masato
authors.initials: M
authors.lastname: Okada
mesh_terms: D000465:Algorithms; D006801:Humans; D007858:Learning; D016014:Linear Models; D008568:Memory; D016571:Neural Networks, Computer; D013997:Time Factors; D035501:Uncertainty