ieee cdc workshop, dec. 8, 2008
DESCRIPTION
IEEE CDC Workshop, Dec. 8, 2008. Modeling Neuronal Multi-Unit Activity and Neural Dynamics. Zhe (Sage) Chen [email protected] Neuroscience Statistics Research Laboratory MGH/HMS/MIT. Acknowledgment. Emery N. Brown (MIT/Harvard/MGH) Matt A. Wilson (MIT) Sujith Vijayan (Harvard/BU) - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/1.jpg)
IEEE CDC Workshop, Dec. 8, 2008IEEE CDC Workshop, Dec. 8, 2008
![Page 2: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/2.jpg)
Modeling Neuronal Multi-Unit Activity and Neural DynamicsModeling Neuronal Multi-Unit Activity and Neural Dynamics
Zhe (Sage) Chen
[email protected] Statistics Research Laboratory
MGH/HMS/MIT
Zhe (Sage) Chen
[email protected] Statistics Research Laboratory
MGH/HMS/MIT
![Page 3: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/3.jpg)
AcknowledgmentAcknowledgment
•Emery N. Brown (MIT/Harvard/MGH)
•Matt A. Wilson (MIT)
•Sujith Vijayan (Harvard/BU)
•Riccardo Barbieri (MGH/HMS)
•Emery N. Brown (MIT/Harvard/MGH)
•Matt A. Wilson (MIT)
•Sujith Vijayan (Harvard/BU)
•Riccardo Barbieri (MGH/HMS)
![Page 4: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/4.jpg)
OutlineOutline
•Brief overview of extracellular recordings: SUA, MUA, LFP
•MUA: properties and examples
•Neural dynamics and the “state” of network
•Case study: probabilistic models for estimating neuronal “UP/DOWN” states with MUA
•Brief overview of extracellular recordings: SUA, MUA, LFP
•MUA: properties and examples
•Neural dynamics and the “state” of network
•Case study: probabilistic models for estimating neuronal “UP/DOWN” states with MUA
![Page 5: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/5.jpg)
LFP (<100~150 Hz)LFP (<100~150 Hz)MUA (300~6000 MUA (300~6000
Hz)Hz)
SUA (spike sorting)SUA (spike sorting)MSP (spike detection)MSP (spike detection)
![Page 6: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/6.jpg)
MUA PropertiesMUA Properties•What is MUA? : weighted sum of N single-unit
activity (N can be either known or unknown)
•a weighted average of neural activity around the electrode tip in a region (140~300 μm) smaller than LFP but larger than SUA
•easy to process, recordings stable, information rich
•with spike detection-->might contain noisy spikes (false positives)
•mutual info of MUA is greatest when SUA are independent
•What is MUA? : weighted sum of N single-unit activity (N can be either known or unknown)
•a weighted average of neural activity around the electrode tip in a region (140~300 μm) smaller than LFP but larger than SUA
•easy to process, recordings stable, information rich
•with spike detection-->might contain noisy spikes (false positives)
•mutual info of MUA is greatest when SUA are independent
![Page 7: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/7.jpg)
How MUA can be used?How MUA can be used?
•Simultaneously measuring brain activity during behavior task (Buchwald et al., Nature, 1965)
•Analyzing neuronal dynamics during sleep (Ji and Wilson, Nature Neurosci., 2007)
•Analyzing coherence between LFP, SUA, MUA (Zeitler, Fries, and Gielen, Neural Comput, 2006)
•Neuronal decoding (Stark and Abeles, J. Neurosci, 2007; Won and Wolf, Network, 2004)
•Simultaneously measuring brain activity during behavior task (Buchwald et al., Nature, 1965)
•Analyzing neuronal dynamics during sleep (Ji and Wilson, Nature Neurosci., 2007)
•Analyzing coherence between LFP, SUA, MUA (Zeitler, Fries, and Gielen, Neural Comput, 2006)
•Neuronal decoding (Stark and Abeles, J. Neurosci, 2007; Won and Wolf, Network, 2004)
ExamplesExamples
![Page 8: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/8.jpg)
Example: MUA across different whisker intensity levelsExample: MUA across different whisker intensity levels
somatosensory cortex somatosensory cortex (rat)(rat)
from Dr. Anna Devorfrom Dr. Anna Devor(MGH/UCSD)(MGH/UCSD)
Time (s)Time (s)
![Page 9: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/9.jpg)
Example: Motor cortexExample: Motor cortexraw signalraw signal
LFPLFP
MUAMUA
SUASUA
Stark and Abeles, Stark and Abeles, “Predicting “Predicting
Movement from Movement from multiunit activity” multiunit activity” J. Neurosci., 2007J. Neurosci., 2007
Neuronal decoding Neuronal decoding (movement prediction)(movement prediction)
![Page 10: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/10.jpg)
Neural (State) DynamicsNeural (State) Dynamics
•The neural systems (neurons) can shift between different computational modes or between ranges of operation (e.g., change in response gain) at different timescales.
•externally-driven dynamics: results from changes in external stimuli factors (e.g., sensory adaptation, encoding of sensory percepts)
• internally-driven dynamics: results from changes in internal factors (e.g., attention shift, change of conductance or membrane potential)
•The neural systems (neurons) can shift between different computational modes or between ranges of operation (e.g., change in response gain) at different timescales.
•externally-driven dynamics: results from changes in external stimuli factors (e.g., sensory adaptation, encoding of sensory percepts)
• internally-driven dynamics: results from changes in internal factors (e.g., attention shift, change of conductance or membrane potential)
![Page 11: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/11.jpg)
State of Neurons/Network
State of Neurons/Network•Modified by many factors, such as
membrane potentials, synaptic activities, conductance, top-down attention, etc.
•change at different levels of anesthesia or sleep stages
•spontaneous self-organization by a balance of excitatory and inhibitory neurons in recurrent network
•measurements of neuronal state (MUA, LFP)
•Modified by many factors, such as membrane potentials, synaptic activities, conductance, top-down attention, etc.
•change at different levels of anesthesia or sleep stages
•spontaneous self-organization by a balance of excitatory and inhibitory neurons in recurrent network
•measurements of neuronal state (MUA, LFP)
Haider et al. J. Neurosci 2006; Fontanini & Katz, J. Neurophy., 2008Haider et al. J. Neurosci 2006; Fontanini & Katz, J. Neurophy., 2008
Buzaki/Kopell/Wilson/McCormick/Donald Katz Buzaki/Kopell/Wilson/McCormick/Donald Katz
![Page 12: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/12.jpg)
A case study: Probabilistic models for
estimating neuronal UP/DOWN states
A case study: Probabilistic models for
estimating neuronal UP/DOWN states
![Page 13: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/13.jpg)
UP/DOWN statesUP/DOWN states• the periodic fluctuations between
increased/decreased spiking activity of a neuronal population (Sirota et al., PNAS, 2003; Hahn et al., PNAS, 2007)
• intracellular: membrane potential fluctuations define two states of neocortex (membrane potential greater/smaller than the resting threshold, -70~-80 mV)
•extracellular: LFP, MUA
•observed from anesthetized/behaving animals (during sleep) in a variety of brain regions (visual, somatosensory, hippocampus, basal ganglia ...)
• the periodic fluctuations between increased/decreased spiking activity of a neuronal population (Sirota et al., PNAS, 2003; Hahn et al., PNAS, 2007)
• intracellular: membrane potential fluctuations define two states of neocortex (membrane potential greater/smaller than the resting threshold, -70~-80 mV)
•extracellular: LFP, MUA
•observed from anesthetized/behaving animals (during sleep) in a variety of brain regions (visual, somatosensory, hippocampus, basal ganglia ...)
![Page 14: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/14.jpg)
Ji & Wilson, Ji & Wilson, Nature Neurosci.Nature Neurosci., 2007, 2007
visuavisuall
![Page 15: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/15.jpg)
Threshold-based method
Threshold-based method
Ji & Wilson, 2007Ji & Wilson, 2007
![Page 16: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/16.jpg)
ObjectivesObjectives•Building statistical probabilistic
(generative) models to represent the MUA spike trains data
•Representing uncertainties with prob.
•Modeling the transition prob. (survival prob.) of two states
•Building statistical probabilistic (generative) models to represent the MUA spike trains data
•Representing uncertainties with prob.
•Modeling the transition prob. (survival prob.) of two states
![Page 17: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/17.jpg)
Data RecordingData Recording
•Pre-RUN sleep --- RUN --- Post-RUN sleep
•Simultaneous recordings of primary somatosensory cortex (SI) & hippocampus from several behaving rats
•EEG/EMG/MUA (6-9 tetrodes)
•Sleep classification (REM, SWS, transitory)
•Pre-RUN sleep --- RUN --- Post-RUN sleep
•Simultaneous recordings of primary somatosensory cortex (SI) & hippocampus from several behaving rats
•EEG/EMG/MUA (6-9 tetrodes)
•Sleep classification (REM, SWS, transitory)
Monitoring location Monitoring location of rat using LEDof rat using LED
R e w a r d S i t e
T e x t u r e
by Sujith Vijayanby Sujith Vijayan
![Page 18: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/18.jpg)
![Page 19: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/19.jpg)
Modeling & EstimationModeling & Estimation
•UP and DOWN states, S(t), are treated as discrete r.v. (1/0) drawn from a hidden Markov process
•Observations: MUA spike trains (modulated by the hidden state) --- doubly stochastic process
•Estimation task: infer the hidden states (when and how many transitions occur) and the transition prob.
•UP and DOWN states, S(t), are treated as discrete r.v. (1/0) drawn from a hidden Markov process
•Observations: MUA spike trains (modulated by the hidden state) --- doubly stochastic process
•Estimation task: infer the hidden states (when and how many transitions occur) and the transition prob.
S(t-1)
S(t-1)S(t-1) S(t)S(t) S(t+T)S(t+T)
y(t-1)y(t-1) y(t)y(t) y(t+T)y(t+T)
![Page 20: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/20.jpg)
Comparsion of discrete- & continuous-time
models
Comparsion of discrete- & continuous-time
models
spike counts spikes (0/1)
bin size (10-20 ms) arbitrary small (1 ms)
transition constrained by bin size any time
first-order Markovian semi-Markovian
![Page 21: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/21.jpg)
Hidden Markov model (HMM)
Hidden Markov model (HMM)•stationary probabilistic model with three
elements: initial prob., transition prob., emission prob
• 11
•
•
•stationary probabilistic model with three elements: initial prob., transition prob., emission prob
• 11
•
•
inhomogeneous Poissoninhomogeneous Poisson
baselinebaseline statestate spiking historyspiking history
-1-1
![Page 22: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/22.jpg)
EM algorithmEM algorithm•Missing data problems (statistics, speech
recognition, signal processing, & communication)
•principle: maximum likelihood estimation
•expectation maximization (EM) algorithm E-step: Estimate the hidden state sufficient stat. M-step: Estimate the unknown parameters Iterative procedure until convergence
•HMM --- Baum-Welch (forward-backward) algorithm & Viterbi algorithm
•Missing data problems (statistics, speech recognition, signal processing, & communication)
•principle: maximum likelihood estimation
•expectation maximization (EM) algorithm E-step: Estimate the hidden state sufficient stat. M-step: Estimate the unknown parameters Iterative procedure until convergence
•HMM --- Baum-Welch (forward-backward) algorithm & Viterbi algorithm
![Page 23: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/23.jpg)
EM (continued)EM (continued)•Q-function
•sufficient stat.
•
•
•Q-function
•sufficient stat.
•
•
![Page 24: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/24.jpg)
EM (continued)EM (continued)• forward-backward
•M-step (reestimation)
•Newton (iterative fixed-point optimization)
•
• forward-backward
•M-step (reestimation)
•Newton (iterative fixed-point optimization)
•
![Page 25: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/25.jpg)
Continuous-time modelContinuous-time model•“single-step transition’’ is no longer valid
•state transition prob. time-varying (depending on time), modeled either parametrically or nonparametrically
•survival function
• Choices of F(z): Markov or semi-Markov
•“single-step transition’’ is no longer valid
•state transition prob. time-varying (depending on time), modeled either parametrically or nonparametrically
•survival function
• Choices of F(z): Markov or semi-Markov
![Page 26: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/26.jpg)
Ji & Wilson, 2007Ji & Wilson, 2007
UP and DOWN States UP and DOWN States Duration Histograms Duration Histograms
Non-exponentialNon-exponential!!!!!!
![Page 27: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/27.jpg)
ExamplesExamples
• In our case, we fit the histogram with 2-parameter parametric model for UP/DOWN state
•To be more precise, the model pdf is a censored version of the original pdf
•
• In our case, we fit the histogram with 2-parameter parametric model for UP/DOWN state
•To be more precise, the model pdf is a censored version of the original pdf
•
![Page 28: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/28.jpg)
DetailsDetails•Conditional intensity function (generalized “rate”)
•Observed likelihood
• Joint log-likelihood
•Conditional intensity function (generalized “rate”)
•Observed likelihood
• Joint log-likelihood
( | ) Pr(pike in [, )| )t tt H s t t Hλ Δ≈ +Δ
![Page 29: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/29.jpg)
Monte Carlo EMMonte Carlo EM
•Continuous-time model: E-step is difficult to compute analytically (since the total number & the locations of state transitions are both unknown)
• Idea: replace E-step with Monte Carlo E-step, M-step remains unchanged (if the M-step uses Gibbs sampling, then it is a fully Bayesian estimation)
•Use HMM-EM estimate as the initial condition
•Derive a reversible jump MCMC algorithm to allow dimensionality change (the number of transitions)
•Continuous-time model: E-step is difficult to compute analytically (since the total number & the locations of state transitions are both unknown)
• Idea: replace E-step with Monte Carlo E-step, M-step remains unchanged (if the M-step uses Gibbs sampling, then it is a fully Bayesian estimation)
•Use HMM-EM estimate as the initial condition
•Derive a reversible jump MCMC algorithm to allow dimensionality change (the number of transitions)
![Page 30: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/30.jpg)
Reversible-jump MCMCReversible-jump MCMC
•A Metropolis-Hastings type MCMC with trans-dimensional proposal (Green, 1995)
•Allow the Markov chain to jump between two parameter spaces with different dim.
•example: change point detection, mixture modeling, object detection, etc.
•Design of efficient proposal distribution (non-unique, prior knowledge helps, likelihood-based data-driven) --- improve the acceptance rate
•A Metropolis-Hastings type MCMC with trans-dimensional proposal (Green, 1995)
•Allow the Markov chain to jump between two parameter spaces with different dim.
•example: change point detection, mixture modeling, object detection, etc.
•Design of efficient proposal distribution (non-unique, prior knowledge helps, likelihood-based data-driven) --- improve the acceptance rate
![Page 31: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/31.jpg)
A bit detailA bit detail
•Consider seven proposals, 6 of them change dim.
•1) move the boundary; 2) merge two neighboring states; 3) delete one intermediate sojourn; 4-5) insert/delete the first sojourn; 6-7) insert/delete the last sojourn
•Acceptance prob.
•
•
•Consider seven proposals, 6 of them change dim.
•1) move the boundary; 2) merge two neighboring states; 3) delete one intermediate sojourn; 4-5) insert/delete the first sojourn; 6-7) insert/delete the last sojourn
•Acceptance prob.
•
•
![Page 32: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/32.jpg)
Algorithmic procedureAlgorithmic procedure
Convergence diagnosis: single chain, log-likelihoodConvergence diagnosis: single chain, log-likelihoodPosterior dist. of Posterior dist. of SS(t): burn-in period & thinning (t): burn-in period & thinning
![Page 33: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/33.jpg)
Experimental resultsExperimental results
•Validate the models and algorithms via synthetic spike train data
•Apply the models to real-world 15-min SWS cortical spike train data
•Plot EEG-triggered average
•Goodness-of-fit tests for the model
•Validate the models and algorithms via synthetic spike train data
•Apply the models to real-world 15-min SWS cortical spike train data
•Plot EEG-triggered average
•Goodness-of-fit tests for the model
![Page 34: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/34.jpg)
Synthetic dataSynthetic data
![Page 35: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/35.jpg)
![Page 36: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/36.jpg)
Real dataReal data
![Page 37: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/37.jpg)
![Page 38: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/38.jpg)
K-complexK-complex
![Page 39: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/39.jpg)
Method comparisonMethod comparison
2986 2986
no. jumps no. jumps
3223 3223
2576 2576 (occurrence rate: (occurrence rate:
82 /min) 82 /min)
2576 2576
![Page 40: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/40.jpg)
KS plot KS plot
•go•go
Goodness-of-fit: Kolmogorov-Smirnov (KS) test Goodness-of-fit: Kolmogorov-Smirnov (KS) test from the time-rescaling theorem (Brown et al., 2002)from the time-rescaling theorem (Brown et al., 2002)
![Page 41: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/41.jpg)
Possible model extension
Possible model extension
• Incorporation of continuous-time LFP observations into the likelihood model
•Fully Bayesian method (imposing priors to the model parameters)
•discrete prob. model for the state duration distribution
• Incorporation of continuous-time LFP observations into the likelihood model
•Fully Bayesian method (imposing priors to the model parameters)
•discrete prob. model for the state duration distribution
![Page 42: IEEE CDC Workshop, Dec. 8, 2008](https://reader036.vdocuments.us/reader036/viewer/2022062321/56812b93550346895d8fb262/html5/thumbnails/42.jpg)
Take home messageTake home message•Probabilistic generative models are useful
for representing the uncertainties of data (in contrast, threshold-based method is ad hoc and very data-dependent)
•“All models are wrong, but some are useful.” --- George Box
•Continuous-time model is more accurate in characterizing & segmenting the UP/DOWN states, but it is more computationally demanding
•Model limitation: currently assumed to be stationary and model is identical across all spike trains (independent)
•Probabilistic generative models are useful for representing the uncertainties of data (in contrast, threshold-based method is ad hoc and very data-dependent)
•“All models are wrong, but some are useful.” --- George Box
•Continuous-time model is more accurate in characterizing & segmenting the UP/DOWN states, but it is more computationally demanding
•Model limitation: currently assumed to be stationary and model is identical across all spike trains (independent)