Demo Data from EDBT 2026 / reviewers in the wild / expert
Hyeonmin Ha
dblp:198/6798
· DBLP profile ↗
4ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Security and privacy · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
3 papers |
Efficient and distributed learning · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
GPUs and heterogeneous computing · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search |
0.6 | 1 | 2022 | SUMNAS: Supernet with Unbiased Meta-Features for Neural Architecture Search · ICLR 2022 |
Machine learning › Efficient and distributed learning › automated machine learning › neural architecture search
one-shot neural architecture search |
0.6 | 1 | 2022 | SUMNAS: Supernet with Unbiased Meta-Features for Neural Architecture Search · ICLR 2022 |
Machine learning › Efficient and distributed learning › distributed training
data parallel training |
0.4 | 1 | 2019 | Parallax: Sparsity-aware Data Parallel Training of Deep Neural Networks · EuroSys 2019 |
Machine learning › Efficient and distributed learning
distributed training |
0.4 | 1 | 2019 | Parallax: Sparsity-aware Data Parallel Training of Deep Neural Networks · EuroSys 2019 |
Machine learning › Efficient and distributed learning › distributed training › distributed training systems
parameter server |
0.4 | 1 | 2019 | Parallax: Sparsity-aware Data Parallel Training of Deep Neural Networks · EuroSys 2019 |
GPUs and heterogeneous computing
GPU training |
0.1 | 1 | 2019 | Parallax: Sparsity-aware Data Parallel Training of Deep Neural Networks · EuroSys 2019 |
Methods — techniques the papers use, named apart from their topics
sparsity-aware communication · 0.8hybrid parameter server and allreduce · 0.8supernet · 0.6meta-features · 0.6data augmentation · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | SUMNAS: Supernet with Unbiased Meta-Features for Neural Architecture Search
Hyeonmin Ha, Jihoon Kim 0002, Semin Park, Byung-Gon Chun |
ICLR | 1 |
| 2021 | Refurbish Your Training Data: Reusing Partially Augmented Samples for Faster Deep Neural Network Training
Gyewon Lee, Irene Lee, Hyeonmin Ha, Kyung-Geun Lee, Hwarim Hyun, Ahnjae Shin, Byung-Gon Chun |
USENIX ATC | 3 |
| 2019 | Parallax: Sparsity-aware Data Parallel Training of Deep Neural NetworksabstractThe employment of high-performance servers and GPU accelerators for training deep neural network models have greatly accelerated recent advances in deep learning (DL). DL frameworks, such as TensorFlow, MXNet, and Caffe2, have emerged to assist DL researchers to train their models in a distributed manner. Although current DL frameworks scale well for image classification models, there remain opportunities for scalable distributed training on natural language processing (NLP) models. We found that current frameworks show relatively low scalability on training NLP models due to the lack of consideration to the difference in sparsity of model parameters. In this paper, we propose Parallax, a framework that optimizes data parallel training by utilizing the sparsity of model parameters. Parallax introduces a hybrid approach that combines Parameter Server and AllReduce architectures to optimize the amount of data transfer according to the sparsity. Experiments show that Parallax built atop Tensor-Flow achieves scalable training throughput on both dense and sparse models while requiring little effort from its users. Parallax achieves up to 2.8x, 6.02x speedup for NLP models than TensorFlow and Horovod with 48 GPUs, respectively. The training speed for the image classification models is equal to Horovod and 1.53x faster than TensorFlow. Soojeong Kim, Gyeong-In Yu, Hojin Park, Sungwoo Cho, Eunji Jeong, Hyeonmin Ha, Sanha Lee, Joo Seong Jeong, Byung-Gon Chun |
EuroSys | 6 |
| 2017 | Breaking Ad-hoc Runtime Integrity Protection Mechanisms in Android Financial AppsabstractTo protect customers' sensitive information, many mobile financial applications include steps to probe the runtime environment and abort their execution if the environment is deemed to have been tampered with. This paper investigates the security of such self-defense mechanisms used in 76 popular financial Android apps in the Republic of Korea. Our investigation found that existing tools fail to analyze these Android apps effectively because of their highly obfuscated code and complex, non-traditional control flows. We overcome this challenge by extracting a call graph with a self-defense mechanism, from a detailed runtime trace record of a target app's execution. To generate the call graph, we identify the causality between the system APIs (Android APIs and system calls) used to check device rooting and app integrity, and those used to stop an app's execution. Our analysis of 76 apps shows that we can pinpoint methods to bypass a self-defense mechanism using a causality graph in most cases. We successfully bypassed self-defense mechanisms in 67 out of 73 apps that check device rooting and 39 out of 44 apps that check app integrity. While analyzing the self-defense mechanisms, we found that many apps rely on third-party security libraries for their self-defense mechanisms. Thus we present in-depth studies of the top five security libraries. Our results demonstrate the necessity of a platform-level solution for integrity checks. Hyeonmin Ha, Seoyoon Choi, Jaeyeon Jung, Byung-Gon Chun |
AsiaCCS | 2 |