Spectral dimensionality reduction for HMMs

Details Spectral dimensionality reduction for HMMs Spectral dimensionality reduction for HMMs

2012-03-28

arxiv.org/abs/1203.6130v1

Statistics

Machine Learning

Scientific paper

Hidden Markov Models (HMMs) can be accurately approximated using co-occurrence frequencies of pairs and triples of observations by using a fast spectral method in contrast to the usual slow methods like EM or Gibbs sampling. We provide a new spectral method which significantly reduces the number of model parameters that need to be estimated, and generates a sample complexity that does not depend on the size of the observation vocabulary. We present an elementary proof giving bounds on the relative accuracy of probability estimates from our model. (Correlaries show our bounds can be weakened to provide either L1 bounds or KL bounds which provide easier direct comparisons to previous work.) Our theorem uses conditions that are checkable from the data, instead of putting conditions on the unobservable Markov transition matrix.

Affiliated with

Also associated with

No associations

Rating

Spectral dimensionality reduction for HMMs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spectral dimensionality reduction for HMMs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spectral dimensionality reduction for HMMs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-271687