On the trade-off between complexity and correlation decay in structural learning algorithms

Details On the trade-off between complexity and correlation decay in structural learning algorithms On the trade-off between complexity and correlation decay in structural learning algorithms

2011-10-08

arxiv.org/abs/1110.1769v1

Statistics

Machine Learning

Scientific paper

We consider the problem of learning the structure of Ising models (pairwise binary Markov random fields) from i.i.d. samples. While several methods have been proposed to accomplish this task, their relative merits and limitations remain somewhat obscure. By analyzing a number of concrete examples, we show that low-complexity algorithms often fail when the Markov random field develops long-range correlations. More precisely, this phenomenon appears to be related to the Ising model phase transition (although it does not coincide with it).

Affiliated with

Also associated with

No associations

Rating

On the trade-off between complexity and correlation decay in structural learning algorithms 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 On the trade-off between complexity and correlation decay in structural learning algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the trade-off between complexity and correlation decay in structural learning algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-87684