A computational approach to the N-back task

N-back任务的计算方法

阅读:2

Abstract

The N-back task is one of the most popular paradigms for studying the cognitive mechanisms of working memory (WM). The task requires the observer to view a sequence of stimuli and judge whether the current stimulus (probe) matches the one presented N stimuli ago (target). A key phenomenon is that the intervening stimuli (distractors) interfere with task performance. Unfortunately, the classic N-back task uses complex categorical stimuli, making it unfit to quantify the effect of feature similarity on interference strength. Here, we introduce the "analog N-back task", which utilizes stimuli varying continuously in orientation or color. This task variant enables us to measure interference strength on a continuum, providing data suitable for identifying the sources of interference using computational models. In the analog 2-back task, we found that interference increased with feature similarity between the probe and both task-relevant (1-back) and task-irrelevant (3-back) distractors. We next developed and evaluated three main models that each incorporated a Bayesian decision step and differed from an optimal non-interference model in one component only: an early-pooling model, a late-pooling model, and a substitution model. Model comparison suggests that interference emerges late in processing, most likely due to confusion between stimuli during WM retrieval. Our work puts the study of interference in the N-back task on a firmer computational footing and provides a unified framework for examining the sources of interference across domains.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。