rank-k approximation algorithm / brute force solution / symmetric psd applications / simpler and more efficient algorithms / approximation algorithm / polynomial time algorithm / geometric learning algorithms / private algorithms / question using known tools / private polynomial time algorithm / private algorithm / rank approximation algorithms / energy / /
Organization
U.S. Air Force office of Scientific Research / Defense Advanced Research Projects Agency / National Science Foundation / Stanford University / Institute for Computational and Mathematical Engineering / /
On differentially private low rank approximation Michael Kapralov∗ Kunal Talwar† October 3, 2012