08.02.2013 Views

Bernal S D_2010.pdf - University of Plymouth

Bernal S D_2010.pdf - University of Plymouth

Bernal S D_2010.pdf - University of Plymouth

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

3.4. EXISTING MODELS<br />

the node encoded by the LINC. In a final step, the output message is normalized via a normaliza­<br />

tion circuit where Ihe different values are recurrently inhibiting each other This is achieved by<br />

connecling Ihe excitatory population <strong>of</strong> all sunimalion units to a central inhibitory population.<br />

A schematic representation <strong>of</strong> a neuronal LINC node is shown in Figure 3.11.<br />

The model was tested using two sets <strong>of</strong> graphs, one wilh 12 hidden binary variables and one<br />

with 6 hidden ternary variables. In each case 100 different random conliguralions <strong>of</strong> the node<br />

weights and evidence values were tested and compared with the original analytical methods.<br />

Results showed ihc neuronal circuit was able to effectively approximate the marginal distri­<br />

butions, although Ihe accuracy decreased when using temaiy variables as compared to binary<br />

variables. The inaccuracy <strong>of</strong> the model was shown to arise not only from the sub-circuit's ap­<br />

proximations (sum, max and normalization), but from inherent network phenomena such as the<br />

evolving desynchronization in subpopulalions.<br />

With regard to the scalability, the model can map any arbitrary graph structure and discrete<br />

variables with any number <strong>of</strong> stales, with a linear relation between the number <strong>of</strong> neurons and<br />

the number <strong>of</strong> nodes. However, for large-scale networks and variables with many slates, the<br />

number <strong>of</strong> neurons might be prohibitive (6 hidden variables each wilh 3 stales require over<br />

16.000 neurons). The speed <strong>of</strong> the computation provides a biologically reahslic inference time<br />

{^ 400 ms) due to the highly dislributed implementation. The model also attempts to map the<br />

different algorithm operations onto the conical laminar circuits, as described in Section 3,4,3.<br />

A comparison between the most significant feaiures <strong>of</strong> the previous two models is depicted in<br />

Table 3.1, including a summary <strong>of</strong> the main advantages and drawbacks <strong>of</strong> each model,<br />

3.4.1.4 Kleclronic implementation <strong>of</strong> networks <strong>of</strong> .spiking neurons<br />

An emerging and rapidly growing field <strong>of</strong> research is dedicated to the implementation <strong>of</strong> real­<br />

istic spiking neural circuits in hybrid analog/digital very large scale integration (VLSI) devices.<br />

Recent advances have allowed the implementation <strong>of</strong> winner-iake-all networks in the VLSI de­<br />

vices, which has lead to the development <strong>of</strong> simple state-dependent systems (Neftci el ;il. 2010).<br />

Simple graphical models, such as factor graphs and belief propagation, can be approximated us­<br />

ing winner-take-a 11 networks wilh state-dependent processing. Lxamplcs <strong>of</strong> graphical models,<br />

118

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!