BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The limits of MAP inference by MWSS on perfect graphs - Dr Adrian 
 Weller (MLG\, University of Cambridge)
DTSTART:20150827T140000Z
DTEND:20150827T143000Z
UID:TALK60334@talks.cam.ac.uk
CONTACT:12852
DESCRIPTION:I shall briefly describe a recent\, promising method to perfor
 m MAP inference for discrete undirected graphical models based on reducing
  the optimization problem to finding a maximum weight stable set (MWSS) in
  a derived weighted graph\, which if perfect\, may be performed in time po
 lynomial in the number of variables. I shall discuss recent work (AISTATS 
 2015)\, where the limits of this approach were established for the class o
 f binary pairwise (Ising) models\, yielding a simple\, interesting charact
 erization.\n\nhttp://jmlr.org/proceedings/papers/v38/weller15.pdf 
LOCATION:Engineering Department\, CBL Room BE-438
END:VEVENT
END:VCALENDAR