๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal decision network with distributed representation

โœ Scribed by Rafal Bogacz


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
864 KB
Volume
20
Category
Article
ISSN
0893-6080

No coin nor oath required. For personal study only.

โœฆ Synopsis


On the basis of detailed analysis of reaction times and neurophysiological data from tasks involving choice, it has been proposed that the brain implements an optimal statistical test during simple perceptual decisions. It has been shown recently how this optimal test can be implemented in biologically plausible models of decision networks, but this analysis was restricted to very simplified localist models which include abstract units describing activity of whole cell assemblies rather than individual neurons. This paper derives the optimal parameters in a model of a decision network including individual neurons, in which the alternatives are represented by distributed patterns of neuronal activity. It is also shown how the optimal weights in the decision network can be learnt via iterative rules using information accessible for individual synapses. Simulations demonstrate that the network with the optimal synaptic weights achieves better performance and matches fundamental behavioural regularities observed in choice tasks (Hick's law and the relationship between the error rate and the time for decision) better than a network with synaptic weights set according to a standard Hebb rule.


๐Ÿ“œ SIMILAR VOLUMES


Optimal nonuniform distributed networks
โœ T.N. Lee ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 983 KB

## Techniques developed in the Sturm-Liouville problem and its Inverse problem are well known in solving the analysis and synthesis problems of non-uniform distributed networks (or NUDN) (l)-(6), (15). However, very few practical results have been obtained from the theory, especially as regards the

A time-optimal distributed sorting algor
โœ Atsushi Sasaki ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 87 KB

We have achieved a strict lower time bound of n -1 for distributed sorting on a line network, where n is the number of processes. The lower time bound has traditionally been considered to be n because it is proved based on the number of disjoint comparison-exchange operations in parallel sorting on

Decision trees with optimal joint partit
โœ Djamel A. Zighed; Gilbert Ritschard; Walid Erray; Vasile-Marian Scuturici ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 544 KB

Decision tree methods generally suppose that the number of categories of the attribute to be predicted is fixed. Breiman et al., with their Twoing criterion in CART, considered gathering the categories of the predicted attribute into two supermodalities. In this article, we propose an extension of t