The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity GraphsPublished in IEEE International Symposium on Information Theory (ISIT) , 2022Adel Elmahdy*, Junhyung Ahn*, Changho Suh, and Soheil Mohajer (*: Equal Contribution)Share on Twitter Facebook LinkedIn Previous Next
