Given only a random sample of entries of a low-rank, sufficiently incoherent matrix M, can one complete M and recover all unobserved entries exactly, and stably under bounded…
Statement
Given only a random sample of entries of a low-rank, sufficiently incoherent matrix M, can one complete M and recover all unobserved entries exactly, and stably under bounded observation noise, by nuclear-norm minimization?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.