<< Chapter < Page | Chapter >> Page > |
As stated earlier, we wanted our measure of nonuniformity to be simple and easy to control. For the purposes of this project, removing entries based on a jointly Gaussian Distribution met our requirements. However, this measure of nonuniformity is both unrealistic and overly simplistic for real world data sets. With this in mind, future work would involve finding ways to generalize our notion of nonuniformity so that our results are more accurate with regards to real world data sets.
One of the most obvious applications of matrix completion is image reconstruction. The figure below shows how matrix completion can be used to reconstruct a noisy image. The original image had a uniform distribution of removed indices, so matrix completion was able to successfully recreate the image.
Our results suggest that the algorithm would similarly be able to complete the image if the removed indices had a certain degree of non uniformity. Further testing would involve looking for any kinds of exceptions to our results. Due to the visual nature of these matrices, it would be very easy to see when matrix completion succeeds or fails. We could then look for patterns to generalize the issues the algorithm takes with varying degrees of non uniformity in the missing indices.
Essentially, this is expanding the whole idea of our stress test to be more cognizant of real world issues of nonuniformity in data sets.
This whole project has been guided by the principal that the existing solution for matrix completion is as good as it will get. At our poster presentation, one of the judge’s proposed an interesting idea. Could we (or others with better qualifications) improve the solution? Is there a way to fix the algorithm so that it works for all levels of uniformity?
We don't know the answer to this question and probably don't have the analytical skills to begin looking for one. However, a simple but potentially effective solution quickly comes to mind. We could develop a preprocessing algorithm that makes the data uniform before running matrix completion. Such an algorithm would need to be fast and generalized to all sorts of data sets to truly be a viable solution.
Notification Switch
Would you like to follow the 'Breaking matrix completion: a stress test' conversation and receive update notifications?