0
$\begingroup$

I noticed this interesting analogous discussion that happened here,

Lower bound proof for compressive sensing (Gel'fand widths)?

  • What is the closest analogue know for such a result for sparse-coding?
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.