Subspace orthogonalization as a mechanism for binding values to space.

ArXiv

Department of Neuroscience, Center for Magnetic Resonance Research, and Department of Biomedical Engineering, University of Minnesota, Minneapolis, MN 55455.

Published: February 2023

When choosing between options, we must solve an important binding problem. The values of the options must be associated with information about the action needed to select them. We hypothesize that the brain solves this binding problem through use of distinct population subspaces. To test this hypothesis, we examined the responses of single neurons in five reward-sensitive regions in rhesus macaques performing a risky choice task. In all areas, neurons encoded the value of the offers presented on both the left and the right side of the display in semi-orthogonal subspaces, which served to bind the values of the two offers to their positions in space. Supporting the idea that this orthogonalization is functionally meaningful, we observed a session-to-session covariation between choice behavior and the orthogonalization of the two value subspaces: trials with less orthogonalized subspaces were associated with greater likelihood of choosing the less valued option. Further inspection revealed that these semi-orthogonal subspaces arose from a combination of linear and nonlinear mixed selectivity in the neural population. We show this combination of selectivity balances reliable binding with an ability to generalize value across different spatial locations. These results support the hypothesis that semi-orthogonal subspaces support reliable binding, which is essential to flexible behavior in the face of multiple options.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9915762PMC

Publication Analysis

Top Keywords

semi-orthogonal subspaces
12
binding problem
8
reliable binding
8
subspaces
6
binding
5
subspace orthogonalization
4
orthogonalization mechanism
4
mechanism binding
4
binding values
4
values space
4

Similar Publications

When choosing between options, we must associate their values with the actions needed to select them. We hypothesize that the brain solves this binding problem through neural population subspaces. Here, in macaques performing a choice task, we show that neural populations in five reward-sensitive regions encode the values of offers presented on the left and right in distinct subspaces.

View Article and Find Full Text PDF

When choosing between options, we must associate their values with the action needed to select them. We hypothesize that the brain solves this binding problem through neural population subspaces. To test this hypothesis, we examined neuronal responses in five reward-sensitive regions in macaques performing a risky choice task with sequential offers.

View Article and Find Full Text PDF

Abstract Value Encoding in Neural Populations But Not Single Neurons.

J Neurosci

June 2023

Department of Neuroscience and Center for Magnetic Resonance Research, University of Minnesota, Minneapolis, Minnesota 55455

An important open question in neuroeconomics is how the brain represents the value of offers in a way that is both abstract (allowing for comparison) and concrete (preserving the details of the factors that influence value). Here, we examine neuronal responses to risky and safe options in five brain regions that putatively encode value in male macaques. Surprisingly, we find no detectable overlap in the neural codes used for risky and safe options, even when the options have identical subjective values (as revealed by preference) in any of the regions.

View Article and Find Full Text PDF

Subspace orthogonalization as a mechanism for binding values to space.

ArXiv

February 2023

Department of Neuroscience, Center for Magnetic Resonance Research, and Department of Biomedical Engineering, University of Minnesota, Minneapolis, MN 55455.

When choosing between options, we must solve an important binding problem. The values of the options must be associated with information about the action needed to select them. We hypothesize that the brain solves this binding problem through use of distinct population subspaces.

View Article and Find Full Text PDF

Semi-orthogonal Frame Wavelets and Parseval Frame Wavelets Associated with GMRA.

Chaos Solitons Fractals

December 2008

College of Information Engineering, University of Information Engineering, Zhengzhou, 450002, China.

In this paper, we study semi-orthogonal frame wavelets and Parseval frame wavelets(PFWs) in L(2)(R(d)) with matrix dilations of form (Df)(x)=2f(Ax), where A is an arbitrary expanding d x d matrix with integer coefficients, such that |detA| = 2. Firstly, we obtain a necessary and sufficient condition for a frame wavelet to be a semi-orthogonal frame wavelet. Secondly, we present a necessary condition for the semi-orthogonal frame wavelets.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!