Recent theoretical studies have proposed that the redundant motor system in humans achieves well-organized stereotypical movements by minimizing motor effort cost and motor error. However, it is unclear how this optimization process is implemented in the brain, presumably because conventional schemes have assumed a priori that the brain somehow constructs the optimal motor command, and largely ignored the underlying trial-by-trial learning process. In contrast, recent studies focusing on the trial-by-trial modification of motor commands based on error information suggested that forgetting (i.e., memory decay), which is usually considered as an inconvenient factor in motor learning, plays an important role in minimizing the motor effort cost. Here, we examine whether trial-by-trial error-feedback learning with slight forgetting could minimize the motor effort and error in a highly redundant neural network for sensorimotor transformation and whether it could predict the stereotypical activation patterns observed in primary motor cortex (M1) neurons. First, using a simple linear neural network model, we theoretically demonstrated that: 1) this algorithm consistently leads the neural network to converge at a unique optimal state; 2) the biomechanical properties of the musculoskeletal system necessarily determine the distribution of the preferred directions (PD; the direction in which the neuron is maximally active) of M1 neurons; and 3) the bias of the PDs is steadily formed during the minimization of the motor effort. Furthermore, using a non-linear network model with realistic musculoskeletal data, we demonstrated numerically that this algorithm could consistently reproduce the PD distribution observed in various motor tasks, including two-dimensional isometric torque production, two-dimensional reaching, and even three-dimensional reaching tasks. These results may suggest that slight forgetting in the sensorimotor transformation network is responsible for solving the redundancy problem in motor control.
It is thought that the brain can optimize motor commands to produce efficient movements; however, it is unknown how this optimization process is implemented in the brain. Here we examine a biologically plausible hypothesis in which slight forgetting in the motor learning process plays an important role in the optimization process. Using a neural network model for motor learning, we initially theoretically demonstrated that motor learning with a slight forgetting factor consistently led the network to converge at an optimal state. In addition, by applying the forgetting scheme to a more sophisticated neural network model with realistic musculoskeletal data, we showed that the model could account for the reported stereotypical activity patterns of muscles and motor cortex neurons in various motor tasks. Our results support the hypothesis that slight forgetting, which is conventionally considered to diminish motor learning performance, plays a crucial role in the optimization process of the redundant motor system.
Citation: Hirashima M, Nozaki D (2012) Learning with Slight Forgetting Optimizes Sensorimotor Transformation in Redundant Motor Systems. PLoS Comput Biol 8(6): e1002590. doi:10.1371/journal.pcbi.1002590
Editor: Jörn Diedrichsen, University College London, United Kingdom
Received: July 6, 2011; Accepted: April 23, 2012; Published: June 28, 2012
Copyright: © 2012 Hirashima, Nozaki. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Funding: This research was supported by Grants-in-Aid for JSPS Fellows #19-8779 (M.H.), Young Scientists (Start-up) #21800015 (M.H.), the NEXT Program #LS034 (D.N.), Young Scientists (S) #20670008 (D.N.), and a CASIO Science Promotion Foundation grant (D.N.). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
The motor system exhibits tremendous redundancy . For example, an infinite number of muscle activation patterns can generate a desired joint torque because multiple muscles span a single joint; moreover, several combinations of neuronal activity in the motor cortex can achieve exactly the same muscle activation pattern. Nevertheless, strongly stereotypical patterns are observed in the activity patterns of neurons in the primary motor cortex (M1) – as well as those of the muscles –. How, then, does the motor system select such stereotypical behavior from an infinite number of possible solutions?
The hypothesis that the brain selects a solution that minimizes the cost of movement has long been proposed , . Recent studies have indicated that various aspects of motor control, such as trajectory formation and the selection of a muscle activation pattern, can be reproduced when the motor command is constructed to minimize the cost J , , , as expressed by:(1)With regard to the movement accuracy, it is widely accepted that information on movement error is available to the brain –. In contrast, there is no evidence indicating that the brain explicitly computes the cost of motor effort across a vast number of neurons and muscles (i.e., the sum of the squared activity) . Some theoretical studies have proposed that the brain can implicitly minimize the motor effort cost by minimizing the variance of motor performance in the presence of signal-dependent noise (SDN) , . This theory has attracted widespread interest because the minimization of variance is more biologically plausible than the explicit minimization of the motor effort cost. However, there is still no evidence indicating that a statistical quantity such as variance is represented in the brain , . Thus, it is unknown how the optimization process that minimizes the cost function J is implemented in the brain.
It should be noted that these conventional optimization studies tacitly assume that the brain somehow constructs a motor command that theoretically minimizes the cost function, and largely ignored the underlying trial-by-trial learning process –, . In contrast, recent studies that focused on the trial-by-trial modification of motor commands suggested that forgetting (i.e., synaptic weight decay) is helpful for minimizing the motor effort cost without an explicit calculation of a complex quantity (i.e., sum of squares) –. Although the “weight decay method” has been used as a technical method in the machine-learning community since the 1980s to suppress irrelevant connections in a neural network and to improve the network's generalization ability –, it is only recently that its potential for solving the redundancy problem in the context of motor control began to be investigated. Importantly, Emken et al.  demonstrated that trial-by-trial error-feedback learning with forgetting minimizes a cost function that is the weighted sum of motor error and motor effort. However, since the authors formulated their motor learning scheme with only a single lumped muscle (i.e., a non-redundant actuator), their model cannot predict the activation patterns of individual muscles. Burdet et al. and Franklin et al. also proposed a similar but more elaborate algorithm (the V-shaped learning function) and showed that it could predict the evolution of the activity of individual muscles that was actually observed when human subjects learn to perform movements in novel dynamic environments , , . This algorithm has been also used to realize human-like adaptive behavior in robots , .
However, it is unknown whether the decay algorithm could minimize the cost (J) in a highly redundant neural network that includes M1 neurons and whether it can predict the activation patterns of M1 neurons. Neurophysiological studies reported that the preferred direction (PD; the direction in which the neuron is maximally active) of M1 neurons was stereotypically biased toward a specific direction –. Although a conventional optimization study suggested that the bias is a result of the minimization of the cost (J) , it is unclear how the two terms of the cost function (i.e., error and effort) are minimized on a trial-by-trial basis and how the PD bias of M1 neurons is formed during the optimization process.
To gain insight into these mechanisms, we conducted computer simulations of motor learning by applying the “feedback-with-decay” algorithm to a redundant neural network model for sensorimotor transformation. First, we used a simple linear model to gain a firm theoretical understanding of the effect of the decay on the minimization of the cost (J) and the formation of the PD bias. Then, using a non-linear network model with realistic musculoskeletal data, we examined numerically whether this algorithm could predict the PD bias reported in various motor tasks. Our simulations revealed that the “feedback-with-decay” algorithm could consistently reproduce the PD distribution observed during various motor tasks, including a 2D isometric torque production task and a reaching task, and even a 3D reaching task.
Linear neural network model
As a simple example of a redundant motor task, we considered a task that requires the production of torque in a two-joint system with redundant actuators (Figure 1A, B). To demonstrate clearly the effect of weight decay, we initially used a simple linear feed-forward neural network that transforms the desired torque (input layer) into actual torque (output layer) through an intermediate layer that consisted of 1000 neurons (Figure 1B). Each neuron in the intermediate layer received a desired torque vector (τ) from the input layer with a synaptic weight (W) that could be modified with learning. The activation level (r) was linearly dependent on the input torque vector (i.e., r = Wτ), indicating that it obeys cosine tuning. Each neuron generated its own 2D torque vector (mechanical torque direction vector: MDV) that was predetermined by its connection strength (M) with the output layer. The total output of the network (T) was the vector sum of the output from all neurons. The MDVs were biased toward the first and third quadrants in the torque space (dots for M in Figure 1C). The network was trained to produce appropriate output torque by randomly presenting 8 target torques (Figure 1A) over 40,000 trials. An error back-propagation algorithm  was successively used to modify the synaptic weight (W), while the MDV matrix (M) was held constant.
(A) Eight targets that were uniformly distributed in the 2D torque plane were used to train the network. (B) A linear neural network model that transforms the desired torque (input layer) into actual torque (output layer) through 1000 neurons (intermediate layer). (C) The dots for M indicate the distribution of the mechanical direction vectors (MDVs) for the 1000 neurons. The dots for W indicate the distribution of the synaptic weight for the 1000 neurons after learning through error feedback with weight decay. When the distribution of the MDVs is biased toward the 1st and 3rd quadrants, W converges so that the PD distribution is biased toward the 2nd and 4th quadrants, which is orthogonal to the distribution of the MDVs.
First, we considered the case where the synaptic weights are solely modified to reduce the error, according to the following equation:(2)where α is the learning rate and Je is the error cost, as calculated by the error vector (e = T−τ) between the output and the desired torque: Je = 1/2eTe. The error gradually decreased and approached zero at around the 500th trial (Figure 2A). Once the error converged to zero, further synaptic modifications did not occur in this model (i.e., the PDs did not change after the 500th trial, Figure 2E), as schematized in Figure S1A. Thus, the cost of the motor effort (the sum of the squared neural activity) did not achieve an optimal level, and the converged states depended on the initial settings for the synaptic weight (Figure 2C; the different colors represent the different initial states). The distribution of the PDs in the converged state also depended on the initial synaptic weight (see polar histograms in Figure 2C). When uncertainty was introduced into the system (i.e., the existence of noise in execution and synaptic modification), the results were almost identical (Figure S2A–C). The synaptic weights randomly moved back and forth along a null trajectory satisfying zero movement error (Figure S2D), which is the natural consequence of redundancy in the motor system .
Trial-dependent changes in the magnitude of error (A, B), the sum of the squared neural activity (C, D) averaged across the 8 target conditions, and the PDs of 10 randomly selected neurons (E, F), when the synaptic weight was modified with feedback-only (A, C, E) or feedback-with-decay rules (B, D, F). (C, D) The 4 colored lines indicate the changes when various initial synaptic weight conditions were used (see Methods). The distributions of the neuronal PDs at 500th and 40,000th trial for each simulation are shown as polar histograms. The horizontal black line indicates the optimal value calculated analytically as the pseudo-inverse matrix of M.
However, the situation was considerably different when modification of the synaptic weights based on error feedback was not perfect, but incorporated weight decay, as follows:(3)where β indicates the decay in motor learning and has a small positive value (β = 1.0×10−4). In this model, the sum of the squared neural activity converged at an optimal value regardless of the initial synaptic weight (Figure 2D). Importantly, the distribution of the PDs also converged on the same distribution (Figure 2D, * indicates a significant bimodal distribution revealed by the Rayleigh test, P<0.05). Why did such a convergence occur? Intuitively, but not mathematically rigorous, this was because, even after error convergence, the synaptic decay term (-βWij) continued to induce a very small error. To reduce this small error, the error-feedback term continuously and gradually modified the synaptic weight; as a result, the neuron PDs (Figure 2F) and the distribution of the PDs (polar histogram in Figure 2D) continued to change, until the synaptic weight converged on the optimal state.
In mathematical terms, the modification of the synaptic weights based on the feedback-with-decay rule (Eq. (3)) is similar to the gradient descent rule for minimizing the cost function J, which is the weighted sum of the error cost (Je) and the motor effort cost (Jm):(4)as the gradient descent rule for minimizing J is expressed by:(5)However, it should be noted that Eqs. (3) and (5) do not necessarily minimize the expected value of the cost J (i.e., E[J]). The reason why we should consider E[J] rather than J itself is that the optimal solution for the biological system should globally minimize the cost J for whole movement directions (see Supporting Text S1). Hereafter, the optimal solution means that it minimizes E[J]. In this study, we theoretically proved that the modification rule [Eq. (3)] leads to optimal synaptic weight among many solutions that satisfy zero error under several necessary conditions (see Supporting Text S1): first, the decay rate (β) must be much smaller (i.e., slower) than the learning rate (α) (condition #1); second, there must be a large number of neurons, each of which generates a quite small output relative to the desired torque magnitude (condition #2); and third, more than two different and independent targets must be practiced (condition #3).
Furthermore, we have also proven that the synaptic weight matrix (W) converges to a unique pseudo-inverse of the matrix M that consists of the MDVs from all of the actuators (see Supporting Text S1).As the synaptic weight matrix determines the PDs of the neurons, the inverse relationship between W and M indicates that the distribution of the PD vectors (PDVs) was orthogonal to that of the MDVs. Therefore, when the distribution of the MDVs is biased toward the 1st and 3rd quadrants, the distribution of the converged PDVs should be biased toward the 2nd and 4th quadrants (Figure 1C).
The above results indicate three important points regarding the “feedback-with-decay” rule. First, the optimal solution can be obtained using only trial-based error information, without the explicit calculation of the sum of the squared neural activity. Second, the biomechanical properties of the actuators (i.e., MDVs) necessarily determine the neuronal recruitment pattern (i.e., PDVs). Third, the optimal PD bias is steadily formed during the minimization of the motor effort.
Another interesting observation regarding the formation of the bias of the PDs is that when the initial synaptic weight is relatively small (see cyan trace in Figure 2C), even the “feedback-only” rule predicted a PD bias that is similar to the optimal PD bias predicted by the “feedback-with-decay” rule (Figure 2D). By assessing the underlying mechanism mathematically, we found that if a large number of neurons participate in the task (condition #2), the “feedback-only” rule leads the synaptic weight W to converge on:where A (≠0) is a matrix that never increases |W(0)| and always satisfies MAW(0) = 0 (see Supporting Text S1). This result indicates that if the initial synaptic weight matrix (W(0)) is considerably smaller than the pseudo-inverse matrix (MT(MMT)−1) (condition #4), the converged PD bias is dominated by the PD bias of the pseudo-inverse. Thus, if conditions #2 and #4 are satisfied, even the “feedback-only” rule can predict the approximate direction of the optimal PD bias, even though the converged synaptic weight matrix is not optimal.
In summary, in the linear neural network model, the “feedback-with-decay” rule consistently leads to the optimal synaptic weight and the optimal PD bias, whereas the “feedback-only” rule only predicts the approximate direction of the optimal PD bias in limited conditions.
Non-linear neural network model with a muscle layer
Next, we examined whether these aspects hold true in non-linear neural network models that additionally include a muscle layer whose activity (a) was constrained as positive (i.e., muscles do not push) (Figure 3A). Here, it is assumed that the 2nd neural layer consists of corticospinal neurons in M1; however, since M1 actually includes inhibitory interneurons, the layer cannot be regarded as a real M1. Nevertheless, we modeled the neural network incorporating the properties of actual M1 neurons to gain an insight into how the corticospinal neurons are recruited under the feedback-with-decay rule.
(A) Neural network model with a muscle layer. The model consists of an input layer, a 2nd layer of 1000 neurons, a 3rd layer of 8 muscle groups at the shoulder and elbow joints, and an output layer. (B) The mechanical direction vectors (MDVs) for the 8 muscle groups. SFi, inner shoulder flexor (blue); SFo, outer shoulder flexor (light blue); SEi, inner shoulder extensor (orange); SEo, outer shoulder extensor (yellow); EF, elbow flexor (green); EE, elbow extensor (magenta); BiF, biarticular flexor (cyan); and BiE, biarticular extensor (red). (C) Distribution of the MDVs for the 1000 neurons in the 2nd layer. (D) PDs plotted against MDs. (E) PDs for the 8 muscles after learning. (F) Distribution of the synaptic weight (i.e., PDVs) for the 1000 neurons after learning. (G) Polar histogram of the neuron PDs after learning.
Firstly, each corticospinal neuron receives the desired movement parameters from the input layer and their firing rate obeys cosine tuning . Secondly, each corticospinal neuron innervates multiple muscles –. Considering that there are two types of corticospinal neurons , one type has direct connections with motoneurons (i.e., cortico-motoneuronal neurons) while the other type indirectly influences motoneurons through spinal interneurons, the innervation weight from the neurons to the muscles (Z) is allowed to take positive and negative values. At present, it is assumed that innervation is random and does not have any bias to specific muscles. It is also assumed that the innervation weight (Z) is constant through time , although this is controversial . These assumptions considerably simplified the model and allowed us to gain a clear insight into the formation of neuronal PDVs relative to the MDVs. Thirdly, the mechanical pulling direction vectors of muscles (M) were determined by the muscle parameters (e.g., moment arm) derived from a realistic musculoskeletal model , . M was also kept constant because we only examined the static aspect of movement, e.g., isometric force production or the initial ballistic phase of reaching movements. By simulating these tasks with this network model, we examined whether the feedback-with-decay rule accounts for the reported activation patterns of muscles and M1 neurons.
Isometric torque production task.
First, we simulated the isometric torque production task with a two-joint system (shoulder and elbow) conducted by Herter et al. . The simulation was conducted with 1000 neurons and 8 muscles. Figure 3B shows the MDVs of the muscles in the shoulder-elbow torque plane. Due to the presence of biarticular muscles, the distribution of the MDVs was biased toward the 1st and 3rd quadrants (Figure 3B). The assumption that neurons in the 2nd layer randomly innervate these muscles led to a biased distribution of the neuronal MDVs toward the same quadrants (Figure 3C). We trained the network using the “feedback-only” rule and the “feedback-with-decay” rule, and found that the results were similar to those observed in the linear model. When the decay was incorporated, we found that the motor effort converged on a similar value, irrespective of the initial synaptic weights after the error converged to almost zero (Figure 4B, 4D). In addition, the synaptic weights converged so that the PDs of the neurons in the 2nd layer were bimodally distributed toward the 2nd and 4th quadrants (Figure 3F, 3G, 4D), which was orthogonal to the distribution of the MDs (Figure 3C). In contrast, when the decay was not incorporated, the PD distribution in the converged state depended on the initial synaptic weights (Figure 4C). Thus, our numerical simulation demonstrated that the important points obtained in the linear model were also qualitatively true in the non-linear model. The difference from the linear model was that some neurons change their PDs after the error converged to almost zero under the “feedback-only” rule (Figure 4E), which would be because there was no synaptic weight matrix that strictly satisfies zero error in the case of the non-linear model. The ever-changing PDs somehow contributed to increasing the sum of the squared muscle activity (Figure 4G). The “feedback-with-decay” rule was also advantageous for the suppression of muscle activity (Figure 4H), but the effect was not intense; indeed, even the “feedback-only” rule predicted roughly similar muscle PDs (Figure 4G) as the “feedback-with-decay” rule (Figure 4H). It is also notable that the formation of the PDs of muscles (Figure 4H) was achieved relatively earlier than that of the PD bias of the neurons (Figure 4D) and that the sum of the squared muscle activities were almost the same among all 4 simulations (Figure 4H), irrespective of the large differences in the norm of neural activities (Figure 4D). This may indicate that most of the neural activities cancel each other out at the muscle level to produce similar muscle activation patterns, which is possible because the dimension of neural activity far exceeds that of muscle activity. This may suggest that in such a redundant situation, minimization of neural effort and formation of the optimal PD bias may not be accomplished only by minimizing muscle effort via monitoring the metabolic energy consumed by the muscles.
Trial-dependent changes in the magnitude of error (A, B), the norm of the neural activity averaged across the 8 target conditions (C, D), the PDs of 10 randomly selected neurons (E, F), and the sum of the squared muscle activity averaged across the 8 target conditions (G, H), when the synaptic weight was modified with the “feedback-only” (A, C, E, G) or “feedback-with-decay” rules (B, D, F, H). (C, D) The distributions of the neuronal PDs at the 3000th and 40,000th trials for each simulation are shown as polar histograms. (G, H) The distributions of the muscle PDs at the 3000th and 40,000th trials for simulations represented by the cyan and red traces in C and D, respectively, are shown.
Interestingly, the predicted PD distribution (Figure 3G) was in agreement with that for M1 neurons in monkeys , irrespective of the fact that the corticospinal neurons in our model were only a subset of M1. The bimodal axis of the predicted PD distribution (θ = 121.1°) was within the 99.99% confidence interval of the axis (118.9–158.11°) estimated from the monkeys data . In addition, the resultant vector length (R = 0.162), which represents the strength of the bias, was also within the 99% confidence interval (0.147–0.40). Furthermore, our simulation also predicted the misalignment of muscle MD and PD, which is a key feature of the muscle recruitment pattern –, i.e., muscle PDs are located so that they compensate for the sparse part of the MD distribution in the torque space. Thus, even a mono-articular muscle's activation level depends not only on the joint torque but also on the torque of the joint that it does not span (Figure 3E) , , . Although this misalignment has been considered as a consequence of the minimization of the sum of the squared muscle activity –, the feedback-with-decay rule could predict it without an explicit calculation of the sum of the squared muscle activity.
Thus, error-based learning with slight forgetting seems to predict the non-uniform PD distribution of M1 neurons; however, what happens if forgetting is not slight? Theoretical considerations suggest that a relatively larger decay rate led to the system assigning much more weight to minimize the motor effort cost (Jm) than the error cost (Je). Figure S3 shows the results of simulations conducted with relatively large decay rates that were 5, 10, and 20 times larger than the original β. As expected, as the decay rate increased, the motor effort decreased (Figure S3B, S3C) more than necessary to keep the error almost zero, leading to a gradual increase of the converged error level (Figure S3A). Notably, the biased PD distribution gradually disappeared (Figure S3D), clearly indicating that the biased PD distribution emerges as a consequence of effective error-feedback with “slight” forgetting.
Initial phase of a reaching movement.
Next, we examined whether the weight decay rule can predict the characteristic bias of the PD distribution of M1 neurons observed during the reaction time period before reaching movements. Since the activity of M1 neurons just before reach initiation would reflect the activity necessary to produce the initial acceleration, we focused on the initial ballistic phase of a reaching movement. To mimic the initial phase, we modified the network by replacing the “desired torque” in Figure 3A with a “desired linear acceleration” of the fingertip in extrinsic space. In this case, the input layer can be considered as the premotor cortex, which represents the desired movement direction in extrinsic space , and the muscles can be viewed as linear accelerators of the fingertip (Figure 5A and 6A).
(A) MDVs for the 8 muscle groups. SFi, inner shoulder flexor (blue); SFo, outer shoulder flexor (light blue); SEi, inner shoulder extensor (orange); SEo, outer shoulder extensor (yellow); EF, elbow flexor (green); EE, elbow extensor (magenta); BiF, biarticular flexor (cyan); and BiE, biarticular extensor (red). (B) Distribution of the MDVs for 1000 neurons. (C) PDs plotted against MDs. (D) PDs of the 8 muscles after learning. (E) Distribution of the PDVs for 1000 neurons after learning. (F) Polar histogram of the neuronal PDs after learning.
(A) The arrows indicate the muscle MDVs in linear acceleration space. DP, posterior part of deltoid; DM, middle part of deltoid; DA, anterior part of deltoid; PM, pectoralis major; Cb, coracobrachialis; LD, latissimus dorsi; TMa, teres major; TMi, teres minor; Is, infraspinatus; Sb, subscapularis; Sp, supraspinatus; BS, short head of the biceps; BL, long head of the biceps; B, brachialis; Br, brachioradialis; TLa, lateral head of the triceps; TMe, medial head of the triceps; and TLo, long head of the triceps. The color gradations indicate the PD density at each point or the number of PDVs within the cone whose semi-angle is 20°. (B) Muscle MDVs viewed in the sagittal (x-y) plane. (C) PD density viewed from behind the body.
First, we simulated the reaching task with a two-joint system in a horizontal plane described by Scott et al. . The muscle MDVs in a linear acceleration space (i.e., extrinsic space; Figure 5A) was calculated on the basis of the initial limb configuration used in the previous study  and the muscle MDVs in the joint torque space (Figure 3B). The MDVs of the muscles and neurons were much more skewed toward the 1st and 3rd quadrants than the torque space (Figure 5A, 5B). We trained the network using the “feedback-only” rule and the “feedback-with-decay” rule, and found that the results were similar to those observed in the linear model. When the decay was incorporated, we found that the distribution of the PDs of the muscles and neurons converged to a much more skewed distribution toward the 2nd and 4th quadrants in linear acceleration space (Figure 5D–F) than that observed in the torque space (Figure 3E–G). These features were in agreement with data from monkeys that were recorded during the reaction time period before reaching . The bimodal axis of the predicted PD distribution (θ = 125.0°) was within the 95% confidence interval of the axis (109.6–127.4°) estimated from the monkeys' data . The resultant vector length (R = 0.507) was within the 99.5% confidence interval (0.19–0.51).
The model was further extended to 3D reaching movements. Figures 6A and 6B show the MDVs for these muscles in linear acceleration space. Although there are strong muscles that accelerate the fingertip toward the right (+z) and left (−z), backward and upward (−x and +y), and forward and downward (+x and −y) directions, there are a few weak muscles that accelerate the fingertip toward the forward and upward (+x and +y) or backward and downward (−x and −y) directions. If neurons randomly innervate these muscles, the neuronal MDVs will have a similar distribution as the muscle MDVs. The network trained with the “feedback-with-decay” rule demonstrated that the distribution of PDVs was enriched in the forward and upward directions (Figure 6A) and in the backward and downward directions (Figure 6C). This is in qualitative agreement with the PDV distribution of M1 neurons recorded in monkeys during the reaction-time period of 3D reaching movements . Although this previous study suggested that the PD distribution of the M1 neurons was supposedly associated with feeding behavior (i.e., the monkeys tended to reach in the forward and upward directions more frequently) , our scheme suggests that the PD distribution reflects the biomechanical properties of the musculoskeletal system. To examine whether the PD distribution is influenced by a spatial bias of the reaching direction during learning, we conducted simulations with four different probability conditions for target appearance. In all simulations, the PDs converged to the same distribution that was predicted by the biomechanical properties.
Trial-by-trial learning with slight forgetting
It has long been hypothesized that well-organized stereotypical movements are achieved by minimizing the cost (J), which includes the motor error and the variables related to the motor effort (e.g., jerk, torque change, sum of squared muscle activity, and variance of error) –, . It has also been shown that such an optimization model can predict the bias of the PDs of muscles and M1 neurons observed in primate and human experiments –, , . However, most of the previous optimization studies have examined only the resultant state obtained by the optimization process and largely ignored the underlying trial-by-trial learning process. Therefore, it is unclear how the cost function (J) is minimized on a trial-by-trial basis and how the PD biases are formed during optimization.
A small number of previous studies have proposed a mechanism for how the cost of the motor effort is minimized in the brain on a trial-by-trial basis. Kitazawa  proposed the “random work hypothesis” in which, in the presence of SDN, the system gradually approaches the optimal state only by successively feeding back trial-based error information. However, there is no guarantee of convergence with the optimal state, especially for highly redundant systems. Indeed, in our highly redundant neural network (n = 1000) with SDN, but without synaptic decay, the synaptic weights were captured at a suboptimal level (Figure S2B). Even when the system was small (n = 2), consistent convergence did not occur (Figure S2D).
In contrast, recent studies have suggested that forgetting might be useful to minimize the motor effort –. Emken et al.  demonstrated that trial-by-trial error-feedback learning with forgetting is mathematically equivalent to the minimization of error and effort by formulating the force adaptation task during gait, although their formulation was limited to the case of a single lumped muscle system (i.e., a non-redundant actuator system). An important prediction from this scheme is that the motor system continuously attempts to decrease the level of muscle activation when the movement error is small –. Such a decrease in muscle activity was actually observed when human subjects learned to perform movements in a novel force field environment; initially, muscle activity was increased to reduce the movement error produced by the force perturbation, but once the error decreased to a small value, the muscle activity was gradually decreased , . Burdet et al. and Franklin et al. , ,  showed that a simple learning rule that incorporates the decay of muscle activity can precisely predict such a specific pattern of change in individual muscle activity during adaptation to various force fields.
The present study further applied the “feedback-with-decay” algorithm to the sensorimotor transformation network, which includes M1 neurons. We initially used a linear neural network and theoretically derived the necessary conditions for convergence on the optimal state. Importantly, these conditions seem to be satisfied in the actual brain. First, the decay rate is known to be much smaller than the learning rate ; second, a very large number of M1 neurons actually participate in a single motor task; and third, multiple targets are practiced in real life. Furthermore, using a more realistic non-linear network model, we also confirmed consistent convergence that was irrespective of the initial synaptic weight and spatial bias of the movement directions during practice. These results indicate that weight decay is a more promising process than SDN for a motor system to resolve the redundant actuator problem.
The “feedback-with-decay” rule can be considered as biologically plausible in that it does not need to explicitly calculate the sum of the squared neural activity (total effort cost) by gathering activity information from a vast number of neurons. Since weight decay in each synapse could occur independently of other synapses, a global summation across all neurons would not be needed. Using a framework of weight decay, it would be possible for the CNS to minimize even the motor effort cost during movement of the whole body. One may argue that since we perceive tiredness, the brain must compute the total energetic cost (or motor effort cost); however, to the best of our knowledge, individual neurons that encode the total energetic cost have not been discovered. It is rather likely that such a physical quantity is represented by a large number of distributed neurons in the brain and this distributed information may be perceived as tiredness. Since it is unclear whether the total energetic cost could be readout from such distributed information, decay would be a more promising mechanism for minimizing motor efforts. Furthermore, our simulation results indicate that the formation of an optimal PD distribution pattern for M1 neurons was not necessarily accompanied with the realization of a nearly optimal muscle activation pattern (compare Figure 4D with Figure 4H), suggesting that optimization of motor effort at the neural level could not be accomplished by minimization of muscle effort by monitoring the metabolic energy consumption in the muscles.
Although we referred to the “feedback-with-decay” algorithm as biologically plausible, it should be noted that our simulation algorithm is not fully biologically plausible because it still depends on an artificial calculation (i.e., error back-propagation). Although it is well established that error information is available to the cerebellum –, it is unclear how such information is used to modify the activity of individual M1 neurons in the next trial; that is, it is unclear how gradients of error are calculated. Determining a biologically plausible model that does not depend on an artificial calculation remains a major challenge in the field of motor control and learning.
Stereotypical activity patterns of muscles and M1 neurons
The important point of the present study is that we theoretically proved that the “feedback-with-decay” rule consistently leads the PDs of M1 neurons to converge at a distribution that is orthogonal to the MD distribution. Although Guigon et al.  reproduced the skewed PD distribution of M1 neurons for 2D movements, they did not theoretically describe the inverse relationship between the PD and MD distributions, which is probably because they adopted only complex non-linear models and needed to rely only on numerical simulations for solving the optimization problem. In contrast, the present study, which is based on the theoretical background of the linear model, further numerically showed that the inverse relationship also persisted in the non-linear models too.
Importantly, the non-linear model combined with the realistic musculoskeletal parameters can reproduce the non-uniform PD distribution of M1 neurons observed during various motor tasks. The origin of the PD bias has been a hotly debated topic in neurophysiology , . Although it has been pointed out that the PD bias observed in 2D postural and reaching tasks emerges as a consequence of the neural compensation of the biomechanical properties , , the PD bias observed in 3D reaching has been considered to be derived from use-dependent plasticity (i.e., the frequent reaching toward the biased directions accompanying feeding behavior) , . One of the reasons for this conflict between the two groups is that they adopted different movement tasks, i.e., one group insisted that 2D tasks with a robotic exoskeleton are advantageous for the comparison of neural activity with accurately measured mechanical variables such as joint motion and joint torque , while the other group insisted that unconstraint 3D movements are necessary to reveal the nature of neural activity . The present study is the first to try to resolve this issue. By using a realistic 3D biomechanical model, we found that the PD bias observed in 3D reaching movements by monkeys ,  corresponds to the direction toward which few muscles contribute to the acceleration of the fingertip; the PDs tend to be biased toward the direction according to the weight decay hypothesis. It was also demonstrated that the feedback-with-decay rule always leads the PDs to be biased toward the same direction, irrespective of the spatial bias of the reaching directions during practice. Thus, the weight decay hypothesis suggests that the PD distribution reflects the inverse of the biomechanical properties of the musculoskeletal system (i.e., muscle anatomy and limb configuration). Although it remains to be clarified whether weight decay is actually used for optimization in the brain, the present study provides a unifying framework to understand stereotypical activation patterns of muscles and M1 neurons during 2D and 3D reaching movements.
Another interesting finding is that even the “feedback-only” rule predicts the skewed PD distribution of M1 neurons approximately if the two following conditions are satisfied: a large number of neurons participate in the task (condition #2) and the initial synaptic weight is considerably smaller than the pseudo-inverse matrix (MT(MMT)−1) (condition #4). This finding indicates that the PD bias itself is not direct evidence of the minimization of effort, as has been thought previously , . Nevertheless, we believe that the fact that the optimal PD bias was consistently observed in various motor tasks may reflect the consequence of the minimization of effort because there is no assurance that condition #4 is always satisfied. Thus, theoretically assessing the effects of the error feedback and decay separately, the present study convincingly showed that the decay is essential to reproduce consistently the PD bias observed in the experiments. To verify whether the motor effort is actually minimized and whether weight decay is used during minimization, future studies need to examine the changes in the activity of a large number of neurons for a long period of time.
Decay must be slight
According to our mathematical consideration, the weight decay rate must be substantially lower than the learning rate (see Supporting Text S1). This necessary condition is biologically very plausible because the strength modulation of the synaptic connections, which is mediated by long-term potentiation and/or long-term depression, is known to decay slowly . It was also demonstrated that, when the decay rate was relatively large, the bias in the PD distribution was not formed and considerable error remained (Figure S3). This clearly indicates that the slightness of the decay is necessary for the formation of the non-uniform PD distribution of M1 neurons.
The present scheme also implies that motor learning has two different time scales: a fast process associated with error correction and a slow process associated with optimizing efficiency through weight decay (Figure 2B, 2D). Due to the coexistence of both time scales, the neural network can assume various unstable states even after motor performance appears to have been achieved ; however, after adequate training is conducted to completely learn the task by the slow process, the network should converge to a more stable unique state . The two time scales can be also observed in muscle activity during motor adaptation. While muscle activity rapidly increased in response to the initial large errors caused by a novel perturbation, it was slowly reduced once the error fell below a threshold , , , . The present study suggests that the slow reduction of muscle activity is the result of the optimization process with weight decay. This slow optimization may explain why prolonged training, even after the performance level appears to have reached a plateau, is important .
Limitation of the models and future direction
Due to its simplicity, our model provided clear insights into the role of weight decay on optimization; however, of course, it has several limitations. First, the model considered only corticospinal neurons, although M1 also includes inhibitory interneurons. However, it is noteworthy that our model could predict the PD distribution of M1 neurons recorded from non-human primates, suggesting that most of the neurons recorded in previous experiments were corticospinal neurons. Indeed, considering the large size of corticospinal pyramidal neurons, it is likely that the chance of recording these neurons is relatively high because stable isolation over an extended period of time is required in such experiments . To confirm this possibility, future studies need to examine the PD distribution while distinguishing between interneurons and pyramidal neurons using recently described techniques , .
Second, a uniform distribution was assumed for the neuron-muscle connectivity (Z). As there are no available data for Z, assuming a uniform distribution is reasonable as a first attempt. This assumption results in the distribution of neuron MDs having the same bias as that of muscle MDs. Interestingly, irrespective of such a simple assumption, the model accounted for the PD distribution in various tasks. Since this connectivity depends on the recording site, to resolve this issue, it is necessary to examine the innervation weights of each neuron to the muscles by using a spike triggered average technique as well as the PD of each neuron.
Thirdly, the model only considered static tasks (i.e., isometric force production) and an instantaneous ballistic task (i.e., the initial phase of the reaching movement). Such a single time point model is unrealistic for reaching movements in that it ignores the change of limb posture, posture-dependent changes in the muscle moment arms, multi-joint dynamics during motion, and the deceleration phase. This limitation prevents us from predicting the essential features of movement such as trajectory formation and online trajectory correction , , ,  that arise from the optimization of a series of motor commands by taking into account the multi-joint dynamics that change according to the limb configuration , . However, it is not that our model completely ignores multi-joint dynamics; indeed, we incorporated instantaneous multi-joint dynamics at the initial limb configuration by dealing with the linear acceleration of the fingertip rather than the muscle torque (see Methods). In addition, considering that the CNS does not plan an entire trajectory of movement at the time of movement onset , , , it is likely that the activity of corticospinal neurons just before reach initiation would be largely for the production of the initial acceleration. Thus, the comparison between the neural activity in our model and that recorded during the reaction time period is justified to some extent. However, of course, the present model ignores the effect of events occurring after the initial ballistic phase on the modification of the synaptic weight for the next movement. Finally, the single time point model cannot predict the change of the movement representation in the motor areas that was observed during the course of sensorimotor transformations –. In the future, we need to extend the decay theory to the more dynamic problem of controlling eye or limb movements, including temporal trajectories through motor planning and execution phases , , –. This dynamic task presents the next major challenge for understanding the neural control of movement.
Linear neural network model
First, we used a linear neural network to transform the desired torque (input layer) into the actual torque (output layer) through an intermediate layer that consisted of 1000 neurons (n = 1000) (Figure 1B). Each neuron in the intermediate layer received a desired torque vector (τ ∈ ℜ2) from the input layer with a synaptic weight (Wi ∈ ℜ2) that could be modified with learning. The activation level (ri) was linearly dependent on the input torque vector (i.e., ri = WiTτ), indicating that it obeys cosine tuning . The activation vector for all of the neurons (r ∈ ℜn) is expressed as r = Wτ, where W ∈ ℜn×2 is the synaptic weight matrix for all neurons, expressed as:The output vector for each neuron (Ti ∈ ℜ2) is determined by its activation level (ri) multiplied by its mechanical pulling direction vector (MDV) (Mi ∈ ℜ2): Ti = Mi ri. The total output of the network (T ∈ ℜ2) is expressed as the vector sum of the output of all neurons: T = Mr, where M ∈ ℜ2×n is the matrix of MDVs for all neurons, expressed as:The distribution of the directions of the MDVs was biased toward the first and third quadrants (dots for M in Figure 1C). M for the linear model was calculated as RMUniform8Z, where R = [cos20° sin20°; sin20° cos20°], MUniform8 consists of 8 unit vectors that are uniformly distributed in the torque space (e.g., [1 0], , [0 1], etc.), and Z was the same as the one defined in the non-linear model (see below).
The network was trained to produce the appropriate output torque by randomly presenting 8 target torques (Figure 1A) over 40,000 trials. An error back-propagation algorithm  was used to successively modify the synaptic weight (W), while the MDV matrix (M) was kept constant. In order to examine the effect of weight decay, we used 3 learning procedures: 1) feedback-only, 2) feedback-with-noise, and 3) feedback-with-decay rules.
1) Feedback-only rule.
In the feedback-only rule, the synaptic weight Wij was modified by:(6)where α is the learning rate (α = 20) and Je is the error cost, as calculated by the error vector (e = T−τ) between the output torque and desired torque: Je = 1/2eTe.
2) Feedback-with-noise rule.
The procedures in the feedback-with-noise rule were the same as in the feedback-only rule, except that SDN was added to the actuator activity and synaptic modification. The activation of each actuator was determined by:(7)where represents white noise with a zero mean and a standard deviation of , which increased with the magnitude of as follows:(8)The coefficient of variation k was set at 0.25 in the simulation shown in Figure S2. Similarly, the synaptic weight was modified to:(9)where represents white noise with a zero mean and standard deviation . When k = 0.1, the result was the same as that shown in Figure S2, i.e., the synaptic weight converged to a suboptimal solution.
3) Feedback-with-decay rule.
In the feedback-with-decay rule, the synaptic weight Wij was modified by:(10)The second term indicates that the change in synaptic weight due to synaptic memory decay in each step is proportional to the current synaptic weight Wij. This rule is one of the simplest regularization techniques used in machine learning. The decay rate β was set to 1.0×10−4, much smaller than the learning rate (α = 20). We intended to simulate the formation of the PDs of neurons and muscles, which are possibly related to the construction of the synergies and may take a long period of time. Therefore, we used the slowest type of decay time constant (20 days) observed in neurophysiological studies , which corresponds to the time constant (τβ = 1/β = 10000 trials), assuming that approximately 500 trials are performed in a day. Thus, the current value of β (1.0×10−4) is much smaller than that of the slow process (4.0×10−3) estimated by Smith et al. , which is, at most, in the order of hours.
Initial synaptic weights
The initial synaptic weights were set to random values as follows:(11)where nij(σ) represents white noise with a zero mean and standard deviation σ. Five different matrices (W1init, W2init,…, W5init) were generated using the following 4 standard deviations: σ = 0.5 (cyan), 1.5 (green), 2.0 (orange), or 2.5 (red), respectively. These 4 matrices were used for the simulation of the 2 learning rules described above (Figure 2C, 2D) and the feedback-with-noise rule (see Supporting Figure S2B). The MDV matrix M was also the same for all of the simulations shown in those figures. Therefore, the 3 simulations represented by the same color in those figures were in exactly the same condition at the start of the simulation.
Non-linear neural network model with a muscle layer
Intrinsic torque space model (2D).
To confirm the effectiveness of weight decay in a more realistic model, we also considered a neural network model with a muscle layer whose activity (a) was constrained to be positive (i.e., the muscles did not push) (Figure 3A); the muscle layer consisted of the 8 muscles at the shoulder and elbow joints (Figure 3B). We assumed that the neurons in the model directly activate the muscles, i.e., we assumed that the neural layer consisted of only corticospinal neurons. The neurons received the desired movement parameters from the input layer and their firing rate obeyed cosine tuning . On the basis of anatomical and electrophysiological findings, we assumed that each neuron innervates multiple muscles –. The innervation weights for each neuron to the 8 muscles [Zi = (Z1i Z2i… Z8i)T] were established so that Zis (i = 1–1000) were uniformly distributed on the surface of a sphere in 8-dimensional space, the radius of which was 0.002 (2/n). The activation of each muscle (ai) was expressed as the sum of the effects from all of the neurons:(12)where the operator ⌊ ⌋ indicates that ⌊x⌋ = x for x>0 and ⌊x⌋ = 0 for x≤0. The total output of the network (T) is expressed as the vector sum of the output from all of the muscles: T = MIna, where a = (a1 a2…a8)T is the activation vector for all of the muscles and MIn = (M1In M2In…M8In) ∈ ℜ2×8 is a matrix that consists of the MDVs for all of the muscles.
Using realistic muscle data, we modeled a 2D upper limb that had 2 degrees of freedom (DOF; shoulder and elbow joints) with 26 muscle elements (Table S2). For the physiological cross-sectional areas (PCSA) and pennation angles (Table S2), we used published data from Macaca mulatta . For the moment arms of the muscles, we extracted data from a human musculoskeletal model  in which the shoulder was abducted at 90° and horizontally flexed at 30°, and the elbow was flexed at 90°. The MDV for each muscle in intrinsic space was calculated as:(13)where Si is the PCSA, αi is the pennation angle, and (di,1di,2)T are the moment arms for the shoulder and elbow joints. Assuming that muscles with similar mechanical properties should behave in a similar fashion, we grouped the 26 muscle elements into 8 groups. Thus, the MDV matrix for the 8 muscle groups in intrinsic space is obtained as MIn ∈ ℜ2×8. We defined the effect of the activation of each neuron on the output torque (MInZi) as the “MDV of neuron i.” The matrix of MDVs for all of the neurons was defined as MInZ, where Z = (Z1Z2…Zn) ∈ ℜ8×n. To examine the effects of the initial conditions, the simulation was conducted 4 times with different sets of initial synaptic weights [σ = 0.5 (cyan), 2.0 (green), 4.0 (orange), or 8.0 (red) in Eq. (11)].
Extrinsic space model (2D).
The network model can also be applied to the task of producing the linear acceleration of the fingertip (i.e., the initial phase of the reaching movement) by replacing the torque in Figure 3A with a linear acceleration of the fingertip in extrinsic space. In this case, the input layer can be considered as the premotor cortex that represents the desired movement direction in extrinsic space  and the muscles can be viewed as linear accelerators of the fingertip (see Figure 5A and 6A). The MDV for each muscle in linear acceleration space () was calculated as:(14)where J(θ) ∈ ℜ2×2 is the Jacobian matrix, I(θ) ∈ ℜ2×2 is the system inertia matrix of the two-joint system, and θ ∈ ℜ2 is a joint angle vector that consists of the shoulder and elbow angles. To calculate the Jacobian and inertia matrices, we used morphological data from M. mulatta (Table S1). We used the MDV matrix for 8 muscles in extrinsic space expressed by:(15)as M in Figure 3A for the simulation of 2D reaching movements (Figure 5). To examine the effects of the initial conditions, the simulation was conducted 4 times with different sets of initial synaptic weights [σ = 0.5 (cyan), 2.0 (green), 4.0 (orange), or 8.0 (red) in Eq. (11)].
Extrinsic space model (3D).
We further extended the model to 3D reaching movements. We modeled a 3D upper limb with 4 DOF; (3 DOF for the shoulder and 1 DOF for the elbow) with 26 muscle elements (Table S3). In order to match the initial limb posture in our simulation with that of the 3D reaching movements used in previous primate studies , , we set the shoulder flexion angle at 30°, the internally rotated shoulder angle at 12°, and the elbow flexion angle at 80°. In this posture, the fingertip position was at shoulder level in the midsagittal plane (Figure 6). Moment arms in this posture were extracted from a human musculoskeletal model  and are listed in Table S3. The MDV for each muscle in intrinsic space was calculated as:(16)where Si is the PCSA, αi is the pennation angle, and (di,1 di,2 di,3 di,4)T are the moment arms for the 3 DOF at the shoulder (xU, yU, and zU in Figure S4A) and 1 DOF at the elbow (zF). Assuming that muscles with similar mechanical properties should behave in a similar fashion, we grouped the 26 muscle elements into 16 groups. Therefore, the muscle MDV matrix in intrinsic space is a 4×16 matrix, as follows:(17)The Jacobian matrix J(θ) ∈ ℜ3×4 and the system inertia matrix I(θ)∈ℜ4×4 for the 3D limb model were calculated using previously described methods . Note that, in the present study, we used a segment-fixed coordinate (Figure 2B in ) as the generalized coordinate, although the joint coordinate (Figure 2C in ) was used in the previous study. The linear acceleration of the fingertip produced by each muscle () was calculated as:(18)We used the matrix of MDVs for 16 muscles in extrinsic space expressed by:(19)as M for the simulation of 3D reaching movements.
For the 3D simulation, 14 equally spaced targets (Figure S4B) were randomly presented over 100,000 trials. The learning rate (α) and forgetting rate (β) were set to 500 and 1.0×10−4, respectively. To examine the effects of the initial conditions, the simulation was conducted 5 times with different sets of initial synaptic weights [σ = 0.9, 1.8, 2.7, 3.6, or 4.5 in Eq. (11)]. We also examined the effect of the spatial bias of reaching movements during learning (i.e., non-uniform probability of target appearance) using the following 4 conditions:
- the probability of appearance was equal for all 14 targets;
- the probability for targets #1 and #3 was 8/28 (1/28 for the other targets);
- the probability for targets #2 and #4 was 8/28 (1/28 for the other targets);
- the probability for targets #5 and #6 was 8/28 (1/28 for the other targets).
In total, we conducted 20 (5 initial weights×4 probability conditions) simulations.
Analysis of the PD distribution
To examine the significance of the bimodal distribution obtained from the simulation, we performed the Rayleigh test for uniformity against a bimodal alternative (P<0.05) using a circular statistics toolbox . To quantify the characteristics of the PD distribution, 2 parameters were calculated for each PD distribution. We multiplied the PDs by 2, transformed them to unit vectors in the 2D plane using , and took a vector summation across all PDs to obtain the resultant vector. The direction (θ) and length (R) of the resultant vector represents the direction and strength of the PD bias, respectively. To compare them with experimental data, we extracted the raw PD data from the literature (178 neurons for a 2D isometric task from Figure 9A in  and 141 neurons for a 2D reaching task from Figure 3B in ) and estimated the confidence intervals for both parameters using a bootstrapping procedure with 10000 times resampling.
Comparison between the feedback-only and feedback-with-decay rules using a simple redundant problem. To graphically illustrate the behavior of synaptic weight in the two modification rules, we simulated a simple redundant problem to find the set of w1 and w2 that fulfills the equation: w2−w1 = 1. The color gradations indicate the error cost as a function of the synaptic weights w1 and w2. The white dashed line indicates the minimum at which the error is zero. The circles indicate the contours of the sum of the squared values (i.e., w12+w22). Simulations were conducted with w1 = 0 and w2 = −2 as the initial values. In the feedback-only rule (A), modification ceased after the error reached zero, whereas in the feedback-with-decay rule (B), modification continued after the error reached zero and the sum of the squared values had converged with the minimum value.
Simulation results by the feedback-with-noise rule. (A–C) Simulation results for the neural network model shown in Figure 1, using the feedback-with-noise rule. Trial-dependent changes in the magnitude of error (A), the sum of the squared neural activity (B) averaged across the 8 target conditions, and the PDs of 10 randomly selected neurons (C). (D) Simulations of a simple redundant system to find the set of w1 and w2 that fulfills the equation: w2−w1 = 1 using the feedback-with-noise rule.
Simulation results for the torque exertion task with relatively large weight decay rates. (A–C) Trial-dependent changes in the magnitude of the error (A), the norm of the neural activity averaged across the 8 target conditions (B), and the sum of the squared muscle activity averaged across the 8 target conditions (C), when the synaptic weight was modified by error feedback with relatively large decay rates that were 5, 10, and 20 times larger than the original β (Figure 4). The 4 colored lines indicate the changes when various initial synaptic weight conditions were used. (D) Distribution of the synaptic weight (i.e., PDVs) for the 1000 neurons after learning.
Model and motor task for 3D reaching movements. (A) Segment-fixed coordinate systems for the upper arm segment (xU, yU, zU) and forearm-and-hand segment (xF, yF, zF). (B) The 14 equally spaced targets used for the simulation of 3D reaching movements.
Parameters for the segments. p is the position of the center of mass measured from the proximal joint, represented as a % of the segment length. kx, ky, and kz are the radii of gyration about the x, y, and z axes of the segment, respectively, represented as a % of the segment length. These data are for the Macaca Mulatta (6 kg) , except that ky was taken from human male data .
Parameters for the muscles in the horizontal plane in the 2-DOF upper extremity model. S is the physiological cross-sectional area. α is the pennation angle. ds and de are the moment arms for shoulder flexion(+)/extension(−) and elbow flexion(+)/extension(−), respectively.
Moment arms for the muscles in the 4-DOF model in 3D space. d1, d2, and d3 are the shoulder joint moment arms for the xU, yU, and zU axes, respectively. d4 is the elbow joint moment arm for the zF axis.
Mathematical derivations. This document provides 1) mathematical derivation of the optimal synaptic weights and 2) mathematical proof of convergence for the linear neural network model of sensorimotor transformation.
Analyzed the data: MH. Contributed reagents/materials/analysis tools: MH. Wrote the paper: MH DN. Conceived and designed the simulations: MH. Performed the simulations: MH. Mathematically proved the convergence of the equations: MH DN.
- 1. Bernstein NI (1967) The Coordination and Regulation of Movements. Oxford: Pergamon Press.
- 2. Herter TM, Kurtzer I, Cabel DW, Haunts KA, Scott SH (2007) Characterization of torque-related activity in primary motor cortex during a multijoint postural task. J Neurophysiol 97: 2887–2899.
- 3. Scott SH, Gribble PL, Graham KM, Cabel DW (2001) Dissociation between hand motion and population vectors from neural activity in motor cortex. Nature 413: 161–165.
- 4. Naselaris T, Merchant H, Amirikian B, Georgopoulos AP (2006) Large-scale organization of preferred directions in the motor cortex. I. Motor cortical hyperacuity for forward reaching. J Neurophysiol 96: 3231–3236.
- 5. Schwartz AB, Kettner RE, Georgopoulos AP (1988) Primate motor cortex and free arm movements to visual targets in 3-dimensional space. 1. Relations between single cell discharge and direction of movement. J Neurosci 8: 2913–2927.
- 6. Pruszynski JA, Kurtzer I, Nashed JY, Omrani M, Brouwer B, et al. (2011) Primary motor cortex underlies multi-joint integration for fast feedback control. Nature 478: 387–390.
- 7. Hoffman DS, Strick PL (1999) Step-tracking movements of the wrist. IV. Muscle activity associated with movements in different directions. J Neurophysiol 81: 319–333.
- 8. Nozaki D, Nakazawa K, Akai M (2005) Muscle activity determined by cosine tuning with a nontrivial preferred direction during isometric force exertion by lower limb. J Neurophysiol 93: 2614–2624.
- 9. Kurtzer I, Pruszynski JA, Herter TM, Scott SH (2006) Primate upper limb muscles exhibit activity patterns that differ from their anatomical action during a postural task. J Neurophysiol 95: 493–504.
- 10. Fagg AH, Shah A, Barto AG (2002) A computational model of muscle recruitment for wrist movements. Journal of Neurophysiology 88: 3348–3358.
- 11. van Bolhuis BM, Gielen C (1999) A comparison of models explaining muscle activation patterns for isometric contractions. Biol Cybern 81: 249–261.
- 12. Hogan N (1984) An organizing principle for a class of voluntary movements. J Neurosci 4: 2745–2754.
- 13. Uno Y, Kawato M, Suzuki R (1989) Formation and control of optimal trajectory in human multijoint arm movement - minimum torque-change model. Biol Cybern 61: 89–101.
- 14. Shadmehr R, Krakauer JW (2008) A computational neuroanatomy for motor control. Exp Brain Res 185: 359–381.
- 15. Todorov E, Jordan MI (2002) Optimal feedback control as a theory of motor coordination. Nat Neurosci 5: 1226–1235.
- 16. Ito M (2000) Mechanisms of motor learning in the cerebellum. Brain Res 886: 237–245.
- 17. Kawato M, Gomi H (1992) A computational model of 4 regions of the cerebellum based on feedback-error learning. Biol Cybern 68: 95–103.
- 18. Kitazawa S, Kimura T, Yin PB (1998) Cerebellar complex spikes encode both destinations and errors in arm movements. Nature 392: 494–497.
- 19. Schweighofer N, Arbib MA, Kawato M (1998) Role of the cerebellum in reaching movements in humans. I. Distributed inverse dynamics control. Eur J Neurosci 10: 86–94.
- 20. Diedrichsen J, Hashambhoy Y, Rane T, Shadmehr R (2005) Neural correlates of reach errors. J Neurosci 25: 9919–9931.
- 21. Roitman AV, Pasalar S, Ebner TJ (2009) Single trial coupling of Purkinje cell activity to speed and error signals during circular manual tracking. Exp Brain Res 192: 241–251.
- 22. Engelbrecht SE (2001) Minimum principles in motor control. J Math Psychol 45: 497–542.
- 23. Harris CM, Wolpert DM (1998) Signal-dependent noise determines motor planning. Nature 394: 780–784.
- 24. Haruno M, Wolpert DM (2005) Optimal control of redundant muscles in step-tracking wrist movements. J Neurophysiol 94: 4244–4255.
- 25. Wolpert DM (2007) Probabilistic models in human sensorimotor control. Hum Movement Sci 26: 511–524.
- 26. Kitazawa S (2002) Optimization of goal-directed movements in the cerebellum: a random walk hypothesis. Neurosci Res 43: 289–294.
- 27. Guigon E, Baraduc P, Desmurget M (2007) Coding of movement- and force-related information in primate primary motor cortex: a computational approach. Eur J Neurosci 26: 250–260.
- 28. Todorov E (2002) Cosine tuning minimizes motor errors. Neural Comput 14: 1233–1260.
- 29. Burdet E, Franklin DW, Osu R, Tee KP, Kawato M, et al. (2004) How are internal models of unstable tasks formed? Proceedings of the 26th Annual International Conference of the IEEE EMBS; 1–5 September 2004; San Francisco, CA, USA. pp. 4491–4494.
- 30. Reinkensmeyer D, Aoyagi D, Emken J, Galvez J, Ichinose W, et al. (2004) Robotic Gait Training: Toward More Natural Movements and Optimal Training Algorithms. Proceedings of the 26th Annual International Conference of the IEEE EMBS; 1–5 September 2004; San Francisco, CA, USA. pp. 4818–4821.
- 31. Reinkensmeyer DJ, Akoner OM, Ferris DP, Gordon KE (2009) Slacking by the Human Motor System: Computational Models and Implications for Robotic Orthoses. Proceedings of the 31st Annual International Conference of the IEEE EMBS; 2–6 September 2009; Minneapolis, Minnesota, USA. pp. 2129–2132.
- 32. Emken JL, Benitez R, Sideris A, Bobrow JE, Reinkensmeyer DJ (2007) Motor adaptation as a greedy optimization of error and effort. J Neurophysiol 97: 3997–4006.
- 33. Emken JL, Benitez R, Reinkensmeyer DJ (2007) Human-robot cooperative movement training: Learning a novel sensory motor transformation during walking with robotic assistance-as-needed. J Neuroeng Rehab 4: 8.
- 34. Franklin DW, Burdet E, Tee KP, Osu R, Chew CM, et al. (2008) CNS Learns Stable, Accurate, and Efficient Movements Using a Simple Algorithm. J Neurosci 28: 11165–11173.
- 35. Tee KP, Franklin DW, Kawato M, Milner TE, Burdet E (2010) Concurrent adaptation of force and impedance in the redundant muscle system. Biol Cybern 102: 31–44.
- 36. Reed R (1993) Pruning algorithms - A survey. IEEE Trans Neural Networks 4: 740–747.
- 37. Le Cun Y, Denker JS, Solla SA (1990) Optimal brain damage. In: Touretzky DS, editor. Advances in neural information processing systems. San Mateo: Mogan Kaufmann. pp. 598–605.
- 38. Krogh A, Hertz JA (1992) A simple weight decay can improve generalization. In: Moody JE, Hanson SJ, Lippmann RP, editors. Advances in neural information processing systems. San Mateo: Mogan Kaufmann. pp. 950–957.
- 39. Hinton GE (1987) Learning translation invariant recognition in a massively parallel networks. In: Goos G, Hartmanis J, editors. PARLE: Parallel Architectures and Languages Europe Lecture Notes in Computer Science. Berlin Springer. pp. 1–13.
- 40. Ganesh G, Albu-Schaeffer A, Haruno M, Kawato M, Burdet E (2010) Biomimetic motor behavior for simultaneous adaptation of force, impedance and trajectory in interaction tasks. Proceedings of the IEEE International Conference on Robotics and Automation; 3–8 May 2010; Anchorage, Alaska, USA. pp. 2705–2711.
- 41. Yang C, Ganesh G, Haddadin S, Parusel S, Albu-Schaeffer A, et al. (2011) Human-Like Adaptation of Force and Impedance in Stable and Unstable Interactions. IEEE T Robot 27: 918–930.
- 42. Rumelhart DE, Hinton GE, Williams RJ (1986) Learning representations by back-propagating errors. Nature 323: 533–536.
- 43. Rokni U, Richardson AG, Bizzi E, Seung HS (2007) Motor learning with unstable neural representations. Neuron 54: 653–666.
- 44. Georgopoulos AP, Kalaska JF, Caminiti R, Massey JT (1982) On the relations between the direction of two-dimensional arm movements and cell discharge in primate motor cortex. J Neurosci 2: 1527–1537.
- 45. Shinoda Y, Yokota JI, Futami T (1981) Divergent projection of individual corticospinal axons to moto-neurons of multiple muscles in the monkey. Neurosci Lett 23: 7–12.
- 46. Fetz EE, Cheney PD (1980) Postspike facilitation of forelimb muscle-activity by primate corticomotoneuronal cells. J Neurophysiol 44: 751–772.
- 47. Griffin DM, Hudson HM, Belhaj-Saif A, McKiernan BJ, Cheney PD (2008) Do corticomotoneuronal cells predict target muscle EMG activity? J Neurophysiol 99: 1169–1186.
- 48. McKiernan BJ, Marcario JK, Karrer JH, Cheney PD (1998) Corticomotoneuronal postspike effects in shoulder, elbow, wrist, digit, and intrinsic hand muscles during a reach and prehension task. J Neurophysiol 80: 1961–1980.
- 49. Rathelot JA, Strick PL (2009) Subdivisions of primary motor cortex based on cortico-motoneuronal cells. Proc Natl Acad Sci U S A 106: 918–923.
- 50. Griffin DM, Hudson HM, Belhaj-Saif A, Cheney PD (2009) Stability of Output Effects from Motor Cortex to Forelimb Muscles in Primates. J Neurosci 29: 1915–1927.
- 51. Davidson AG, Chan V, O'Dell R, Schieber MH (2007) Rapid changes in throughput from single motor cortex neurons to muscle activity. Science 318: 1934–1937.
- 52. Cheng EJ, Scott SH (2000) Morphometry of Macaca mulatta forelimb. I. Shoulder and elbow muscles and segment inertial parameters. J Morphol 245: 206–224.
- 53. Nakamura Y, Yamane K, Fujita Y, Suzuki I (2005) Somatosensory computation for man-machine interface from motion-capture data and musculoskeletal human model. IEEE Trans Robot 21: 58–66.
- 54. Nozaki D, Nakazawa K, Akai M (2005) Uncertainty of knee joint, muscle activity during knee joint torque exertion: the significance of controlling adjacent joint torque. J Appl Physiol 99: 1093–1103.
- 55. Kakei S, Hoffman DS, Strick PL (2001) Direction of action is represented in the ventral premotor cortex. Nat Neurosci 4: 1020–1025.
- 56. Thoroughman KA, Shadmehr R (1999) Electromyographic correlates of learning an internal model of reaching movements. J Neurosci 19: 8573–8588.
- 57. Franklin DW, Osu R, Burdet E, Kawato M, Milner TE (2003) Adaptation to stable and unstable dynamics achieved by combined impedance control and inverse dynamics model. J Neurophysiol 90: 3270–3282.
- 58. Abraham WC (2003) How long will long-term potentiation last? Philos Trans R Soc Lond Ser B-Biol Sci 358: 735–744.
- 59. Kurtzer IL, Herter TM (2007) Contrasting interpretations of the nonuniform distribution of preferred directions within primary motor cortex. J Neurophysiol 97: 4390.
- 60. Georgopoulos AP, Naselaris T, Merchant H, Amirikian B (2007) Contrasting interpretations of the nonuniform distribution of preferred directions within primary motor cortex - Reply to Kurtzer and Herter. J Neurophysiol 97: 4391–4392.
- 61. Kurtzer I, Herter TM, Scott SH (2006) Nonuniform distribution of reach-related and torque-related activity in upper arm muscles and neurons of primary motor cortex. J Neurophysiol 96: 3220–3230.
- 62. Chestek CA, Batista AP, Santhanam G, Yu BM, Afshar A, et al. (2007) Single-neuron stability during repeated reaching in macaque premotor cortex. J Neurosci 27: 10742–10750.
- 63. Osu R, Franklin DW, Kato H, Gomi H, Domen K, et al. (2002) Short- and long-term changes in joint co-contraction associated with motor learning as revealed from surface EMG. J Neurophysiol 88: 991–1004.
- 64. Joiner WM, Smith MA (2008) Long-Term Retention Explained by a Model of Short-Term Learning in the Adaptive Control of Reaching. J Neurophysiol 100: 2948–2955.
- 65. Kalaska JF, Cohen DAD, Hyde ML, Prudhomme M (1989) A comparison of movement direction-related versus load direction-related activity in primate motor cortex, using a two-dimensional reaching task. J Neurosci 9: 2080–2102.
- 66. Kaufman MT, Churchland MM, Santhanam G, Yu BM, Afshar A, et al. (2010) Roles of Monkey Premotor Neuron Classes in Movement Preparation and Execution. J Neurophysiol 104: 799–810.
- 67. Bartho P, Hirase H, Monconduit L, Zugaro M, Harris KD, et al. (2004) Characterization of neocortical principal cells and Interneurons by network interactions and extracellular features. J Neurophysiol 92: 600–608.
- 68. Zajac FE, Gordon ME (1989) Determining muscles force and action in multi-articular movement. Exerc Sport Sci Rev 17: 187–230.
- 69. Hirashima M (2011) Induced acceleration analysis of three-dimensional multi-joint movements and its application to sports movements. In: Klika V, editor. Theoretical Biomechanics. Reijka, Croatia: InTech. pp. 303–318.
- 70. Hoff B, Arbib MA (1993) Models of trajectory formation and temporal interaction of reach and grasp. J Mot Behav 25: 175–192.
- 71. Desmurget M, Epstein CM, Turner RS, Prablanc C, Alexander GE, et al. (1999) Role of the posterior parietal cortex in updating reaching movements to a visual target. Nat Neurosci 2: 563–567.
- 72. Johnson PB, Ferraina S, Bianchi L, Caminiti R (1996) Cortical networks for visual reaching: Physiological and anatomical organization of frontal and parietal lobe arm regions. Cereb Cortex 6: 102–119.
- 73. Shen LM, Alexander GE (1997) Neural correlates of a spatial sensory-to-motor transformation in primary motor cortex. J Neurophysiol 77: 1171–1194.
- 74. Zhang J, Riehle A, Requin J, Kornblum S (1997) Dynamics of single neuron activity in monkey primary motor cortex related to sensorimotor transformation. J Neurosci 17: 2227–2246.
- 75. Tanaka H, Krakauer JW, Qian N (2006) An optimization principle for determining movement duration. J Neurophysiol 95: 3875–3886.
- 76. Trainin E, Meir R, Karniel A (2007) Explaining patterns of neural activity in the primary motor cortex using spinal cord and limb biomechanics models. J Neurophysiol 97: 3736–3750.
- 77. Rickert J, Riehle A, Aertsen A, Rotter S, Nawrot MP (2009) Dynamic Encoding of Movement Direction in Motor Cortical Neurons. J Neurosci 29: 13870–13882.
- 78. Cisek P (2006) Integrated neural processes for defining potential actions and deciding between them: A computational model. J Neurosci 26: 9761–9770.
- 79. Smith MA, Ghazizadeh A, Shadmehr R (2006) Interacting adaptive processes with different timescales underlie short-term motor learning. PLoS Biol 4: 1035–1043.
- 80. Hirashima M, Yamane K, Nakamura Y, Ohtsuki T (2008) Kinetic chain of overarm throwing in terms of joint rotations revealed by induced acceleration analysis. J Biomech 41: 2874–2883.
- 81. Berens P (2009) CircStat: A MATLAB Toolbox for Circular Statistics. J Stat Soft 31: 1–21.
- 82. de Leva P (1996) Adjustments to Zatsiorsky-Seluyanov's segment inertia parameters. J Biomech 29: 1223–1230.