A spectral least-squares-type method for heavy-tailed corrupted regression with unknown covariance \& heterogeneous noise

preprint2022arXivOpen access

Abstract

We revisit heavy-tailed corrupted least-squares linear regression assuming to have a corrupted nn-sized label-feature sample of at most εnεn arbitrary outliers. We wish to estimate a pp-dimensional parameter b∗b^* given such sample of a label-feature pair (y,x)(y,x) satisfying y=⟨x,b∗⟩+ξy=\langle x,b^*\rangle+ξ with heavy-tailed (x,ξ)(x,ξ). We only assume xx is L4−L2L^4-L^2 hypercontractive with constant L>0L>0 and has covariance matrix ΣΣ with minimum eigenvalue 1/μ2>01/μ^2>0 and bounded condition number κ>0κ>0. The noise ξξ can be arbitrarily dependent on xx and nonsymmetric as long as ξxξx has finite covariance matrix ΞΞ. We propose a near-optimal computationally tractable estimator, based on the power method, assuming no knowledge on (Σ,Ξ)(Σ,Ξ) nor the operator norm of ΞΞ. With probability at least 1−δ1-δ, our proposed estimator attains the statistical rate μ2∥Ξ∥1/2(pn+log⁡(1/δ)n+ε)1/2μ^2\VertΞ\Vert^{1/2}(\frac{p}{n}+\frac{\log(1/δ)}{n}+ε)^{1/2} and breakdown-point ε≲1L4κ2ε\lesssim\frac{1}{L^4κ^2}, both optimal in the ℓ2\ell_2-norm, assuming the near-optimal minimum sample size L4κ2(plog⁡p+log⁡(1/δ))≲nL^4κ^2(p\log p + \log(1/δ))\lesssim n, up to a log factor. To the best of our knowledge, this is the first computationally tractable algorithm satisfying simultaneously all the mentioned properties. Our estimator is based on a two-stage Multiplicative Weight Update algorithm. The first stage estimates a descent direction v^\hat v with respect to the (unknown) pre-conditioned inner product ⟨Σ(⋅),⋅⟩\langleΣ(\cdot),\cdot\rangle. The second stage estimate the descent direction Σv^Σ\hat v with respect to the (known) inner product ⟨⋅,⋅⟩\langle\cdot,\cdot\rangle, without knowing nor estimating ΣΣ.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.