Mean-Field Approximations for Coupled Populations of Generalized Linear Model Spiking Neurons with Markov Refractoriness

2009 ◽  
Vol 21 (5) ◽  
pp. 1203-1243 ◽  
Author(s):  
Taro Toyoizumi ◽  
Kamiar Rahnama Rad ◽  
Liam Paninski

There has recently been a great deal of interest in inferring network connectivity from the spike trains in populations of neurons. One class of useful models that can be fit easily to spiking data is based on generalized linear point process models from statistics. Once the parameters for these models are fit, the analyst is left with a nonlinear spiking network model with delays, which in general may be very difficult to understand analytically. Here we develop mean-field methods for approximating the stimulus-driven firing rates (in both the time-varying and steady-state cases), auto- and cross-correlations, and stimulus-dependent filtering properties of these networks. These approximations are valid when the contributions of individual network coupling terms are small and, hence, the total input to a neuron is approximately gaussian. These approximations lead to deterministic ordinary differential equations that are much easier to solve and analyze than direct Monte Carlo simulation of the network activity. These approximations also provide an analytical way to evaluate the linear input-output filter of neurons and how the filters are modulated by network interactions and some stimulus feature. Finally, in the case of strong refractory effects, the mean-field approximations in the generalized linear model become inaccurate; therefore, we introduce a model that captures strong refractoriness, retains all of the easy fitting properties of the standard generalized linear model, and leads to much more accurate approximations of mean firing rates and cross-correlations that retain fine temporal behaviors.

2001 ◽  
Vol 15 ◽  
pp. 91-114 ◽  
Author(s):  
C. Bhattacharyya ◽  
S. S. Keerthi

The chief aim of this paper is to propose mean-field approximations for a broad class of Belief networks, of which sigmoid and noisy-or networks can be seen as special cases. The approximations are based on a powerful mean-field theory suggested by Plefka. We show that Saul, Jaakkola and Jordan' s approach is the first order approximation in Plefka's approach, via a variational derivation. The application of Plefka's theory to belief networks is not computationally tractable. To tackle this problem we propose new approximations based on Taylor series. Small scale experiments show that the proposed schemes are attractive.


2015 ◽  
Vol 26 (3) ◽  
pp. 545-555 ◽  
Author(s):  
Futao Guo ◽  
Guangyu Wang ◽  
John L. Innes ◽  
Xiangqing Ma ◽  
Long Sun ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document