“Adaptive learning” as a mechanistic candidate for reaching optimal task-set representations flexibly
Bibliographic record
Abstract
Top-down inputs from prefrontal cortex impact on sensory neurons [1,2], enhancing their selectivity to attended stimuli, while sensory processing of distractors is suppressed [1,3,4]. However, what are the neuro-computational mechanisms that identify the behaviorally relevant information that is worth to bias? Previous studies linked selective attention to learned value [5], suggesting that attentional selection relies on internal mechanisms that track the relevance of sensory information. Consistent with this view, we recently introduced a reinforcement learning (RL) approach for the deployment of selective attention [6]. We tested model-free and model-based versions of RL to identify the mechanisms that most accurately predict behavior: whereas model-based prioritizes attentional selection to task features that are systematically associated with reward, model-free considers all available features. Our results proved that the optimal task-set representation significantly improved predictive power, suggesting that monkeys benefited from model-based mechanisms [6]. Yet, model-based presents two important limitations: i) it is unable to adapt to changes in the association of reward with sensory features that are not included in the learned model, and ii) it excludes the mechanism of learning by which subjects derive the proper task-set representation. The question remains then of how a prioritized task set can be learned to exploit the benefits of employing a model. With the aim to workaround model-based limitations and shed light on the underlying mechanisms that make model-based benefits possible, we propose here the “adaptive learning” mechanism for flexible task-set representation. The mechanism is dynamically tuned according to the statistics of association between sensory features and reward outcome, flexibly adjusting its regime of operation between model-free and modelbased systems. To test the adaptive learning mechanism, we developed it in a RL model and extended our previous analysis of monkey behavior to both, cued [5] and uncued [6], versions of the same attention task. This RL model was able to transition from a naive starting point to an optimal task-set representation, and to flexibly adapt among optimal task-set representations upon changes in reward contingencies. The model achieved so by tracking a separate learning rate a for each stimulus feature in the environment. If the selection of a stimulus feature was systematically correlated with a particular outcome (reward or no-reward), a increased. In contrast, when a feature was unable to consistently predict reward, a decayed. Thus, a changed dynamically, and over a large number of trials any a associated with a non-predictive feature went to zero, effectively eliminating it from the task set, which tuned performance towards that of the model-based system. The adaptive learning mechanism introduced here represents a step further in our understanding of the origins of selective attention. Notably, our results prove that the adaptive learning is an optimal mechanistic candidate to support arbitrary prioritized model-based formation under generic conditions of covert attentional selection, and regardless of whether attentional selection operates on cued or uncued tasks.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 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".