Semi-supervised learning in a complex arm motor control task

Daniel Burfoot, Y. Kuniyoshi
{"title":"Semi-supervised learning in a complex arm motor control task","authors":"Daniel Burfoot, Y. Kuniyoshi","doi":"10.1109/ROBIO.2009.4913257","DOIUrl":null,"url":null,"abstract":"In real world learning problems it is often the case that while the amount of labeled training data is limited, the amount of raw, unlabeled data available is vast. It is thus beneficial to develop ways of exploiting the large amount of unlabeled data to maximize the utility of each labeled sample. We examine this “semi-supervised” learning problem in the context of a flexible arm with complex dynamics. The goal of the learning process is to predict a reward value R, which evaluates the system's performance on a given task, from an input motor command M. We assume that the number of trials for which the reward is given is strictly limited. This makes it difficult to learn the function M → R, because of the complex dynamics of the arm. We also assume that there are a large number of unsupervised trials which give information about the trajectory I that results from a particular motor command M. Our method is to first learn a mapping from the motor command M to the trajectory I from the unsupervised samples, and then learn a mapping from I to the reward value R from the supervised samples. We show that the indirect learning process M → I → R achieves superior performance to the direct process M → R, under a wide variety of conditions.","PeriodicalId":321332,"journal":{"name":"2008 IEEE International Conference on Robotics and Biomimetics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Robotics and Biomimetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROBIO.2009.4913257","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In real world learning problems it is often the case that while the amount of labeled training data is limited, the amount of raw, unlabeled data available is vast. It is thus beneficial to develop ways of exploiting the large amount of unlabeled data to maximize the utility of each labeled sample. We examine this “semi-supervised” learning problem in the context of a flexible arm with complex dynamics. The goal of the learning process is to predict a reward value R, which evaluates the system's performance on a given task, from an input motor command M. We assume that the number of trials for which the reward is given is strictly limited. This makes it difficult to learn the function M → R, because of the complex dynamics of the arm. We also assume that there are a large number of unsupervised trials which give information about the trajectory I that results from a particular motor command M. Our method is to first learn a mapping from the motor command M to the trajectory I from the unsupervised samples, and then learn a mapping from I to the reward value R from the supervised samples. We show that the indirect learning process M → I → R achieves superior performance to the direct process M → R, under a wide variety of conditions.
半监督学习在复杂手臂运动控制任务中的应用
在现实世界的学习问题中,经常出现这样的情况:虽然标记的训练数据数量有限,但可用的原始、未标记数据数量巨大。因此,开发利用大量未标记数据的方法以最大化每个标记样本的效用是有益的。我们在具有复杂动力学的柔性臂的背景下研究这种“半监督”学习问题。学习过程的目标是预测奖励值R,它评估系统在给定任务上的表现,从输入的运动命令m中,我们假设给予奖励的试验次数是严格限制的。这使得学习函数M→R变得困难,因为手臂的动力学非常复杂。我们还假设存在大量的无监督试验,这些试验给出了由特定电机命令M产生的轨迹I的信息。我们的方法是首先从无监督样本中学习从电机命令M到轨迹I的映射,然后从有监督样本中学习从I到奖励值R的映射。研究表明,在多种条件下,间接学习过程M→I→R比直接学习过程M→R具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信