Please use this identifier to cite or link to this item:
|Title:||Time-invariant working memory representations in the presence of code-morphing in the lateral prefrontal cortex||Authors:||Parthasarathy, A.
|Issue Date:||2019||Publisher:||Nature Publishing Group||Citation:||Parthasarathy, A., Tang, C., Herikstad, R., Cheong, L.F., Yen, S.-C., Libedinsky, C. (2019). Time-invariant working memory representations in the presence of code-morphing in the lateral prefrontal cortex. Nature Communications 10 (1) : 4995. ScholarBank@NUS Repository. https://doi.org/10.1038/s41467-019-12841-y||Rights:||Attribution 4.0 International||Abstract:||Maintenance of working memory is thought to involve the activity of prefrontal neuronal populations with strong recurrent connections. However, it was recently shown that distractors evoke a morphing of the prefrontal population code, even when memories are maintained throughout the delay. How can a morphing code maintain time-invariant memory information? We hypothesized that dynamic prefrontal activity contains time-invariant memory information within a subspace of neural activity. Using an optimization algorithm, we found a low-dimensional subspace that contains time-invariant memory information. This information was reduced in trials where the animals made errors in the task, and was also found in periods of the trial not used to find the subspace. A bump attractor model replicated these properties, and provided predictions that were confirmed in the neural data. Our results suggest that the high-dimensional responses of prefrontal cortex contain subspaces where different types of information can be simultaneously encoded with minimal interference. © 2019, The Author(s).||Source Title:||Nature Communications||URI:||https://scholarbank.nus.edu.sg/handle/10635/211656||ISSN:||2041-1723||DOI:||10.1038/s41467-019-12841-y||Rights:||Attribution 4.0 International|
|Appears in Collections:||Elements|
Show full item record
Files in This Item:
|10_1038_s41467-019-12841-y.pdf||1.71 MB||Adobe PDF|
This item is licensed under a Creative Commons License