6 citations · 9 across the 7 of their papers we have counts for
3 papers · 2 filters
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…
Learning to Partition using Score Based Compatibilities
Arun Rajkumar, Koyel Mukherjee, Theja Tulabandhula
We study the problem of learning to partition users into groups, where one must learn the compatibilities between the users to achieve optimal groupings. We define four natural obj…
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…