Optimal node perturbation in linear perceptrons with uncertain eligibility trace

DOI10.1016/J.NEUNET.2009.11.013zbMath1396.68095OpenAlexW2017002109WikidataQ51767433 ScholiaQ51767433MaRDI QIDQ1784544

Tatsuya Cho, Masato Okada, Kentaro Katahira, Kazuo Okanoya

Publication date: 27 September 2018

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2009.11.013

zbMATH Keywords

uncertaintyresidual errorlearning curvelinear perceptronnode perturbation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Node perturbation learning without noiseless baseline

Cites Work

• Simple statistical gradient-following algorithms for connectionist reinforcement learning
• Statistical Mechanics of Learning
• Learning Curves for Stochastic Gradient Descent in Linear Feedforward Networks

This page was built for publication: Optimal node perturbation in linear perceptrons with uncertain eligibility trace