activity
20122024
most citedSpeeding Up Distributed Machine Learning Using Codes

885 citations · 983 across the 9 of their papers we have counts for

collaborators

14 papers

cs.LG2024

Looped Transformers for Length Generalization

Ying Fan, Yilun Du, Kannan Ramchandran +1

Recent work has shown that Transformers trained from scratch can successfully solve various arithmetic and algorithmic tasks, such as adding numbers and computing parity. While the…

cs.LG2022★ 1 cited

Equal Improvability: A New Fairness Notion Considering the Long-term Impact

Ozgur Guldogan, Yuchen Zeng, Jy-yong Sohn +2

Devising a fair classifier that does not discriminate against different groups is an important problem in machine learning. Although researchers have proposed various ways of defin…

math.ST2018★ 73 cited

Hypergraph Spectral Clustering in the Weighted Stochastic Block Model

Kwangjun Ahn, Kangwook Lee, Changho Suh

Spectral clustering is a celebrated algorithm that partitions objects based on pairwise similarity information. While this approach has been successfully applied to a variety of do…

cs.DC2018

Hierarchical Coding for Distributed Computing

Hyegyeong Park, Kangwook Lee, Jy-yong Sohn +2

Coding for distributed computing supports low-latency computation by relieving the burden of straggling workers. While most existing works assume a simple master-worker model, we c…

stat.AP2017★ 7 cited

Simulating outcomes of interventions using a multipurpose simulation program based on the Evolutionary Causal Matrices and Markov Chain

Hyemin Han, Kangwook Lee, Firat Soylu

Predicting long-term outcomes of interventions is necessary for educational and social policy-making processes that might widely influence our society for the long-term. However, p…

cs.IT2017

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…

stat.AP2016★ 12 cited

Predicting Long-term Outcomes of Educational Interventions Using the Evolutionary Causal Matrices and Markov Chain Based on Educational Neuroscience

Hyemin Han, Kangwook Lee, Firat Soylu

We developed a prediction model based on the evolutionary causal matrices (ECM) and the Markov Chain to predict long-term influences of educational interventions on adolescents dev…

cs.IT2016★ 4 cited

Fast and Robust Compressive Phase Retrieval with Sparse-Graph Codes

Dong Yin, Kangwook Lee, Ramtin Pedarsani +1

In this paper, we tackle the compressive phase retrieval problem in the presence of noise. The noisy compressive phase retrieval problem is to recover a -sparse complex signal $…

cs.DC2015★ 885 cited

Speeding Up Distributed Machine Learning Using Codes

Kangwook Lee, Maximilian Lam, Ramtin Pedarsani +2

Codes are widely used in many engineering applications to offer robustness against noise. In large-scale systems there are several types of noise that can affect the performance of…

cs.IT2015

SAFFRON: A Fast, Efficient, and Robust Framework for Group Testing based on Sparse-Graph Codes

Kangwook Lee, Ramtin Pedarsani, Kannan Ramchandran

Group testing tackles the problem of identifying a population of defective items from a set of items by pooling groups of items efficiently in order to cut down the number…

cs.IT2014

Capacity-Approaching PhaseCode for Low-Complexity Compressive Phase Retrieval

Ramtin Pedarsani, Kangwook Lee, Kannan Ramchandran

In this paper, we tackle the general compressive phase retrieval problem. The problem is to recover a K-sparse complex vector of length n, , from the magnitudes…

cs.IT2014

PhaseCode: Fast and Efficient Compressive Phase Retrieval based on Sparse-Graph-Codes

Ramtin Pedarsani, Dong Yin, Kangwook Lee +1

We consider the problem of recovering a -sparse complex signal from intensity measurements. We propose the PhaseCode algorithm, and show that in the noiseless case, Phas…

cs.NI2013★ 1 cited

When Do Redundant Requests Reduce Latency ?

Nihar B. Shah, Kangwook Lee, Kannan Ramchandran

Several systems possess the flexibility to serve requests in more than one way. For instance, a distributed storage system storing multiple replicas of the data can serve a request…

cs.IT2012

The MDS Queue: Analysing the Latency Performance of Erasure Codes

Nihar B. Shah, Kangwook Lee, Kannan Ramchandran

In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes,…