53 citations · 181 across the 16 of their papers we have counts for
Showing 2017 · stat.MLShow all
2 papers · 2 filters
stat.ML2017★ 28 cited
Scalable Greedy Feature Selection via Weak Submodularity
Rajiv Khanna, Ethan Elenberg, Alexandros G. Dimakis +2
Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of e…
stat.ML2017★ 5 cited
On Approximation Guarantees for Greedy Low Rank Optimization
Rajiv Khanna, Ethan Elenberg, Alexandros G. Dimakis +1
We provide new approximation guarantees for greedy low rank matrix estimation under standard assumptions of restricted strong convexity and smoothness. Our novel analysis also unco…