Show simple item record

dc.contributor.authorGaluske, Ralf
dc.contributor.authorWilliams, Ziv
dc.contributor.authorPipa, Gordon
dc.contributor.authorHaslinger, Robert Heinz
dc.contributor.authorBa, Demba E.
dc.date.accessioned2013-09-18T12:34:00Z
dc.date.available2013-09-18T12:34:00Z
dc.date.issued2013-07
dc.date.submitted2013-01
dc.identifier.issn1662-5188
dc.identifier.urihttp://hdl.handle.net/1721.1/80783
dc.description.abstractIsing models are routinely used to quantify the second order, functional structure of neural populations. With some recent exceptions, they generally do not include the influence of time varying stimulus drive. Yet if the dynamics of network function are to be understood, time varying stimuli must be taken into account. Inclusion of stimulus drive carries a heavy computational burden because the partition function becomes stimulus dependent and must be separately calculated for all unique stimuli observed. This potentially increases computation time by the length of the data set. Here we present an extremely fast, yet simply implemented, method for approximating the stimulus dependent partition function in minutes or seconds. Noting that the most probable spike patterns (which are few) occur in the training data, we sum partition function terms corresponding to those patterns explicitly. We then approximate the sum over the remaining patterns (which are improbable, but many) by casting it in terms of the stimulus modulated missing mass (total stimulus dependent probability of all patterns not observed in the training data). We use a product of conditioned logistic regression models to approximate the stimulus modulated missing mass. This method has complexity of roughly O(LNN[subscript pat]) where is L the data length, N the number of neurons and N[subscript pat] the number of unique patterns in the data, contrasting with the O(L2[superscript N]) complexity of alternate methods. Using multiple unit recordings from rat hippocampus, macaque DLPFC and cat Area 18 we demonstrate our method requires orders of magnitude less computation time than Monte Carlo methods and can approximate the stimulus driven partition function more accurately than either Monte Carlo methods or deterministic approximations. This advance allows stimuli to be easily included in Ising models making them suitable for studying population based stimulus encoding.en_US
dc.description.sponsorshipNational Institutes of Health (U.S.) (Grant K25 NS052422-02)en_US
dc.language.isoen_US
dc.publisherFrontiers Research Foundationen_US
dc.relation.isversionofhttp://dx.doi.org/10.3389/fncom.2013.00096en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceFrontiers Research Foundationen_US
dc.titleMissing mass approximations for the partition function of stimulus driven Ising modelsen_US
dc.typeArticleen_US
dc.identifier.citationHaslinger, Robert, Demba Ba, Ralf Galuske, Ziv Williams, and Gordon Pipa. “Missing mass approximations for the partition function of stimulus driven Ising models.” Frontiers in Computational Neuroscience 7 (2013).en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Brain and Cognitive Sciencesen_US
dc.contributor.mitauthorHaslinger, Robert Heinzen_US
dc.contributor.mitauthorBa, Demba E.en_US
dc.relation.journalFrontiers in Computational Neuroscienceen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsHaslinger, Robert; Ba, Demba; Galuske, Ralf; Williams, Ziv; Pipa, Gordonen_US
mit.licensePUBLISHER_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record