Cart (Loading....) | Create Account
Close category search window
 

On reducing learning time in context-dependent mappings

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
$31 $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)
Yeung, Dit-Yan ; Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Kowloon, Hong Kong ; Bekey, George A.

An approach to overcoming the slow convergence problems often associated with learning complex nonlinear mappings is presented. The mappings are learned in a context-dependent manner so that complex problems are decomposed into simpler subproblems corresponding to different contexts. While no general conditions for determining applicability the method have been found, its power is illustrated through experiments in controlling simulated robot manipulators in two and three degrees of freedom. The experiments also indicate that the method shows promising scale-up properties

Published in:

Neural Networks, IEEE Transactions on  (Volume:4 ,  Issue: 1 )

Date of Publication:

Jan 1993

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.