Conditional Visuomotor Learning and Viability Theory
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1602-1602.
© 2005 International Joint Conferences on Artificial Intelligence
Abstract
In conditional visuomotor learning, several arbitrary associations between visual cues and motor responses have to be learned by trial and error at the same time. Monkeys, as humans, do not achieve this task by randomly trying each possible association. Rather, they use a strategy that organizes sequentially the acquisition of individual stimulus-response associations. Accordingly, neuronal recordings in the monkey striatum, the main basal ganglia structure, reveals two forms of plasticity during learning, a transient one that could constitute the neuronal correlate of the strategy, and a long-lasting one that could reflect the slow neuronal implementation of individual associations. Existing models of basal ganglia function based on reinforcement learning cannot account for this dual process. Hence, we developed a mathematical model of conditional visuomotor learning, inspired from viability theory, which implements both the formation of individual associations and the use of strategies to organize learning.
- Aubin JP. Viability Theory, Birkhauser, Boston, Basel, Berlin, 1991.
- Barto A. Adaptive critics and the basal ganglia. In Models of Information Processing in the Basal Ganglia, Eds.
- Houk J.C., Davis J.L., and Beiser D.G., MIT Press, Cambridge, MA, pages 215-232, 1995.
- Bar-Gad I, Morris G., and Bergman H. Information processing, dimensionality reduction and reinforcement learning in the basal gangla. Progress in Neurobiology, 71: 439-473, 2003.
- Cardaliaguet P, Quincampoix M and Saint-Pierre P. Set- valued numerical methods for optimal control and differential games, in Stochastic and differential games. Theory and numerical methods, In Annals of the International Society of Dynamical Games, Birkhauser, pages 177-247, 1999.
- Frankowska H and Quincampoix M. Viability kernels of differential inclusions with constraints: algorithm and applications. J. Math. Systems, Estimation and Control, 1:371-388, 1991.
- Hadj-Bouziane F and Boussaoud D. Activity of neurons in the striatum during learning of arbitrary visuo-motor associations. Exp Brain Res, 18:269-277, 2003.
- Hadj-Bouziane F, Meunier M and Boussaoud D. Conditional visuo-motor learning in primates: a key role for the basal ganglia. Journal of Physiology-Paris, 97:567-579, 2003.
- Hadj-Bouziane F, Benatru I, Klinger H, Brousolle E, Boussaoud D and Meunier M. Conditional associative learning in advanced Parkinson's disease. Soc. Neurosci. Abstr. 710.4, 2004.
- Houk JC, Adams JL and Barto AG. A model of how the basal ganglia generate and use reward signals that predict reinforcement. In JC Houk, JL Davis and DG Beiser (Eds.), Cambridge: MIT Press Models of information processing in the basal ganglia, pages 249-270, 1995.
References were extracted automatically from the PDF and may contain errors.
Full text extracted automatically from the PDF; figures, tables and equations may differ. The PDF is the version of record.
Introduction
Studies of arbitrary visuomotor learning in laboratory situations generally use several stimuli taken from the same category (colors, pictures, positions etc.) and an equivalent number of motor responses (hand postures, lever displacements, etc.). Subjects are required to learn by trial and error, conditional rules such as 'if green go right, if red go left, if blue, go up', etc. This requires on-line monitoring of the associations already tried and of their outcome (correct or incorrect). With large sets of items and actions to associate, this monitoring represents a high memory load, which can be decreased by using specific learning strategies.
Conditional associative learning: behavioral and neuronal data
The striatum, the larger structure composing the basal ganglia, constitutes a key neural substrate for arbitrary visuo-motor learning (see e.g. Hadj-Bouziane et al., 2003 for review). Hence, in a recent study, we recorded single cell activity in the striatum of two rhesus monkeys during learning of a conditional visuomotor task that required to associate complex visual cues with joystick movements (Hadj-Bouziane & Boussaoud, 2003). The animals searched, by trial and error, for the correct joystick movement associated with each of four visual cues. The four associations comprising a set were presented concurrently, that is, each appeared once, in randomized order, within each block of four consecutive trials.
Behavior. Although the four associations were presented concurrently within each block of 4 trials, monkeys learned them sequentially, focusing on one association at a time in order to decrease the memory load. The use of strategies to organize learning was also observed in humans in a separate study (Hadj-Bouziane et al., 2004).
Neuronal activity: Neuronal activity in the striatum showed two main types of modulations during learning. One was transient, consisting in a time-limited increase in activity during early learning stages. The other was long-lasting, consisting in a gradual increment of activity over the entire course of the learning session. The former could underlie the development and use of learning strategies, whereas the latter could be responsible for long term storage of the individual associations.
Mathematical model: the striatum and viability theory
Several not mutually exclusive computational models of basal ganglia have been proposed in the literature (e.g. Houk et al., 1995; Barto, 1995). Many of these models use the reinforcement learning (RL) algorithm. For learning associations by RL algorithms one would need to build a cost function adapted to this particular learning task and then to find a way to maximize this function. However, as described above, learning arbitrary visuomotor associations is not based on random selection of a behavioral response, but rather implies strategies. Mathematically the learning of associations leads to the so called target problem of control theory and there are different tools (cf. viability theory and capture basin algorithms, time optimal control, adaptive control) that allow to find policies theoretically and construct solutions numerically. The learning of policies leading to a target can be derived from viability theory (Aubin 1991). Instead of a repetitive improvement of the cumulative reward to make it as close as possible to a maximum (as it is done in RL algorithms), the viability kernel algorithms are based on the systematic exploration of boundaries of sets. Indeed when we investigate the boundary of a set, instead of the set itself, we reduce the dimension of the problem (Cardaliaguet et al., 1999). We propose that the use of strategies such as the sequential strategy evoked above correspond to investigation of boundaries. From the mathematical view point the viability and capture basin algorithms are based on elimination: taking out points from which it is impossible to get to a target and in the same time constructing the winning strategies for Capture Basin (e.g. Frankowska & Quincampoix, 1991). This elimination is based on a local analysis of constraints. Instead of applying exploration type arguments and trying different controls from the same initial condition, the viability kernel algorithms consider only critical points, that is the boundary of the set of constraints and check which points of the boundary are not viable.
Summary and conclusions
Learning arbitrary visuo-motor associations implies to learn the correct stimulus-movement associations and then to store them in long term memory. One has to learn by trial and error to select the appropriate movement according to the stimulus presented. During early stages of learning, processes such as discrimination, recognition and memorization of the stimuli are required, but also monitoring of events and behavioral outcome. Learning time can be reduced by the use of particular strategies such as focusing on a single cue at a time or repeating a motor response until correct.
We propose a computational model based on 1) these behavioral data showing the use learning strategies, 2) the possible correlates found in the dynamics of neuronal changes in the striatum, and 3) viability theory. This model complements existing ones, by taking into account the strategies, viewed as a way to determine the boundaries of the learning space. In our model the learning strategies artificially reduce the dimension of learning space (number of actions or number of images), a process that simplifies the task. At the neuronal level, we suggest that the strategy choice may be carried out by the transient activities, whereas the boundary encodings may be accomplished using the rules proposed in Bar-Gad et al. (2003), and local analysis done using the reinforcement signal. We thus propose an additional role of the basal ganglia, that of reducing the dimension of learning space.
Acknowledgements
This work was supported by the French Ministry of Research (ACI Cognition et traitement de l'information), and by the CNRS (PI TCAN), and a Bettencourt-Schuller foundation fellowship for FHB.
@inproceedings{ijcai2005p332,
title = {Conditional Visuomotor Learning and Viability Theory},
author = {Hadj-Bouziane, Fadila and Frankowska, Hélène and Meunier, Martine and Boussaoud, Driss},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Leslie Pack Kaelbling and Alessandro Saffiotti},
pages = {1602--1602},
year = {2005},
url = {https://ijcai.org/proceedings/2005/332},
}
TY - CPAPER TI - Conditional Visuomotor Learning and Viability Theory AU - Hadj-Bouziane, Fadila AU - Frankowska, Hélène AU - Meunier, Martine AU - Boussaoud, Driss T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 1602 EP - 1602 UR - https://ijcai.org/proceedings/2005/332 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: