Biomedical subjects

Rafal Bogacz

Publications and source records attributed to Rafal Bogacz.

6 recordsLinked to original sources

PubMed2007

The basal ganglia and cortex implement optimal decision making between alternative actions.

Neurophysiological studies have identified a number of brain regions critically involved in solving the problem of action selection or decision making. In the case of highly practiced tasks, these regions include cortical areas hypothesized to integrate evidence supporting alternative actions and the basal ganglia, hypothesized to act as a central switch in gating behavioral requests. However, despite our relatively detailed knowledge of basal ganglia biology and its connectivity with the cortex and numerical simulation studies demonstrating selective function, no formal theoretical framework exists that supplies an algorithmic description of these circuits. This article shows how many aspects of the anatomy and physiology of the circuit involving the cortex and basal ganglia are exactly those required to implement the computation defined by an asymptotically optimal statistical test for decision making: the multihypothesis sequential probability ratio test (MSPRT). The resulting model of basal ganglia provides a new framework for understanding the computation in the basal ganglia during decision making in highly practiced tasks. The predictions of the theory concerning the properties of particular neuronal populations are validated in existing experimental data. Further, we show that this neurobiologically grounded implementation of MSPRT outperforms other candidates for neural decision making, that it is structurally and parametrically robust, and that it can accommodate cortical mechanisms for decision making in a way that complements those in basal ganglia.

Algorithms↗

PubMed2006

The physics of optimal decision making: a formal analysis of models of performance in two-alternative forced-choice tasks.

In this article, the authors consider optimal decision making in two-alternative forced-choice (TAFC) tasks. They begin by analyzing 6 models of TAFC decision making and show that all but one can be reduced to the drift diffusion model, implementing the statistically optimal algorithm (most accurate for a given speed or fastest for a given accuracy). They prove further that there is always an optimal trade-off between speed and accuracy that maximizes various reward functions, including reward rate (percentage of correct responses per unit time), as well as several other objective functions, including ones weighted for accuracy. They use these findings to address empirical data and make novel predictions about performance under optimality.

Choice Behavior↗

PubMed2004

Detection of synchronized oscillations in the electroencephalogram: an evaluation of methods.

The signal averaging approach typically used in ERP research assumes that peaks in ERP waveforms reflect neural activity that is uncorrelated with activity in the ongoing EEG. However, this assumption has been challenged by research suggesting that ERP peaks reflect event-related synchronization of ongoing EEG oscillations. In this study, we investigated the validity of a set of methods that have been used to demonstrate that particular ERP peaks result from synchronized EEG oscillations. We simulated epochs of EEG data by superimposing phasic peaks on noise characterized by the power spectrum of the EEG. When applied to the simulated data, the methods in question produced results that have previously been interpreted as evidence of synchronized oscillations, even though no such synchrony was present. These findings suggest that proposed analysis methods may not effectively disambiguate competing views of ERP generation.

Data Interpretation, Statistical↗

PubMed2004

Parameterization of connectionist models.

We present a method for estimating parameters of connectionist models that allows the model's output to fit as closely as possible to empirical data. The method minimizes a cost function that measures the difference between statistics computed from the model's output and statistics computed from the subjects' performance. An optimization algorithm finds the values of the parameters that minimize the value of this cost function. The cost function also indicates whether the model's statistics are significantly different from the data's. In some cases, the method can find the optimal parameters automatically. In others, the method may facilitate the manual search for optimal parameters. The method has been implemented in Matlab, is fully documented, and is available for free download from the Psychonomic Society Web archive at www.psychonomic.org/archive/.

Algorithms↗

PubMed2003

Comparison of computational models of familiarity discrimination in the perirhinal cortex.

This study compares the efficiency and plausibility of published computational models of familiarity discrimination in the perirhinal cortex. Substantial evidence indicates that the perirhinal cortex is involved in both the familiarity discrimination aspect of recognition memory and in perceptual functions involved with representations of complete stimuli (i.e., object identification). Published models of how the perirhinal cortex may perform familiarity discrimination can be divided into two groups. The first group assumes that a proportion of perirhinal neurons form a network specialised just for familiarity discrimination (these models may be based on Hebbian or anti-Hebbian synaptic plasticity). In contrast, the second group assumes that both familiarity discrimination and learning representations of complete stimuli are performed within a single combined network. This study establishes that when the responses of neurons that provide input to the familiarity discrimination network are correlated (as indicated by experimental data), specialised networks based on anti-Hebbian learning may recognise the previous occurrence of many more stimuli (i.e., have a capacity up to thousands of times larger) than specialised networks based on Hebbian learning. The currently published combined models do not learn an optimal stimulus representation (they do not fully extract statistically independent features), and hence their capacities are even lower than those of the specialised models based on Hebbian learning. Hence, the combined models published thus far are critically less efficient than the specialised models based on anti-Hebbian learning. This study also compares the consistency of the models with experimental observations concerning what is known of synaptic plasticity in the perirhinal cortex and the responses of its neurons. Many theoretically important parameters remain undetermined, and experiments are suggested to provide information critical for refining and distinguishing between the various models. However, the above theoretical arguments and currently published data favour the existence of a separate network specialised for familiarity discrimination.

Animals↗

PubMed2002

The restricted influence of sparseness of coding on the capacity of familiarity discrimination networks.

Much evidence indicates that the perirhinal cortex is involved in the familiarity discrimination aspect of recognition memory. It has been previously shown under selective conditions that neural networks performing familiarity discrimination can achieve very high storage capacity, being able to deal with many times more stimuli than associative memory networks can in associative recall. The capacity of associative memories for recall has been shown to be highly dependent on the sparseness of coding. However, previous work on the networks of Bogacz et al, Norman and O'Reilly and Sohal and Hasselmo that model familiarity discrimination in the perirhinal cortex has not investigated the effects of the sparseness of encoding on capacity. This paper explores how sparseness of coding influences the capacity of each of these published models and establishes that sparse coding influences the capacity of the different models in different ways. The capacity of the Bogacz et al model can be made independent of the sparseness of coding. Capacity increases as coding becomes sparser for a simplified version of the neocortical part of the Norman and O'Reilly model, whereas capacity decreases as coding becomes sparser for a simplified version of the Sohal and Hasselmo model. Thus in general, and in contrast to associative memory networks, sparse encoding results in little or no advantage for the capacity of familiarity discrimination networks. Hence it may be less important for coding to be sparse in the perirhinal cortex than it is in the hippocampus. Additionally, it is established that the capacities of the networks are strongly dependent on the precise form of the learning rules (synaptic plasticity) used in the network. This finding indicates that the precise characteristics of synaptic plastic changes in the real brain are likely to have major influences on storage capacity.

Animals↗