Greedy Algorithms for Non-linear Sparse Recovery

Introduction

we propose two greedy algorithms to solve the underdetermined nonlinear sparse recovery problem. There are hardly any algorithms to solve such problems. Our algorithm is based on the OMP (Orthogonal Matching Pursuit) and the CoSaMP (Compressive Sampling Matching Pursuit), two popular techniques for solving the linear problem. We empirically test the success rates of our algorithms on exponential and logarithmic functions. The success rates follow a pattern similar to the one we observe for linear recovery problems.

@incollection{gupta2016greedy,
  title={Greedy Algorithms for Non-linear Sparse Recovery},
  author={Gupta, Kavya and Majumdar, Angshul},
  booktitle={Machine Intelligence and Signal Processing},
  pages={99--108},
  year={2016},
  publisher={Springer}
}