mlsanityData to 7 Oct 2026

Robust Linear Regression for General Feature Distribution

arXiv 2202.02080 ↗First posted 4 Feb 2022cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

We investigate robust linear regression where data may be contaminated by an oblivious adversary, i.e., an adversary than may know the data distribution but is otherwise oblivious to the realizations of the data samples. This model has been previously analyzed under strong assumptions. Concretely, (i) all previous works assume that the covariance matrix of the features is positive definite; and (ii) most of them assume that the features are centered (i.e. zero mean). Additionally, all previous works make additional restrictive assumption, e.g., assuming that the features are Gaussian or that the corruptions are symmetrically distributed. In this work we go beyond these assumptions and investigate robust regression under a more general set of assumptions: (i) we allow the covariance matrix to be either positive definite or positive semi definite, (ii) we do not necessarily assume that the features are centered, (iii) we make no further assumption beyond boundedness (sub-Gaussianity) of features and measurement noise. Under these assumption we analyze a natural SGD variant for this problem and show that it enjoys a fast convergence rate when the covariance matrix is positive definite. In the positive semi definite case we show that there are two regimes: if the features are centered we can obtain a standard convergence rate; otherwise the adversary can cause any learner to fail arbitrarily.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 42 references that are in the map. First posted on arXiv 4 Feb 2022.

Builds on

12 of 42 references.

References · 12

  1. 2019Introduction to Online Convex Optimizationcited by 793
  2. 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
  3. 2019Evaluating Scalable Bayesian Deep Learning Methods for Robust Computer Visioncited by 182
  4. 2018Black-Box Reductions for Parameter-free Online Learning in Banach Spacescited by 124
  5. 2016Learning from Untrusted Datacited by 90
  6. 2018Efficient Algorithms and Lower Bounds for Robust Linear Regressioncited by 76
  7. 2018Efficient Algorithms for Outlier-Robust Regressioncited by 72
  8. 2017Adaptive Huber Regressioncited by 59
  9. 2019Outlier-robust estimation of a sparse linear model using ℓ1-penalized Huber's M-estimatorcited by 31
  10. 2019Adaptive Hard Thresholding for Near-optimal Consistent Robust Regressioncited by 23
  11. 2020Online Robust Regression via SGD on the l1 losscited by 20
  12. 2020Consistent regression when oblivious outliers overwhelmcited by 12

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.