Exploring mechanisms of typical and abnormal cognitive development: neurodevelopmental computational models of theory of mind and general intelligence
Notice bibliographique
Résumé
A useful approach to better understand the mechanisms underlying cognitive development has been that of constructive artificial neural networks (CANNs). This thesis presents several CANN models that contribute to our understanding of two typical and abnormal developmental phenomena.The first two manuscripts explore the mechanisms underlying false-belief (FB) task transitions. Typically-developing preschoolers go through two transitions on verbal FB tasks, in which they have to say where an agent will search to find (approach) or avoid (avoidance) an object that was moved from location A to location B in the agent's absence. Transition 1 occurs as children go from failure to success on the approach task, and Transition 2 occurs as children go from succeeding only at approach to succeeding also at avoidance tasks. Are these transitions due to learning about beliefs or to other factors? The first manuscript presents a model of a non-verbal FB task (which uses looking time rather than a verbal measure). The model captured the transitions observed with verbal tasks, predicting that transitions would be observed on non-verbal tasks. Results suggest that initial failure could be due to observing more true-belief (TB) than FB searches, and that Transition 1 may not be due to learning about beliefs but to overcoming default TB attributions by learning to distinguish FB from TB situations. Results also suggest Transition 2 may be due to avoidance goals being represented by more varied behaviour than approach goals.Autistic children usually fail at verbal approach FB tasks, even when they are older than the typical age of success. The second manuscript explores the impact of simulating specific autistic deficits on Transition 1. First, it is thought that social deficits in autism may be related to abnormal connectivity between the brain regions used in FB tasks. I explored this hypothesis by impairing in one group of networks the connectivity of the input unit providing the information about the agent, while in a second group of networks I impaired a start or end location input unit. Results suggest that the information from the agent node is computationally crucial to Transition 1, as only the first group had impaired performance. I next simulated the decreased autistic attention to social stimuli by replacing a random half of all network training patterns by random patterns, simulating observations of random situations. Because there is currently some doubt as to whether specific, early behavioural treatment of autism improves later deficits, I simulated different times of treatment by manipulating the duration of the attention impairment in networks. As the duration of the impairment was reduced, performance progressively improved, showing that computationally, early treatment can be beneficial for autism. In the third manuscript, I explored whether white-matter integrity (WMI) could be manipulated to simulate a range of performances on Raven's Standard Progressive Matrices (SPM), a popular test of intelligence requiring subjects to analyze a matrix to find which figure, out of a few alternatives, best fits the missing figure in the matrix. Different levels of WMI have been associated with typical, age-related cognitive improvements and decline, as well as with preterm birth. To explore the effects of different levels of WMI, I incorporated different noise proportions in the activation values of my SPM model. Best performance was obtained with no impairment, but as WMI was reduced, the model's success rate was lowered to first capture the success rate of typically-developing 9-year-olds on the SPM, and with more noise it then captured the performance of 9-year-olds born preterm. These results thus computationally support a link between WMI and typical and impaired cognitive development.In sum, these results show that CANNs are unique tools to advance our understanding of typical and abnormal mechanisms of development.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,001 | 0,003 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,001 |
| Bibliométrie | 0,001 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,003 |
| Communication savante | 0,002 | 0,003 |
| Science ouverte | 0,001 | 0,001 |
| Intégrité de la recherche | 0,001 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,001 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».