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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

6.1. ANALYSIS OF RESULTS<br />

<strong>of</strong> overlapping receptive fields. Several melhods have been proposed lo approximate the expo­<br />

nential number <strong>of</strong> paramelers <strong>of</strong> mulliple-parenl CPTs, the most common being the Noisy-OR<br />

gate (Peari 1988, Diez 1993, Srinivas 1993, Onisko el al. 2001). This method however cannot<br />

be applied to variables that are not graded, such as those coding ihe different features as states<br />

<strong>of</strong> the variable, lor this reason, Ihe proposal by Das (2004). which has been justified from a<br />

geometrical perspeciive and is not constrained to graded variables, <strong>of</strong>fers a valuable allemative.<br />

The model also deals with loops in the nclwork by implementing loopy belief propagation, a<br />

mcihixl thai has only been proven to work empirically and conslitules an active field <strong>of</strong> research<br />

in itself (Murphy et al. 1999. Weiss 2000). The proposed model explores different belief up­<br />

dating methods and provides a comparison <strong>of</strong> the effects the,se have on the diffcrenl layers over<br />

time. Additionally, to the best <strong>of</strong> my knowledge, this is the largest Bayesian network Chat imple­<br />

ments loopy belief propagation and thus tests the limits and applicability <strong>of</strong> this approach. An<br />

alternative and potentially more efficient belief update method, which could be tested in future<br />

versions <strong>of</strong> the model, is asynchronous message-passing triggered by changes in the input to a<br />

node.<br />

All <strong>of</strong> the above proposed meth(Hls an: likely to be useful in the future for researchers modelling<br />

similar large-scale scen;u-ios using Bayesian networks and belief propagation. However, it is<br />

difficult lo evaluate the validity <strong>of</strong> these methods and their ability to approximale the exact<br />

beliefs <strong>of</strong> ihe network. The only way to obtain the exact marginal probabilities in networks with<br />

loops is lo apply the junction-tree algorithm (Murphy etal. 1999), which would incur prohibitive<br />

computational costs. Thus, while these melhods remain to be tested more systematically, the<br />

categorization performance and the feedback reconstruction capabilities <strong>of</strong> ihe model suggest<br />

Ihe proposed melhods point in the right direction. Furthermore, resulls from the setup where the<br />

square representation is fed from the top layer suggest lateral contextual interactions between<br />

the boltom-up input and feedback activity are present in Ihe model.<br />

On ihe other hand, ihe fact thai these contexlual lateral interactions are not clcariy showing up<br />

in the results where feedback originates from S2 and C2, could suggest that the approxima­<br />

tions and sampling methods used are discarding necessary infonnation. as previously argued.<br />

253

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

Saved successfully!

Ooh no, something went wrong!