73 citations · 499 across the 29 of their papers we have counts for
25 papers · 1 filter
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…
Wasserstein GAN Can Perform PCA
Jaewoong Cho, Changho Suh
Generative Adversarial Networks (GANs) have become a powerful framework to learn generative models that arise across a wide variety of domains. While there has been a recent surge…
Two-way Function Computation
Seiyun Shin, Changho Suh
We explore the role of interaction for the problem of reliable computation over two-way multicast networks. Specifically we consider a four-node network in which two nodes wish to…
Community Recovery in Hypergraphs
Kwangjun Ahn, Kangwook Lee, Changho Suh
Community recovery is a central problem that arises in a wide variety of applications such as network clustering, motion segmentation, face clustering and protein complex detection…
Two-Way Interference Channel Capacity: How to Have the Cake and Eat it Too
Changho Suh, Jaewoong Cho, David Tse
Two-way communication is prevalent and its fundamental limits are first studied in the point-to-point setting by Shannon [1]. One natural extension is a two-way interference channe…
Opportunistic Downlink Interference Alignment for Multi-Cell MIMO Networks
Hyun Jong Yang, Won-Yong Shin, Bang Chul Jung +2
In this paper, we propose an opportunistic downlink interference alignment (ODIA) for interference-limited cellular downlink, which intelligently combines user scheduling and downl…