The Reward-Complexity Trade-off in Schizophrenia
Open Access
- 25 May 2021
- journal article
- research article
- Published by Ubiquity Press, Ltd. in Computational Psychiatry
- Vol. 5 (1) , 38-53
Abstract
Action selection requires a policy that maps states of the world to a distribution over actions. The amount of memory needed to specify the policy (the policy complexity) increases with the state-dependence of the policy. If there is a capacity limit for policy complexity, then there will also be a trade-off between reward and complexity, since some reward will need to be sacrificed in order to satisfy the capacity constraint. This paper empirically characterizes the trade-off between reward and complexity for both schizophrenia patients and healthy controls. Schizophrenia patients adopt lower complexity policies on average, and these policies are more strongly biased away from the optimal reward-complexity trade-off curve compared to healthy controls. However, healthy controls are also biased away from the optimal trade-off curve, and both groups appear to lie on the same empirical trade-off curve. We explain these findings using a cost-sensitive actor-critic model. Our empirical and theoretical results shed new light on cognitive effort abnormalities in schizophrenia.Keywords
All Related Versions
This publication has 38 references indexed in Scilit:
- Efficient data compression in perception and perceptual memory.Psychological Review, 2020
- The Tortoise and the Hare: Interactions between Reinforcement Learning and Working MemoryJournal of Cognitive Neuroscience, 2018
- Interactions Among Working Memory, Reinforcement Learning, and Effort in Value-Based Choice: A New Paradigm and Selective Deficits in SchizophreniaBiological Psychiatry, 2017
- Working Memory Load Strengthens Reward Prediction ErrorsThe Journal of Neuroscience, 2017
- Working Memory Contributions to Reinforcement Learning Impairments in SchizophreniaThe Journal of Neuroscience, 2014
- Bayesian and Quasi-Bayesian Estimators for Mutual Information from Discrete DataEntropy, 2013
- Compression in visual working memory: Using statistical regularities to form more efficient memory representations.Journal of Experimental Psychology: General, 2009
- Information processing, dimensionality reduction and reinforcement learning in the basal gangliaProgress in Neurobiology, 2003
- Computation of channel capacity and rate-distortion functionsIEEE Transactions on Information Theory, 1972
- An algorithm for computing the capacity of arbitrary discrete memoryless channelsIEEE Transactions on Information Theory, 1972