Past Events
Faculty Candidate TalkScalable and Provably Robust Algorithms for Machine Learning |
|
||
Monday, April 04, 2022, 10:30am - 12:00pm |
|||
Zoom information:
Topic: Yu Cheng Faculty Candidate Talk
Time: Apr 4, 2022 10:30 AM Eastern Time (US and Canada)
Join Zoom Meeting
https://rutgers.zoom.us/j/92355324702?pwd=RFFxSjRKSlo4amg3OG5zbUxwTnpMUT09
Join by SIP
Meeting ID: 923 5532 4702
Password: 993116
One tap mobile
+13017158592,,92355324702# US (Washington DC)
+13126266799,,92355324702# US (Chicago)
Join By Phone
+1 301 715 8592 US (Washington DC)
+1 312 626 6799 US (Chicago)
+1 646 558 8656 US (New York)
+1 253 215 8782 US (Tacoma)
+1 346 248 7799 US (Houston)
+1 669 900 9128 US (San Jose)
Meeting ID: 923 5532 4702
Find your local number: https://rutgers.zoom.us/u/ac7D7FDzXX
Join by Skype for Business
https://rutgers.zoom.us/skype/92355324702
If you have any questions, please <a href="https://it.rutgers.edu/help-support/">contact the Office of Information Technology Help Desk</a>
Speaker: Yu Cheng
Bio
Yu Cheng is an assistant professor in the Mathematics department at the University of Illinois at Chicago. He obtained his Ph.D. in Computer Science from the University of Southern California. Before joining UIC, he was a postdoc at Duke University and a visiting member at the Institute for Advanced Study. His main research interests include machine learning, optimization, and game theory.
Location : Via Zoom
:
Event Type: Faculty Candidate Talk
Abstract: As machine learning plays a more prominent role in our society, we need learning algorithms that are reliable and robust. It is important to understand whether existing algorithms are robust against adversarial attacks and design new robust solutions that work under weaker assumptions. The long-term goal is to bridge the gap between the growing need for robust algorithms and the lack of systematic understanding of robustness. In this talk, I will discuss the challenges that arise in the design and analysis of robust algorithms for machine learning. I will focus on three lines of my recent work: (1) designing faster and simpler algorithms for high-dimensional robust statistics where a small fraction of the input data is arbitrarily corrupted, (2) analyzing the optimization landscape of non-convex approaches for low-rank matrix problems and making non-convex optimization robust against semi-random adversaries, and (3) considering learning in the presence of strategic behavior where the goal is to design good algorithms that account for the agents' strategic responses.
Organization:
Rutgers University School of Arts and Sciences
Contact Yongfeng Zhang