9 citations · 10 across the 2 of their papers we have counts for
3 papers
stat.ML2022★ 9 cited
Matrix Completion with Hierarchical Graph Side Information
Adel Elmahdy, Junhyung Ahn, Changho Suh +1
We consider a matrix completion problem that exploits social or item similarity graphs as side information. We develop a universal, parameter-free, and computationally efficient al…
cs.IT2021★ 1 cited
On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs
Junhyung Ahn, Adel Elmahdy, Soheil Mohajer +1
We study the matrix completion problem that leverages hierarchical similarity graphs as side information in the context of recommender systems. Under a hierarchical stochastic bloc…
cs.IT2018
On the Fundamental Limits of Coded Data Shuffling for Distributed Machine Learning
Adel Elmahdy, Soheil Mohajer
We consider the data shuffling problem in a distributed learning system, in which a master node is connected to a set of worker nodes, via a shared link, in order to communicate a…