Timezone: »

Fast and Robust Least Squares Estimation in Corrupted Linear Models
Brian McWilliams · Gabriel Krummenacher · Mario Lucic · Joachim M Buhmann

Wed Dec 10 04:00 PM -- 08:59 PM (PST) @ Level 2, room 210D

Subsampling methods have been recently proposed to speed up least squares estimation in large scale settings. However, these algorithms are typically not robust to outliers or corruptions in the observed covariates. The concept of influence that was developed for regression diagnostics can be used to detect such corrupted observations as shown in this paper. This property of influence -- for which we also develop a randomized approximation -- motivates our proposed subsampling algorithm for large scale corrupted linear regression which limits the influence of data points since highly influential points contribute most to the residual error. Under a general model of corrupted observations, we show theoretically and empirically on a variety of simulated and real datasets that our algorithm improves over the current state-of-the-art approximation schemes for ordinary least squares.

Author Information

Brian McWilliams (DeepMind)
Gabriel Krummenacher (ETH Zurich)
Mario Lucic (Google Brain (Zurich))
Joachim M Buhmann (ETH Zurich)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors