Download Stockholm University

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Recurrent neural network wikipedia , lookup

Neuropsychopharmacology wikipedia , lookup

Synaptic gating wikipedia , lookup

Neural modeling fields wikipedia , lookup

Machine learning wikipedia , lookup

Time series wikipedia , lookup

Types of artificial neural networks wikipedia , lookup

Cognitive neuroscience wikipedia , lookup

Neural coding wikipedia , lookup

Biological neuron model wikipedia , lookup

Neurophilosophy wikipedia , lookup

Neuroinformatics wikipedia , lookup

Nervous system network models wikipedia , lookup

Transcript
Stockholm University
This is a published version of a paper published in BMC neuroscience (Online).
Citation for the published paper:
Roudi, Y., Tyrcha, J., Hertz, J. (2009)
"Fast and realiable methods for extracting functional connectivity in large populations"
BMC neuroscience (Online), 10
Access to the published version may require subscription.
Permanent link to this version:
http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-72501
http://su.diva-portal.org
BMC Neuroscience
BioMed Central
Open Access
Oral presentation
Fast and reliable methods for extracting functional connectivity in
large populations
Yasser Roudi*1, Joanna Tyrcha2 and John Hertz1,3
Address: 1NORDITA, Roslagstullsbacken 23, 10691 Stockholm, Sweden, 2Dept of Mathematical Statistics, Stockholm University, 10691
Stockholm, Sweden and 3The Niels Bohr Institute, Copenhagen University, 2100 Copenhagen, Denmark
Email: Yasser Roudi* - [email protected]
* Corresponding author
from Eighteenth Annual Computational Neuroscience Meeting: CNS*2009
Berlin, Germany. 18–23 July 2009
Published: 13 July 2009
BMC Neuroscience 2009, 10(Suppl 1):O9
doi:10.1186/1471-2202-10-S1-O9
<supplement> <title> <p>Eighteenth Annual Computational Neuroscience Meeting: CNS*2009</p> </title> <editor>Don H Johnson</editor> <note>Meeting abstracts – A single PDF containing all abstracts in this Supplement is available <a href="http://www.biomedcentral.com/content/files/pdf/1471-2202-10-S1-full.pdf">here</a>.</note> <url>http://www.biomedcentral.com/content/pdf/1471-2202-10-S1-info.pdf</url> </supplement>
This abstract is available from: http://www.biomedcentral.com/1471-2202/10/S1/O9
© 2009 Roudi et al; licensee BioMed Central Ltd.
The simplest model for describing multi-neuron spike statistics is the pairwise Ising model [1,2]. To start, one
divides the spike trains into small time bins, and to each
neuron i and each time bin t assigns a binary variables si(t)
= -1 if neuron i has not emitted any spikes in that time bin
and 1 if it has emitted one or more spikes. One then can
construct an Ising model, P(s) = Z-1exp{h's+s'Js} for the
spike patterns with the same means and pair correlations
as the data, using Boltzmann learning, which is in principle exact. The elements Jij, of the matrix J can be considered to be functional couplings. However, Boltzmann
learning is prohibitively time-consuming for large networks. Here, we compare the results from five fast approximate methods for finding the couplings with those from
Boltzmann learning.
We used data from a simulated network of spiking neurons operating in a balanced state of asynchronous firing
with a mean rate of ~10 Hz for excitatory neurons.
Employing a bin size of 10 ms, we performed Boltzmann
learning to fit Ising models for populations of size N up to
200 excitatory neurons chosen randomly from the 800 in
the simulated network. We studied the following methods: A) a naive mean-field approximation, for which J is
equal to the negative of the inverse covariance matrix, B)
an independent-pair approximation, C) a low rate, smallpopulation approximation (the low-rate limit of (B),
which is valid generally in the limit of small Nrt, where r
is the average rate (spikes/time bin) and t is the bin width
[3], D) inversion of the TAP equations from spin-glass
theory [4] and E) a weak-correlation approximation proposed recently by Sessak and Monasson [5]. We quantified the quality of these approximations, as functions of
N, by computing the RMS error and R2, treating the Boltzmann couplings as the true ones. We found, as shown in
figure 1, that while all the approximations are good for
small N, the TAP, Sessak-Monasson, and, in particular,
their average outperform the others by a relatively large
margin for N. Thus, these methods offer a useful tool for
fast analysis of multineuron spike data.
References
1.
2.
3.
4.
5.
Schneidman E, Berry MJ 2nd, Segev R, Bialek W: Weak pairwise
correlations imply strongly correlated network states in a
neural population. Nature 2006, 440:1007-1012.
Shlens J, Field GD, Gauthier JL, Grivich MI, Petrusca D, Sher A, Litke
AM, Chichilnisky EJ: The structure of multi-neuron firing patterns in primate retina. J Neurosci 2008, 28:505-518.
Roudi Y, Nirenberg S, Latham P: Pairwise maximum entropy
models for large biological systems: when they can and when
they can't work. . arXiv:0811.0903v1 [q-bio.QM].
Tanaka T: Mean-field theory of Boltzmann machine learning.
Phys Rev E 1998, 58:2302-2310.
Sessak V, Monasson R: Small-correlation expansions for the
inverse Ising problem. J Phys A 2009, 42:055001.
Page 1 of 2
(page number not for citation purposes)
BMC Neuroscience 2009, 10(Suppl 1):O9
http://www.biomedcentral.com/1471-2202/10/S1/O9
Figure
(a) R2 and
1 (b) RMS error for various approximate methods
(a) R2 and (b) RMS error for various approximate methods. Green (dashed dotted), naive mean-field; Purple (dashed
double-dotted) low-rate, small N; Gray (dotted) independent-pair; Red (dashed), TAP; Black (dashed), Sessak-Monasson; Blue,
average of TAP and Sessak-Monasson.
Publish with Bio Med Central and every
scientist can read your work free of charge
"BioMed Central will be the most significant development for
disseminating the results of biomedical researc h in our lifetime."
Sir Paul Nurse, Cancer Research UK
Your research papers will be:
available free of charge to the entire biomedical community
peer reviewed and published immediately upon acceptance
cited in PubMed and archived on PubMed Central
yours — you keep the copyright
BioMedcentral
Submit your manuscript here:
http://www.biomedcentral.com/info/publishing_adv.asp
Page 2 of 2
(page number not for citation purposes)