Inference by Reparameterization using Neural Population Codes
| dc.contributor.advisor | Pitkow, Xaq | |
| dc.contributor.committeeMember | Aazhang, Behnaam | |
| dc.contributor.committeeMember | Ernst, Philip | |
| dc.contributor.committeeMember | Josic, Kresimir | |
| dc.creator | Vasudeva Raju, Rajkumar | |
| dc.date.accessioned | 2016-01-27T17:46:45Z | |
| dc.date.available | 2016-01-27T17:46:45Z | |
| dc.date.created | 2015-12 | |
| dc.date.issued | 2015-12-04 | |
| dc.date.submitted | December 2015 | |
| dc.date.updated | 2016-01-27T17:46:45Z | |
| dc.description.abstract | Behavioral experiments on humans and animals suggest that the brain performs probabilistic inference to interpret its environment. Here we present a general-purpose, biologically plausible implementation of approximate inference based on Probabilistic Population Codes (PPCs). PPCs are distributed neural representations of probability distributions that are capable of implementing marginalization and cue-integration in a biologically plausible way. By connecting multiple PPCs together, we can naturally represent multivariate probability distributions, and capture the conditional dependency structure by setting those connections as in a probabilistic graphical model. To perform inference in general graphical models, one convenient and often accurate algorithm is Loopy Belief Propagation (LBP), a ‘message-passing’ algorithm that uses local marginalization and integration operations to perform approximate inference efficiently even for complex models. In LBP, a message from one node to a neighboring node is a function of incoming messages from all neighboring nodes, except the recipient. This exception renders it neurally implausible because neurons cannot readily send many different signals to many different target neurons. Interestingly, however, LBP can be reformulated as a sequence of Tree-based Re-Parameterization (TRP) updates on the graphical model which re-factorizes a portion of the probability distribution. Although this formulation still implicitly has the message exclusion problem, we show this can be circumvented by converting the algorithm to a nonlinear dynamical system with auxiliary variables and a separation of time-scales. By combining these ideas, we show that a network of PPCs can represent multivariate probability distributions and implement the TRP updates for the graphical model to perform probabilistic inference. Simulations with Gaussian graphical models demonstrate that the performance of the PPC-based neural network implementation of TRP updates for probabilistic inference is comparable to the direct evaluation of LBP, and thus provides a compelling substrate for general, probabilistic inference in the brain. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | Vasudeva Raju, Rajkumar. "Inference by Reparameterization using Neural Population Codes." (2015) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/88182">https://hdl.handle.net/1911/88182</a>. | |
| dc.identifier.uri | https://hdl.handle.net/1911/88182 | |
| dc.language.iso | eng | |
| dc.rights | Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. | |
| dc.subject | Probabilistic Inference | |
| dc.subject | Probabilistic Population Codes | |
| dc.subject | Tree-based Re-parameterization | |
| dc.subject | neural network | |
| dc.title | Inference by Reparameterization using Neural Population Codes | |
| dc.type | Thesis | |
| dc.type.material | Text | |
| thesis.degree.department | Electrical and Computer Engineering | |
| thesis.degree.discipline | Engineering | |
| thesis.degree.grantor | Rice University | |
| thesis.degree.level | Masters | |
| thesis.degree.name | Master of Science |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- VASUDEVARAJU-DOCUMENT-2015.pdf
- Size:
- 5.9 MB
- Format:
- Adobe Portable Document Format