Top-$k$ Feature Selection in Sparse Learning via Accelerated Coordinate Descent Method
{{output}}
Top-$k$ feature selection in sparse learning is a fundamental problem in machine learning. It is difficult to conquer due to the rigid $/ell _{2,0}$-norm constraint. Existing literature mostly relaxes the constraint and seeks the approximation of the selection... ...
