Sculpting dynamical systems for models of neural computation and memory
Notice bibliographique
Résumé
Dynamical systems are now a mainstay of computational neuroscience. Persistent activity in biological neural networks has been posited to result from dynamical attractors in neural state-space [1], and computation with attractors underlies a variety of models for information processing and memory function in the brain [2-4]. Nevertheless, there exists no general, substrate-free method for the construction of these dynamical systems [2], substrate-free meaning not tied to a particular neural instantiation. We introduce such a method in this work, with a focus on applications to neural computation and memory modeling. We call this method state-space sculpting. The systems it constructs, or sculpts, are realized as ordinary differential equations. Sculpting is therefore substrate free; it is general in the sense that sculpted systems may contain any number of attractors embedded at any locations in the state-space and the basins of those attractors may be shaped with any smooth geometry. We conjecture that the sculpting process is analogous to learning by synaptic modification in some biological and artificial neural networks. The method works as follows. First, a set of attractor locations and types (fixed point, periodic, strange) is defined. Then a set of corresponding vector fields is identified: Each of these has one of the defined attractor types at one of the defined locations in its state-space. Next, the basins of these attractors are delineated by defining smooth boundaries for the corresponding vector fields. Finally, the set of vector fields and boundaries is unified into a single smooth dynamical equation using regularization [5]. We have sculpted various 2-dimensional systems by this method, and their dynamics were confirmed in simulation to exhibit the defined attractors and basins. These systems contained arbitrary combinations of fixed point and periodic attractors, as well as repelling regions, with arbitrary basin geometries. Systems of saddle equilibria were also sculpted to demonstrate the versatility of the method. These can be made to exhibit heteroclinic channels and cycles, which are key features of the Winnerless Competition Principle of neural computation [4]. As a first test of our conjecture on the analogy between sculpting and synaptic modification, the well known Hopfield network [6] was analyzed and characterized in sculpting terms. This analysis demonstrated most notably that the network's basins of attraction are delineated by combinations of codimension-1 hyperplanes containing saddle equilibria. The analogue of state-space sculpting in the Hopfield network is therefore limited, since attractor basins cannot be shaped with any smooth geometry. Moving forward, it is necessary to study more complicated networks to show that they can be cast in the sculpting framework, as well as to extend the sculpting method to higher-dimensional state-spaces and manifolds.
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 distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 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 tête enseignante, 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 ».