arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.3660cs.LGcs.CVstat.ML
收藏

10,000+倍加速鲁棒子集选择(ARSS)

10,000+ Times Accelerated Robust Subset Selection (ARSS)

Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所)

Feiyun Zhu, Bin Fan, Xinliang Zhu, Ying Wang, Shiming Xiang, Chunhong Pan

摘要:

从含有噪声信息的海量数据中进行子集选择越来越受到各种应用的欢迎。这个问题仍然具有很大的挑战性,因为目前的方法通常速度慢,对离群值敏感。为了解决上述两个问题,我们提出了一种加速鲁棒子集选择(ARSS)方法。特别是在子集选择领域,这是第一次尝试采用基于$\ell_{p}(0<p\leq1)$范数的表示损失度量,防止大的错误主导我们的目标。因此,极大地增强了对离群元素的鲁棒性。实际上,数据大小通常比特征长度(即,$N\gg L$)大得多。基于这一观察,我们提出了一个加速求解器(通过ALM和等效推导),以大大降低计算成本,理论上从$O(N^{4})$到$O(N{}^{2}L)$。在10个基准数据集上进行的大量实验证明,我们的方法不仅优于最先进的方法,而且比最相关的方法快10,000倍以上。

英文摘要:

Subset selection from massive data with noised information is increasingly popular for various applications. This problem is still highly challenging as current methods are generally slow in speed and sensitive to outliers. To address the above two issues, we propose an accelerated robust subset selection (ARSS) method. Specifically in the subset selection area, this is the first attempt to employ the $\ell_{p}(0<p\leq1)$-norm based measure for the representation loss, preventing large errors from dominating our objective. As a result, the robustness against outlier elements is greatly enhanced. Actually, data size is generally much larger than feature length, i.e. $N\gg L$. Based on this observation, we propose a speedup solver (via ALM and equivalent derivations) to highly reduce the computational cost, theoretically from $O(N^{4})$ to $O(N{}^{2}L)$. Extensive experiments on ten benchmark datasets verify that our method not only outperforms state of the art methods, but also runs 10,000+ times faster than the most related method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑