A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures

Statistics – Machine Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Accepted to the IEEE Transactions on Information Theory on Nov 18, 2010

Scientific paper

The problem of maximum-likelihood (ML) estimation of discrete tree-structured distributions is considered. Chow and Liu established that ML-estimation reduces to the construction of a maximum-weight spanning tree using the empirical mutual information quantities as the edge weights. Using the theory of large-deviations, we analyze the exponent associated with the error probability of the event that the ML-estimate of the Markov tree structure differs from the true tree structure, given a set of independently drawn samples. By exploiting the fact that the output of ML-estimation is a tree, we establish that the error exponent is equal to the exponential rate of decay of a single dominant crossover event. We prove that in this dominant crossover event, a non-neighbor node pair replaces a true edge of the distribution that is along the path of edges in the true tree graph connecting the nodes in the non-neighbor pair. Using ideas from Euclidean information theory, we then analyze the scenario of ML-estimation in the very noisy learning regime and show that the error exponent can be approximated as a ratio, which is interpreted as the signal-to-noise ratio (SNR) for learning tree distributions. We show via numerical experiments that in this regime, our SNR approximation is accurate.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures 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 A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-455189

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.