In the Spring of my first year at UW (Spring 2016), I took a course on convex optimization algorithms. I was interested in low rank regression due to a research project I was working on. I played around with the formulation

It turns out that there is a closed form solution to this non-convex problem! The solution is based on the k-rank approximation theorem by Eckart, Young, and Mirsky. It also turns out that someone else independently discovered this in 2012 (check it out), and they analyzed the statistical properties of it. Anyways, I wrote a write up with proofs which you can find here: mid_quarter_report. I also included a closed form solution to the slightly more general problem

I have not seen this result published anywhere.