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:20180907T181612
DTSTART;TZID=America/Detroit:20180907T160000
DTEND;TZID=America/Detroit:20180907T170000
SUMMARY:Workshop / Seminar:Student AIM Seminar Seminar
DESCRIPTION:For many machine learning tasks\, the input data lie on a low-dimensional manifold embedded in a high dimensional space and\, because of this high-dimensional structure\, most algorithms are inefficient. The typical solution is to reduce the dimension of the input data using standard dimension reduction or unsupervised metric learning algorithms such as ISOMAP\, LAPLACIAN EIGENMAPS or LLES. This approach\, however\, does not always work in practice as these algorithms require that we have somewhat ideal data. Unfortunately\, most data sets either have missing entries or unacceptably noisy values. That is\, real data are far from ideal and we cannot use these algorithms directly. In this paper\, we focus on the case when we have missing data. Some techniques\, such as matrix completion\, can be used to fill in missing data but these methods do not capture the non-linear structure of the manifold. Here\, we present a new algorithm MR-MISSING that extends these previous algorithms and can be used to compute low dimensional representation on data sets with missing entries. We demonstrate the effectiveness of our algorithm by running three different experiments. We visually verify the effectiveness of our algorithm on synthetic manifolds\, we numerically compare our projections against those computed by first filling in data using nlPCA and mDRUR on the MNIST data set\, and we also show that we can do classification on MNIST with missing data. We also provide a theoretical guarantee for MR-MISSING under some simplifying assumptions. Speaker(s): Rishi Sonthalia (University of Michigan)
UID:54546-13596470@events.umich.edu
URL:https://events.umich.edu/event/54546
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:East Hall - 1084
CONTACT:
END:VEVENT
END:VCALENDAR