Robust Learning of Multi-index Models via Iterative Subspace Approximation

We study the task of learning Multi-Index Models (MIMs) with label noise under the Gaussian distribution. A K-MIM is any function f that only depends on a K-dimensional subspace. We focus on well-behaved MIMs with finite ranges that satisfy certain regularity properties. Our main contribution is a general robust learner that is qualitatively optimal in the Statistical Query (SQ) model. Our algorithm iteratively constructs better approximations to the defining subspace by computing low-degree moments conditional on the projection to the subspace computed thus far, and adding directions with relatively large empirical moments. This procedure efficiently finds a subspace V so that f(x) is close to a function of the projection of x onto V. Conversely, for functions for which these conditional moments do not help, we prove an SQ lower bound suggesting that no efficient learner exists. As applications, we provide faster robust learners for the following concept classes: * bf Multiclass Linear Classifiers We give a constant-factor approximate agnostic learner with sample complexity N = O(d) 2poly(K/ε) and computational complexity poly(N ,d). This is the first constant-factor agnostic learner for this class whose complexity is a fixed-degree polynomial in d. * bf Intersections of Halfspaces We give an approximate agnostic learner for this class achieving 0-1 error K tildeO(OPT) + ε with sample complexity N=O(d2) 2poly(K/ε) and computational complexity poly(N ,d). This is the first agnostic learner for this class with near-linear error dependence and complexity a fixed-degree polynomial in d. Furthermore, we show that in the presence of random classification noise, the complexity of our algorithm scales polynomially with 1/ε.