this is for holding javascript data
Bobby edited untitled.html
over 8 years ago
Commit id: 2fe153fc4afea7ef9d45795e539418d8f4a74a50
deletions | additions
diff --git a/untitled.html b/untitled.html
index 4d1a124..2c3053d 100644
--- a/untitled.html
+++ b/untitled.html
...
genetic algorithm to estimate parameters of multiple neuron models. Of
particular interest, they propose genetic algorithms as a means of solving STRF
models. We applied this method as one means of estimating the parameters of an
augmented HR-neuron model that includes a sensory filter (DSTRF).
Affine Invariant MCMC
*Tyler - Will need to add in some generic information on how MCMC works, I guess?*
We also estimated neuron and filter parameters using a Markov Chain Monte Carlo ("MCMC") technique. MCMC provides some distinct advantages over other parameter estimation methods, such as variational methods. First, MCMC provides an estimate for the full posterior distribution of the parameters rather than just a single value. value as with genetic algorithms. Having the posterior distribution for the parameters is useful for drawing inferences from the uncertainty of the parameter estimates. Secondly, MCMC allows for a Bayesian approach to estimating the parameters. Prior knowledge or beliefs about the parameters may be used in the estimation procedure and then updated afterwards. Finally, MCMC is simple to run in parallel on multi-core or multi-processor computers, which allows for significant reductions in run time.
To sample from the posterior distribution, we used emcee, a Python package implementing an affine-invariant ensemble sampler (Foreman-Mackey et al. 2013). The affine-invariant sampler is insensitive to covariances between parameters and requires tuning of much fewer hyper-parameters than standard MCMC algorithms (Goodman and Weare 2010). Further, the ensemble method used by the sampler was designed to run in a parallel processing environment. Rather than having one chain randomly sampling the posterior distribution, the ensemble sampler has hundreds of small chains sampling at once. These features should allow the sampler to converge quicker than standard MCMC algorithms on good parameter estimations
Twin studies with simulated auditory and visual data
Validation with real data
Results
not sure we have much to go here yet
Figures
Let's get down some ideas for the figures we want. Don't worry about the order for now, we can rearrange.
Figure 1:
Figure 2:
Figure 3:
Figure 4:
Figure 5:
Figure 6:
Figure 7:
Figure 8:
References
Foreman-Mackey, D., Hogg, D. W., Lang, D., Goodman, J. (2013). emcee: The MCMC Hammer. PASP 125, 306-312.
Hindmarsh, J. L., and Rose, R. M. (1984) A model of neuronal bursting using three coupled first order differential equations. Proc. R. Soc. London, Ser. B 221, 87–102.
Hodgkin, A., and Huxley, A. (1952). A quantitative description of membrane current
and its application to conduction and excitation in nerve. J. Physiol. 117,
500–544.
Holland, J. H. (1973). Genetic algorithms and the optimal allocation of trials. SIAMJ. Comput.2, 88–105.
Izhikevich, E. M. (2003). Simple model of spiking neurons. IEEE Transactions on Neural Networks 14, 1569-1572.
Lynch, E. P., and Houghton, C. J. (2015). Parameter estimation of neuron models using in-vitro and in-vivo electrophysiological data. Frontiers in Neuroinformatics 9, 1-15.
van Rossum, M. (2001). A novel spike distance. Neural Comput. 13, 751–763.