Optimal schedules in multitask motor learning
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Jeong Yoon | - |
dc.contributor.author | Oh, Youngmin | - |
dc.contributor.author | Kim, Sung Shin | - |
dc.contributor.author | Scheidt, Robert A. | - |
dc.contributor.author | Schweighofer, Nicolas | - |
dc.date.accessioned | 2022-07-15T17:49:28Z | - |
dc.date.available | 2022-07-15T17:49:28Z | - |
dc.date.created | 2021-05-14 | - |
dc.date.issued | 2016-04 | - |
dc.identifier.issn | 0899-7667 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/154797 | - |
dc.description.abstract | Although scheduling multiple tasks in motor learning to maximize long-term retention of performance is of great practical importance in sports training and motor rehabilitation after brain injury, it is unclear how to do so. We propose here a novel theoretical approach that uses optimal control theory and computational models of motor adaptation to determine schedules that maximize long-term retention predictively. Using Pontryagin’s maximum principle, we derived a control law that determines the trial-by-trial task choice that maximizes overall delayed retention for all tasks, as predicted by the state-space model. Simulations of a single session of adaptation with two tasks show that when task interference is high, there exists a threshold in relative task difficulty below which the alternating schedule is optimal. Only for large differences in task difficulties do optimal schedules assign more trials to the harder task. However, over the parameter range tested, alternating schedules yield long-term retention performance that is only slightly inferior to performance given by the true optimal schedules. Our results thus predict that in a large number of learning situations wherein tasks interfere, intermixing tasks with an equal number of trials is an effective strategy in enhancing long-term retention | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | MIT PRESS | - |
dc.title | Optimal schedules in multitask motor learning | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sung Shin | - |
dc.identifier.doi | 10.1162/NECO_a_00823 | - |
dc.identifier.scopusid | 2-s2.0-85005959757 | - |
dc.identifier.wosid | 000372981200004 | - |
dc.identifier.bibliographicCitation | NEURAL COMPUTATION, v.28, no.4, pp.667 - 685 | - |
dc.relation.isPartOf | NEURAL COMPUTATION | - |
dc.citation.title | NEURAL COMPUTATION | - |
dc.citation.volume | 28 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 667 | - |
dc.citation.endPage | 685 | - |
dc.type.rims | ART | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Neurosciences & Neurology | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial | - |
dc.relation.journalWebOfScienceCategory | Intelligence | - |
dc.relation.journalWebOfScienceCategory | Neurosciences | - |
dc.subject.keywordPlus | ADAPTATIO | - |
dc.subject.keywordPlus | NRETENTION | - |
dc.subject.keywordPlus | MODELS | - |
dc.subject.keywordPlus | MEMORY | - |
dc.subject.keywordPlus | UNCERTAINTY | - |
dc.subject.keywordPlus | DYNAMICS | - |
dc.subject.keywordPlus | SKILL | - |
dc.subject.keywordPlus | STATE | - |
dc.subject.keywordPlus | REACH | - |
dc.identifier.url | https://direct.mit.edu/neco/article/28/4/667/8149/Optimal-Schedules-in-Multitask-Motor-Learning | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.