Feature-Distributed Sparse Regression: A Screen-And-Clean Approach
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 29 (NIPS 2016)(2016)
摘要
Most existing approaches to distributed sparse regression assume the data is partitioned by samples. However, for high-dimensional data (D >> N), it is more natural to partition the data by features. We propose an algorithm to distributed sparse regression when the data is partitioned by features rather than samples. Our approach allows the user to tailor our general method to various distributed computing platforms by trading-off the total amount of data (in bits) sent over the communication network and the number of rounds of communication. We show that an implementation of our approach is capable of solving l(1)-regularized l(2) regression problems with millions of features in minutes.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络