Export to

• Google Calendar
• iCalendar file
• hCalendar markup
  <div class="vevent h-event"> <h1 class="summary p-name">Efficiently Learning Probabilistic Graphical Models</h1> <div class='date'><time class="dtstart dt-start" title="2012-04-10T10:15:00" datetime="2012-04-10T10:15:00">Tuesday, April 10, 2012 from 10:15</time>–<time class="dtend dt-end" title="2012-04-10T11:15:00" datetime="2012-04-10T11:15:00">11:15am</time></div> <div class="location vcard p-location h-card"> <a class="url" href='http://calagator.org/venues/202391953'><span class='fn org p-name'>Portland State University FAB, Room 86-09</span></a> <div class="adr p-adr h-adr"> <div class="street-address p-street-address">1900 SW Fourth Avenue</div> <span class="locality p-locality">Portland</span> , <span class="region p-region">Oregon</span> <span class="postal-code p-postal-code">97201</span> <div class="country-name p-country-name">US</div> (<a href='https://maps.google.com/maps?q=1900%20SW%20Fourth%20Avenue,%20Portland%20Oregon%2097201%20US'>map</a>) </div> </div> <div class="description p-description"> <p>Abstract:</p> <p>Probabilistic graphical models are used to represent uncertainty in many domains, such as error-correcting codes, computational biology, sensor networks and medical diagnosis. This talk will discuss two approaches to the problem of learning graphical models from data, focusing on computational challenges. The first is marginalization-based learning, where parameters are fit in the context of a specific approximate inference algorithm. This will include results on image processing and computer vision problems. The second is recent work on Markov chain Monte Carlo based learning, inspired by a computational biology project.</p> </div> <h3>Links</h3> <ul> <li><a class="url u-url" href="http://www.pdx.edu/computer-science/colloquium-and-other-events-0">Website</a></li> </ul> </div>