0
$\begingroup$

I have a matrix $X \in \mathbb{R}^{m\times n}$ and I want to estimate it with a dense matrix $Y^{m\times n}$ such that $Y$ is still close to $X$ in some distance measure. Is this doable in a computationally efficient way? While the sparse estimation is commonly used, but all my efforts for a regularization based solution ended up in non-convex optimization.

$\endgroup$
3
  • 1
    $\begingroup$ Why not find a sparse neighbor and then add a matrix of all epsilons? $\endgroup$ May 28, 2013 at 0:16
  • $\begingroup$ Theoretically you are right. But practically, I want the non-zero elements to be non-negligible, as well. $\endgroup$
    – Taha
    May 28, 2013 at 0:45
  • $\begingroup$ You should be more specific in your definition of "dense." $\endgroup$ May 28, 2013 at 0:49

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.