- Efficient Computation of Robust Low-Rank Matrix Approximations in the Presence of Missing Data using the L1 Norm code
- Low-Rank Matrix Recovery and Completion via Convex Optimization
- Predictive low-rank decomposition for kernel methods
- Improved Nyström Low-rank Approximation for Scalable Manifold Learning