ARC Colloquium: Ainesh Bakshi (CMU)

*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************

Event Details
  • Date/Time:
    • Monday January 31, 2022
      11:00 am - 12:00 pm
  • Location: Virtual via BlueJeans
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: Analytic Techniques for Robust Algorithm Design - Virtual via BlueJeans at 11am

Full Summary: No summary paragraph submitted.

Algorithms & Randomness Center (ARC)

Ainesh Bakshi (CMU)

Monday, January 31, 2022

Virtual via BlueJeans - 11:00 am

 

Title:  Analytic Techniques for Robust Algorithm Design

Abstract:  Modern machine learning relies on algorithms that fit expressive models to large datasets. While such tasks are easy in low dimensions, real-world datasets are truly high-dimensional. Additionally, a prerequisite to deploying models in real-world systems is to ensure that their behavior degrades gracefully when the modeling assumptions no longer hold. Therefore, there is a growing need for efficient algorithms that fit reliable and robust models to data.

In this talk, I will provide an overview of designing such efficient and robust algorithms, with provable guarantees, for fundamental tasks in machine learning and statistics. In particular, I will describe two complementary themes arising in this area: high-dimensional robust statistics and fast numerical linear algebra. The first addresses how to fit expressive models to high-dimensional datasets in the presence of outliers and the second develops fast algorithmic primitives to reduce dimensionality and de-noise large datasets. I will focus on recent results on robustly learning mixtures of arbitrary Gaussians and describe the new algorithmic ideas obtained along the way. Finally, I will make the case for analytic techniques, such as convex relaxations, being the natural choice for robust algorithm design. 

----------------------------------

Speaker's Webpage

Videos of recent talks are available at: https://smartech.gatech.edu/handle/1853/46836

Click here to subscribe to the seminar email list: arc-colloq@Klauscc.gatech.edu

Additional Information

In Campus Calendar
No
Groups

ARC

Invited Audience
Faculty/Staff, Postdoc, Graduate students, Undergraduate students
Categories
Seminar/Lecture/Colloquium
Keywords
No keywords were submitted.
Status
  • Created By: Francella Tonge
  • Workflow Status: Published
  • Created On: Jan 21, 2022 - 3:52pm
  • Last Updated: Jan 24, 2022 - 3:43pm