I am looking for robust generalizations of matrix rank.

Think of the the following problem: A big matrix of low rank is perturbed by random noise, such that it becomes a full-rank matrix. Is there a generalization of matrix rank that still 'sees' that the perturbed matrix is close to a low-rank matrix?

potentialzero). $\endgroup$2more comments