Sparse Approximate Conic Hulls

no code implementations • NeurIPS 2017 • Greg Van Buskirk, Benjamin Raichel, Nicholas Ruozzi

Equivalently, given the matrix X, consider the problem of finding a small subset, S, of the columns of X such that the conic hull of S \eps-approximates the conic hull of the columns of X, i. e., the distance of every column of X to the conic hull of the columns of S should be at most an \eps-fraction of the angular diameter of X.

feature selection