By Topic

A Training Algorithm for Systems Described by Stochastic Transition Matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. M. Glorioso ; Elec. Eng. Dept., University of Massachusetts, Amherst, Mass. 01002 ; G. R. Grueneich

Stochastic transition matrices are a convenient means for describing the behavior of adaptive and learning systems. Several systems which utilize these matrices and associated reinforcement (reward and punishment) techniques have been reported. A training algorithm is described which has been applied to a learning system described by stochastic transition matrices in which the environment was unknown a priori and nonstationary.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-1 ,  Issue: 1 )