00:00:00 / 00:00:00

Algorithmic robust statistics

By Ilias Diakonikolas

Appears in collection : Meeting in Mathematical Statistics: Statistical thinking in the age of AI : robustness, fairness and privacy / Rencontre de Statistique Mathématique

The field of Robust Statistics studies the problem of designing estimators that perform well even when the data significantly deviates from the idealized modeling assumptions. The classical statistical theory, going back to the pioneering works by Tukey and Huber in the 1960s, characterizes the information-theoretic limits of robust estimation for a number of statistical tasks. On the other hand, until fairly recently, the computational aspects of this field were poorly understood. Specifically, no scalable robust estimation methods were known in high dimensions, even for the most basic task of mean estimation. A recent line of work in computer science developed the first computationally efficient robust estimators in high dimensions for a range of learning tasks. This tutorial will provide an overview of these algorithmic developments and discuss some open problems in the area.

Information about the video

  • Date of recording 19/12/2023
  • Date of publication 08/01/2024
  • Institution CIRM
  • Licence CC BY NC ND
  • Language English
  • Director(s) Luca Recanzone
  • Format MP4

Citation data

  • DOI 10.24350/CIRM.V.20120103
  • Cite this video Diakonikolas, Ilias (19/12/2023). Algorithmic robust statistics. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.20120103
  • URL https://dx.doi.org/10.24350/CIRM.V.20120103

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback