Heecheol Yang

Prof. Heecheol Yang

Chungnam National University, Daejeon, Republic of Korea

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 January 2022 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
SHSangwoo Hong
Sangwoo Hong
HYHeecheol Yang
Heecheol Yang
JLJungwoo Lee
Jungwoo Lee
Coded computing has proved its efficiency in handling a straggler issue in distributed computing framework. It uses error correcting codes to mitigate the effect of the stragglers. However, in a coded distributed computing framework, there may exist Byzantine workers who send the wrong computation results to a master in order to contaminate the overall computation output. Therefore, it is essential to identify Byzantine workers from their computation results in coded computing. In this paper, we consider Byzantine attack identification problem in coded computing for distributed matrix multiplication tasks. We propose a new coding scheme which facilitates the efficient Byzantine attack identification, namely locally testable codes. We also suggest a hierarchical group testing method for Byzantine attack identification. We claim the required number of tests for group testing in our scheme, and show that it requires smaller number of tests than the conventional group testing method for the existing coded computing schemes.

16 October 2020 in IEEE Access
Verified
Journal Article
Open access
SHSangwoo Hong
Sangwoo Hong
HYHeecheol Yang
Heecheol Yang
JLJungwoo Lee
Jungwoo Lee
In a distributed computing environment, there may exist slow processing workers, which are known as “stragglers”, and they can slow down the whole computing process. In this article, we consider coded computation for matrix multiplication tasks in distributed computing, which can mitigate the effect of stragglers by a coding approach. We propose a new communication-efficient coded computation scheme, namely squeezed polynomial codes, for a straggler-exploiting scenario where multiple sub-tasks are assigned to the workers to partially leverage the computation capability of stragglers. The key idea of squeezed polynomial codes is to overlap the encoded matrices in assigning multiple sub-tasks with appropriate polynomial functions in order to reduce the task-allocation communication load from a master to its workers. We compare squeezed polynomial codes with the existing schemes for distributed matrix multiplication in a communication load perspective. Consequently, we show that squeezed polynomial codes can efficiently reduce the communication load while ensuring the optimal recovery condition at a master to obtain final product.

18 March 2024 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
SHSangwoo Hong
Sangwoo Hong
HYHeecheol Yang
Heecheol Yang
YYYoungseok Yoon
Youngseok Yoon
JLJungwoo Lee
Jungwoo Lee
Distributed computing has emerged as a promising solution for accelerating machine learning training processes on large-scale datasets by leveraging the parallel processing capabilities of multiple workers. However, there remain two major issues that still need to be addressed: i) Byzantine attacks from malicious workers, and ii) the effect of slow workers, commonly referred to as stragglers. In this paper, we address both issues concurrently by introducing Group-wise Verifiable Coded Computing (GVCC), a novel approach that combines coding techniques and group-wise verification to enhance robustness against Byzantine attacks and resilience to straggler effects in distributed computing. The key idea of GVCC is to verify a group of computation results from workers at a time, while providing resilience to stragglers through encoding tasks assigned to workers with Group-wise Verifiable Codes. We evaluate the performance of GVCC through experiments conducted on Amazon EC2 clouds and the results show that GVCC outperforms the existing methods in terms of overall processing time and verification time while maintaining the verification performance. This study highlights the potential of GVCC as an effective solution for overcoming the challenges of Byzantine attacks and stragglers in distributed computing for executing matrix multiplication.

12 January 2023 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
SHSangwoo Hong
Sangwoo Hong
HYHeecheol Yang
Heecheol Yang
YYYoungseok Yoon
Youngseok Yoon
JLJungwoo Lee
Jungwoo Lee
In this paper, we consider coded computation for matrix multiplication tasks in distributed computing to mitigate straggler effects. We assume that the stragglers’ computation results can be leveraged at the master by assigning multiple sub-tasks to the workers. We propose a new coded computation scheme, namely Chebyshev coded fully private matrix multiplication (CFP), to preserve the privacy of a master in a scenario where a master wants to obtain a matrix multiplication result from the libraries which are shared by the workers, while concealing both of the two indices of the desired matrices from each worker. The key idea of CFP is to introduce Chebyshev polynomials, which have commutative property, in queries sent to workers to allocate sub-tasks. We also extend CFP to keep the privacy of a master from colluding workers. In conclusion, we show that CFP can preserve the privacy of a master from each worker and efficiently mitigate straggler effects compared to existing schemes.


24 September 2020 in IEEE Access
Verified
Journal Article
Open access
HKHeasung Kim
Heasung Kim
JKJungtai Kim
Jungtai Kim
WSWonjae Shin
Wonjae Shin
HYHeecheol Yang
Heecheol Yang
NLNayoung Lee
Nayoung Lee
JLJungwoo Lee
Jungwoo Lee
In this paper, we consider a power allocation optimization technique for a time-varying fading broadcast channel in energy harvesting communication systems, in which a transmitter with a rechargeable battery transmits messages to receivers using the harvested energy. We first prove that the optimal online power allocation policy for the sum-rate maximization of the transmitter is a monotonically increasing function of harvested energy, remaining battery, and the channel gain of each user. We then construct a lightweight neural network architecture to take advantage of the monotonicity of the optimal policy. This two-step approach, which relies on effective function approximation to provide a mathematical guideline for neural network design, can prevent us from wasting the representational capacity of neural networks. The tailored neural network architectures enable stable learning and eliminate the heuristic network design. For performance assessment, the proposed approach is compared with the closed-form optimal policy for a partially observable Markov problem. Through additional experiments, it is observed that our online solution achieves a performance close to the theoretical upper bound of the performance in a time-varying fading broadcast channel.