Robust Parallel Pursuit for Large-Scale Association Network Learning

Sparse reduced -rank regression is an important tool to uncover the largescale response -predictor association network, as exemplified by modern applications such as the diffusion networks, and recommendation systems. However, the association networks recovered by existing methods are either sensitive to outliers or not scalable under the big data setup. In this paper, we propose a new statistical learning method called robust parallel pursuit (ROP) for joint estimation and outlier detection in large-scale response -predictor association network analysis. The proposed method is scalable in that it transforms the original large-scale network learning problem into a set of sparse unit -rank estimations via factor analysis, thus facilitating an effective parallel pursuit algorithm. Furthermore, we provide comprehensive theoretical guarantees including consistency in parameter estimation, rank selection, and outlier detection, and we conduct an inference procedure to quantify the uncertainty of existence of outliers. Extensive simulation studies and two real -data analyses demonstrate the effectiveness and the scalability of the suggested approach.