Abstract:

Finding optimal sparse solutions to estimation problems, particularly in under-determined regimes has recently gained much attention. Most existing literature study linear models in which the squared error is used as the measure of discrepancy to be minimized. However, in many applications discrepancy is measured in more general forms such as log-likelihood. Regularization by '1-norm has been shown to induce sparse solutions, but their sparsity level can be merely suboptimal. In this paper we present a greedy algorithm, dubbed Gradient Support Pursuit (GraSP), for sparsity constrained optimization. Quantifiable guarantees are provided for GraSP when cost functions have the Stable Hessian Property.