Trung Thanh Pham

The k-Support Norm and Convex Envelopes of Cardinality and Rank

Sparsity, or cardinality, as a tool for feature selection is extremely common in a vast number of current computer vision applications. The $k$-support norm is a recently proposed norm with the proven property of providing the tightest convex bound on cardinality over the Euclidean norm unit ball. I…