Before revision:  The currently available methods for performing such a low-rank plus sparse decomposition are matrix specific, meaning, the algorithm must re-run each time a new matrixshould be decomposed . Since these algorithms are computationally expensive, it is preferable to learn and store a function that instantaneously performs this decomposition when evaluated.
After revision:  The currently available methods for performing such a low-rank plus sparse decomposition are matrix specific, meaning, the algorithm must re-run for every new matrix . Since these algorithms are computationally expensive, it is preferable to learn and store a function that instantaneously performs this decomposition when evaluated.