Demo Data from VLDB 2026 / reviewers in the wild / expert
Geonho Kim
dblp:261/5205
· DBLP profile ↗
5ranked-venue papers
0as first author
3since 2021 · last 2023
0000-0003-0587-1975ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 2 · 1 since 2021
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.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Hardware accelerators and domain-specific architectures · 100% | |
| Artificial intelligence
2 papers |
Efficient and distributed learning · 60% Optimization for machine learning · 40% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware accelerators and domain-specific architectures › machine learning accelerator
CNN accelerator |
0.7 | 1 | 2023 | LoCoExNet: Low-Cost Early Exit Network for Energy Efficient CNN Accelerator Design · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023 |
Hardware accelerators and domain-specific architectures › machine learning accelerator › training accelerator
neural network training accelerator |
0.4 | 1 | 2020 | Prediction Confidence based Low Complexity Gradient Computation for Accelerating DNN Training · DAC 2020 |
Machine learning › Efficient and distributed learning
model compression |
0.2 | 1 | 2023 | LoCoExNet: Low-Cost Early Exit Network for Energy Efficient CNN Accelerator Design · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023 |
Machine learning › Optimization for machine learning
gradient estimation |
0.1 | 1 | 2020 | Prediction Confidence based Low Complexity Gradient Computation for Accelerating DNN Training · DAC 2020 |
Methods — techniques the papers use, named apart from their topics
early exit · 1.3dynamic branch pruning · 1.3stochastic gradient descent · 0.9prediction confidence based approximation · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | LoCoExNet: Low-Cost Early Exit Network for Energy Efficient CNN Accelerator DesignabstractEarly exit techniques, where the inference process of convolutional neural networks (CNNs) is early terminated by using auxiliary classifiers (called branches) to reduce data processing energy for easy inputs, have been actively researched. However, the conventional early exit works have suffered from the large size of branches, whose memory access energy is significantly large compared to that of the main network. In this article, we propose a low-cost early exit network (LoCoExNet), which significantly improves energy efficiencies by reducing the parameters used in inference with efficient branch structures. To further reduce the energy consumption of branches, based on the observation that the classification difficulties of the images can be predicted using the magnitudes of input activations, we also propose hardware-friendly dynamic branch pruning (DBP). Given the network and target dataset, we can construct an energy-efficient early exit network through the branch structure determination algorithm and DBP algorithm. Finally, we develop several architectural supporting modules to improve the energy efficiency of the proposed LoCoExNet with DBP. The experimental results show that the LoCoExNet uses 28.7% of the total network parameters on average for Tiny-ImageNet dataset using VGG-16 without accuracy loss. The CNN accelerator that implements LoCoExNet with DBP has been implemented using the 65nm CMOS process. The implementation results show that the LoCoExNet accelerator achieves up to 91% of energy savings and up to$4.46\mathbf {\times }$of speedups without accuracy loss for CIFAR-10 dataset using VGG-16 compared to the state-of-the-art CNN accelerators. Joongho Jo, Geonho Kim, Seungtae Kim, Jongsun Park 0001 |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |
| 2023 | Low Complexity Gradient Computation Techniques to Accelerate Deep Neural Network TrainingabstractDeep neural network (DNN) training is an iterative process of updating network weights, called gradient computation, where (mini-batch) stochastic gradient descent (SGD) algorithm is generally used. Since SGD inherently allows gradient computations with noise, the proper approximation of computing weight gradients within SGD noise can be a promising technique to save energy/time consumptions during DNN training. This article proposes two novel techniques to reduce the computational complexity of the gradient computations for the acceleration of SGD-based DNN training. First, considering that the output predictions of a network (confidence) change with training inputs, the relation between the confidence and the magnitude of the weight gradient can be exploited to skip the gradient computations without seriously sacrificing the accuracy, especially for high confidence inputs. Second, the angle diversity-based approximations of intermediate activations for weight gradient calculation are also presented. Based on the fact that the angle diversity of gradients is small (highly uncorrelated) in the early training epoch, the bit precision of activations can be reduced to 2-/4-/8-bit depending on the resulting angle error between the original gradient and quantized gradient. The simulations show that the proposed approach can skip up to 75.83% of gradient computations with negligible accuracy degradation for CIFAR-10 dataset using ResNet-20. Hardware implementation results using 65-nm CMOS technology also show that the proposed training accelerator achieves up to 1.69× energy efficiency compared with other training accelerators. Dongyeob Shin, Geonho Kim, Joongho Jo, Jongsun Park 0001 |
IEEE Trans. Neural Networks Learn. Syst. | 2 |
| 2021 | Exploiting Retraining-Based Mixed-Precision Quantization for Low-Cost DNN Accelerator DesignabstractFor successful deployment of deep neural networks (DNNs) on resource-constrained devices, retraining-based quantization has been widely adopted to reduce the number of DRAM accesses. By properly setting training parameters, such as batch size and learning rate, bit widths of both weights and activations can be uniformly quantized down to 4 bit while maintaining full precision accuracy. In this article, we present a retraining-based mixed-precision quantization approach and its customized DNN accelerator to achieve high energy efficiency. In the proposed quantization, in the middle of retraining, an additional bit (extra quantization level) is assigned to the weights that have shown frequent switching between two contiguous quantization levels since it means that both quantization levels cannot help to reduce quantization loss. We also mitigate the gradient noise that occurs in the retraining process by taking a lower learning rate near the quantization threshold. For the proposed novel mixed-precision quantized network (MPQ-network), we have implemented a customized accelerator using a 65-nm CMOS process. In the accelerator, the proposed processing elements (PEs) can be dynamically reconfigured to process variable bit widths from 2 to 4 bit for both weights and activations. The numerical results show that the proposed quantization can achieve 1.37 × better compression ratio for VGG-9 using CIFAR-10 data set compared with a uniform 4-bit (both weights and activations) model without loss of classification accuracy. The proposed accelerator also shows 1.29× of energy savings for VGG-9 using the CIFAR-10 data set over the state-of-the-art accelerator. Nahsung Kim, Dongyeob Shin, Wonseok Choi 0004, Geonho Kim, Jongsun Park 0001 |
IEEE Trans. Neural Networks Learn. Syst. | 4 |
| 2020 | Prediction Confidence based Low Complexity Gradient Computation for Accelerating DNN TrainingabstractIn deep neural network (DNN) training, network weights are iteratively updated with the weight gradients that are obtained from stochastic gradient descent (SGD). Since SGD inherently allows gradient calculations with noise, approximating weight gradient computations have a large potential of training energy/time savings without degrading accuracy. In this paper, we propose an input-dependent approximation of the weight gradient for improving energy efficiency of training process. Considering that the output predictions of network (confidence) changes with training inputs, the relation between the confidence and the magnitude of weight gradient can be efficiently exploited to skip the gradient computations without accuracy drop, especially for high confidence inputs. With a given squared error constraint, the computation skip rates can be also controlled by changing the confidence threshold. The simulation results show that our approach can skip 72.6% of gradient computations for CIFAR-100 dataset using ResNet-18 without accuracy degradation. Hardware implementation with 65nm CMOS process shows that our design achieves 88.84% and 98.16% of maximum per epoch training energy and time savings, respectively, for CIFAR-100 dataset using ResNet-18 compared to state-of-the-art training accelerator. Dongyeob Shin, Geonho Kim, Joongho Jo, Jongsun Park 0001 |
DAC | 2 |
| 2008 | Parallelization of the Scale-Invariant Keypoint Detection Algorithm for Cell Broadband Engine ArchitectureabstractThis paper describes design and implementation of a parallel algorithm that detects scale-invariant keypoints from digital images. Keypoint detection is one of the most important operations in image processing since efficient image matching is possible with it. Image matching is used in many intelligent image processing service, including object/scene recognition, stereo correspondence, motion tracking, and panorama imaging. In this paper, we design a new parallel algorithm of keypoint detection that is suitable for Cell Broadband Engine architecture by converting each subprocess of keypoint detection algorithm into parallel version. The experimental results show that performance of our algorithm increases in proportion to the number of processors utilized, that is, it achieves linear scalability. Bomjun Kwon, Taiho Choi, Heejin Chung, Geonho Kim |
CCNC | 4 |