BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210129T125334
DTSTART;TZID=America/Detroit:20210205T100000
DTEND;TZID=America/Detroit:20210205T110000
SUMMARY:Workshop / Seminar:Statistics Department Seminar Series: Laura Balzano\, Associate Professor\, Electrical Engineering and Computer Science\, University of Michigan
DESCRIPTION:Abstract: In order to draw inferences from large\, high-dimensional datasets\, we often seek simple structure that model the phenomena represented in those data. Low-rank linear structure is one of the most flexible and efficient such models\, allowing efficient prediction\, inference\, and anomaly detection. However\, classical techniques for learning low-rank models assume your data have only minor corruptions that are uniform over samples. Modern research in optimization has begun to develop new techniques to handle realistic messy data — where data are missing\, have wide variations in quality\, and/or are observed through nonlinear measurement systems.\n\nIn this talk we will focus on two problems. In the first\, our data are heteroscedastic\, ie\, corrupted by one of several noise variances. This is common in problems like sensor networks or medical imaging\, where different measurements of the same phenomenon are taken with different quality sensing (eg high or low radiation). In this context\, learning the low-rank structure via PCA suffers from treating all data samples as if they are equally informative. We will discuss our theoretical results on weighted PCA and new algorithms for the non-convex probabilistic PCA formulation of this problem. In the second part of the talk we will extend the matrix completion problem to cases where the columns are points on low-dimensional nonlinear algebraic varieties. We discuss two optimization approaches to this problem\, one kernelized algorithm and one that leverages existing LRMC techniques on a tensorized representation of the data. We also provide a formal mathematical justification for the success of our method and experimental results showing that the new approach outperforms existing state-of-the-art methods for matrix completion in many situations.\n\nhttps://web.eecs.umich.edu/~girasole/?page_id=10\n\nThis seminar will be livestreamed via Zoom https://umich.zoom.us/j/94350208889\nThere will be a virtual reception to follow
UID:80542-20738139@events.umich.edu
URL:https://events.umich.edu/event/80542
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:seminar
LOCATION:Off Campus Location
CONTACT:
END:VEVENT
END:VCALENDAR