Sublinear time algorithms for greedy selection in high dimensions

Qi Chen, Kai Liu, Ruilong Yao, Hu Ding

Abstract: Greedy selection is a widely used idea for solving many machine learning problems. But greedy selection algorithms often have high complexities and thus may be prohibitive for large-scale data. In ...