GLM Regression with Oblivious Corruptions
share
We demonstrate the first algorithms for the problem of regression for generalized linear models (GLMs) in the presence of additive oblivious noise. We assume we have sample access to examples (x, y) where y is a noisy measurement of g(w^* · x). In particular, the noisy labels are of the form y = g(w^* · x) + ξ + ϵ, where ξ is the oblivious noise drawn independently of x and satisfies [ξ = 0] ≥ o(1), and ϵ∼𝒩(0, σ^2). Our goal is to accurately recover a parameter vector w such that the function g(w · x) has arbitrarily small error when compared to the true values g(w^* · x), rather than the noisy measurements y. We present an algorithm that tackles this problem in its most general distribution-independent setting, where the solution may not even be identifiable. Our algorithm returns an accurate estimate of the solution if it is identifiable, and otherwise returns a small list of candidates, one of which is close to the true solution. Furthermore, we provide a necessary and sufficient condition for identifiability, which holds in broad settings. Specifically, the problem is identifiable when the quantile at which ξ + ϵ = 0 is known, or when the family of hypotheses does not contain candidates that are nearly equal to a translated g(w^* · x) + A for some real number A, while also having large error when compared to g(w^* · x). This is the first algorithmic result for GLM regression with oblivious noise which can handle more than half the samples being arbitrarily corrupted. Prior work focused largely on the setting of linear regression, and gave algorithms under restrictive assumptions.
READ FULL TEXT