107 citations · 232 across the 8 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.LG2017★ 2 cited
Provable Inductive Robust PCA via Iterative Hard Thresholding
U. N. Niranjan, Arun Rajkumar, Theja Tulabandhula
The robust PCA problem, wherein, given an input data matrix that is the superposition of a low-rank matrix and a sparse matrix, we aim to separate out the low-rank and sparse compo…
cs.LG2017★ 6 cited
Inductive Pairwise Ranking: Going Beyond the n log(n) Barrier
U. N. Niranjan, Arun Rajkumar
We study the problem of ranking a set of items from nonactively chosen pairwise preferences where each item has feature information with it. We propose and characterize a very broa…