BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20170222T005819Z
DTSTART;TZID=America/Los_Angeles:20170301T160000
DTEND;TZID=America/Los_Angeles:20170301T170000
TRANSP:OPAQUE
SUMMARY:Better understanding of non-convex methods in machine learning
UID:107340-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:306 Soda Hall
DESCRIPTION:Tengyu Ma\, Princeton University\n\nRecent breakthroughs in machine learning\, especially deep learning\, often involve learning complex and high-dimensional models on massive datasets with non-convex optimization. Though empirically successful\, the formal study of such non-convex methods is much less developed. My research aims to develop new algorithmic approaches and analysis tools in these settings. \n\nThe talk will showcase a few results. First\, we show that matrix completion — a famous problem in machine learning — can be solved by stochastic gradient descent on the straightforward non-convex objective function in polynomial time. (Formally\, we show that all local minima of the objective are also global minima.) Then\, we will analyze the landscape of the objective functions for linearized recurrent neural nets and residual nets\, and demonstrate that over-parameterization and re-parameterization of the models can make the optimization easier. \n\nBio: \nTengyu Ma is a PhD candidate at the Computer Science Department of Princeton University advised by Sanjeev Arora. His research interests include topics in machine learning and algorithms\, such as non-convex optimization\, representation learning\, deep learning\, and convex relaxation for machine learning problems. His research contributes to the theoretical developments of these topics with practical implication. He is a recipient of NIPS'16 best student paper award\, Princeton Honorific Fellowship\, Siebel Scholarship\, IBM PhD Fellowship\, and the Simons Award for Graduate Students in Theoretical Computer Science.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=107340&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20170222T005819Z
LAST-MODIFIED:20170222T161655Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR