BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv5.1.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:https://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20190603T140000
DTEND;TZID=Europe/Paris:20190603T151500
DTSTAMP:20260713T082250
CREATED:20190227T083203Z
LAST-MODIFIED:20190227T083203Z
UID:12222-1559570400-1559574900@crest.science
SUMMARY:Ilias DIAKONIKOLAS (University of Southern California) - "Algorithmic Questions in Robust High-Dimensional Statistics"
DESCRIPTION:\nThe Statistical Seminar: Every Monday at 2:00 pm.\nTime: 2:00 pm – 3:15 pm\nDate: 3rd of June 2019\nPlace: Exceptionally Amphi 200 \nIlias DIAKONIKOLAS (University of Southern California) – “Algorithmic Questions in Robust High-Dimensional Statistics“ \nAbstract: \nFitting a model to a collection of observations is one of the quintessential questions in statistics. The standard assumption is that the data was generated by a model of a given type (e.g.\, a mixture model). This simplifying assumption is at best only approximately valid\, as real datasets are typically exposed to some source of contamination. Hence\, any estimator designed for a particular model must also be robust in the presence of corrupted data. This is the prototypical goal in robust statistics\, a field that took shape in the 1960s with the pioneering works of Tukey and Huber. Until recently\, even for the basic problem of robustly estimating the mean of a high-dimensional dataset\, all known robust estimators were hard to compute. Moreover\, the quality of the common heuristics degrades badly as the dimension increases.\nIn this talk\, we will survey the recent progress in algorithmic high-dimensional robust statistics. We will describe the first computationally efficient algorithms for robust mean and covariance estimation and the main insights behind them. We will also present practical applications of these estimators to exploratory data analysis and adversarial machine learning. Finally\, we will discuss new directions and opportunities for future work.\nThe talk will be based on a number of joint works with (various subsets of) G. Kamath\, D. Kane\, J. Li\, A. Moitra\, and A. Stewart.\nOrganizers:\nCristina BUTUCEA\, Alexandre TSYBAKOV\, Julie JOSSE\, Eric MOULINES\, Mathieu ROSENBAUM\nSponsors:\nCREST-CMAP\n \n\n
URL:https://crest.science/event/ilias-diakonikolas-ucs/
CATEGORIES:Statistics
ATTACH;FMTTYPE=:
END:VEVENT
END:VCALENDAR