Concurrent Implicit Adaptation to Multiple Opposite Perturbations
Bibliographic record
Abstract
Abstract Simultaneous adaptation to opposite visuomotor perturbations is known to be difficult. It has been shown to be possible only in situations where the two tasks are associated with different contexts, being either a different colored background, a different area of workspace, or a different follow-through movement. However, many of these elements evoke explicit mechanisms that could contribute to storing separate (modular) memories. It remains to be shown whether simultaneous adaptation to multiple perturbations is possible when they are introduced in a fully implicit manner. Here, we sought to test this possibility using a visuomotor perturbation small enough to eliminate explicit awareness. Participants ( N = 25) performed center-out reaching movements with a joystick to five targets located 72° apart. Depending on the target, visual feedback of cursor position was either veridical (one target) or could be rotated by +5 or −5° (two targets each). After 300 trials of adaptation (60 to each target), results revealed that participants were able to fully compensate for each of the imposed rotations. Moreover, when veridical visual feedback was restored, participants exhibited after-effects that were consistent with the rotations applied at each target. Questionnaires collected immediately after the experiment confirmed that none of the participants were aware of the perturbations. These results speak for the existence of implicit processes that can smoothly handle small and opposite visual perturbations when these are associated with distinct target locations.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
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 teacher head, 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".