BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The War on Loops - Frederik Eaton (CUED)
DTSTART:20080911T130000Z
DTEND:20080911T143000Z
UID:TALK13459@talks.cam.ac.uk
CONTACT:Shakir Mohamed
DESCRIPTION:It is well known that belief propagation is exact on trees\, i
 .e. graphs without loops\, although it often gives accurate results even o
 n graphs with loops. In this week's RCC I will discuss two approaches to i
 mproving the accuracy of BP on loopy graphs. The relevant papers are:\n\nJ
 M Mooij\, B Wemmenhove\, HJ Kappen\, T Rizzo\, "Loop Corrected Belief Prop
 agation":http://www.stat.umn.edu/~aistat/proceedings/data/papers/042.pdf\n
 \nM Chertkov\, VY Chernyak\, "Loop Calculus in Statistical Physics and Inf
 ormation Science":http://arxiv.org/pdf/cond-mat/0601487\n\nThe first paper
  describes an algorithm for propagating cavity distributions which is exac
 t in graphs with 1 loop. The second paper is a purely theoretical contribu
 tion which gives an expression for the partition function of a factor grap
 h with binary nodes in terms of a finite sum over "generalised loops" in a
  graphical representation called the "vertex model" (but doesn't describe 
 an algorithm).\n\nFor further reading\, both papers have extended versions
 :\n\nJ Mooij\, B Kappen\, "Loop corrections for approximate inference":htt
 p://arxiv.org/pdf/cs.AI/0612030\n\nM Chertkov\, VY Chernyak\, "Loop series
  for discrete statistical models on graphs":http://arxiv.org/pdf/cond-mat/
 0603189\n
LOCATION:Engineering Department\, CBL Room 438
END:VEVENT
END:VCALENDAR