no code implementations • 8 Mar 2017 • Rajiv Khanna, Ethan Elenberg, Alexandros G. Dimakis, Sahand Negahban, Joydeep Ghosh
Furthermore, we show that a bounded submodularity ratio can be used to provide data dependent bounds that can sometimes be tighter also for submodular functions.
no code implementations • ICML 2017 • Rajiv Khanna, Ethan Elenberg, Alexandros G. Dimakis, Sahand Negahban
We provide new approximation guarantees for greedy low rank matrix estimation under standard assumptions of restricted strong convexity and smoothness.