A non-linear deterministic model of action selection in the basal ganglia to simulate motor fluctuations in Parkinson's disease
Bibliographic record
Abstract
Motor fluctuations and dyskinesias are severe complications of Parkinson's disease (PD), especially evident at its advanced stage, under long-term levodopa therapy. Despite their strong clinical prevalence, the neural origin of these motor symptoms is still a subject of intense debate. In this work, a non-linear deterministic neurocomputational model of the basal ganglia (BG), inspired by biology, is used to provide more insights into possible neural mechanisms at the basis of motor complications in PD. In particular, the model is used to simulate the finger tapping task. The model describes the main neural pathways involved in the BG to select actions [the direct or Go, the indirect or NoGo, and the hyperdirect pathways via the action of the sub-thalamic nucleus (STN)]. A sensitivity analysis is performed on some crucial model parameters (the dopamine level, the strength of the STN mechanism, and the strength of competition among different actions in the motor cortex) at different levels of synapses, reflecting major or minor motor training. Depending on model parameters, results show that the model can reproduce a variety of clinically relevant motor patterns, including normokinesia, bradykinesia, several attempts before movement, freezing, repetition, and also irregular fluctuations. Motor symptoms are, especially, evident at low or high dopamine levels, with excessive strength of the STN and with weak competition among alternative actions. Moreover, these symptoms worsen if the synapses are subject to insufficient learning. The model may help improve the comprehension of motor complications in PD and, ultimately, may contribute to the treatment design.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".