Bowen Li

Bowen Li

Auto-generated profile, based on publicly available information

Bowen Li

Institute of VLSI Design, Zhejiang University, Hangzhou, China

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
30 June 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
KHKai HUANG
Kai HUANG
SCSiang Chen
Siang Chen
BLBowen Li
Bowen Li
LCLuc Claesen
Luc Claesen
HYHao Yao
Hao Yao
DXDongliang Xiong
Dongliang Xiong
Deep neural networks have achieved remarkable advancement in various intelligence tasks. However, the massive computation and storage consumption limit applications on resource-constrained devices. While channel pruning has been widely applied to compress models, it is challenging to reach very deep compressions for such a coarse-grained pruning structure without significant performance degradation. In this article, we propose an acceleration-aware fine-grained channel pruning (AFCP) framework for accelerating neural networks, which optimizes trainable gate parameters by estimating residual errors between pruned and original channels with hardware characteristics. Our fine-grained concept consists of both algorithm and structure levels. Different from existing methods that leverage a predefined pruning criterion, AFCP explicitly considers both zero-out and similar criteria for each channel, and adaptively selects the suitable one via residual gate parameters. For structure level, AFCP adopts a fine-grained channel pruning strategy for residual neural networks and a decomposition-based structure, which further extends the pruning optimization space. Moreover, instead of using theoretical computation costs, such as floating-point operations, we propose the hardware predictor that bridges the gap between realistic acceleration and pruning procedure to guide the learning of pruning, which improves the efficiency of model pruning when deployed on accelerators. Extensive evaluation results demonstrate that AFCP outperforms state-of-the-art methods, and achieves a favorable balance between model performance and computation cost.

20 January 2023 in ACM Transactions on Design Automation of Electronic Systems
Verified
Journal Article
Open access
KHKai HUANG
Kai HUANG
BLBowen Li
Bowen Li
DXDongliang Xiong
Dongliang Xiong
HJHaitian Jiang
Haitian Jiang
XJXiaowen Jiang
Xiaowen Jiang
ZLZhili Liu
Zhili Liu
Deep Neural Networks (DNNs) have achieved remarkable success in various Artificial Intelligence applications. Quantization is a critical step in DNNs compression and acceleration for deployment. To further boost DNN execution efficiency, many works explore to leverage the input-dependent redundancy with dynamic quantization for different regions. However, the sensitive regions in the feature map are irregularly distributed, which restricts the real speed up for existing accelerators. To this end, we propose an algorithm-architecture co-design, named Structured Dynamic Precision (SDP). Specifically, we propose a quantization scheme in which the high-order bit part and the low-order bit part of data can be masked independently. And a fixed number of term parts are dynamically selected for computation based on the importance of each term in the group. We also present a hardware design to enable the algorithm efficiently with small overheads, whose inference time mainly scales with the precision proportionally. Evaluation experiments on extensive networks demonstrate that compared to the state-of-the-art dynamic quantization accelerator DRQ, our SDP can achieve 29% performance gain and 51% energy reduction for the same level of model accuracy.

19 April 2022 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
KHKai Huang
Kai Huang
BLBowen Li
Bowen Li
SCSiang Chen
Siang Chen
LCLuc Claesen
Luc Claesen
WXWei Xi
Wei Xi
XYXiaolang Yan
Xiaolang Yan
The state-of-the-art convolutional neural network accelerators are showing a growing interest in exploiting the bit-level sparsity and eliminating the ineffectual computations of zero bits. However, the excessive redundancy and the irregular distribution of nonzero bits limit the real speedup in the accelerators. To address this, we propose an algorithm-architecture codesign, named structured term pruning (STP), to boost the computation efficiency of neural networks inference. Specifically, we enhance the bit sparsity by guiding the weights toward the value with fewer power-of-two terms. Then, we structure the terms with layer-wise group budgets. Retraining is adopted to recover the accuracy drop. We also design the hardware of the group processing element and the fast signed-digital encoder for efficient implementation of STP networks. The system design of STP is realized with some easy alterations on an input stationary systolic array design. Extensive evaluation results demonstrate that STP can reduce significant inference computation costs, and achieve $2.35\times $ computational energy saving for the ResNet18 network on the ImageNet dataset.

24 January 2022 in Journal of Systems Architecture
Verified
Journal Article
Closed access
KHKai HUANG
Kai HUANG
SCSiang Chen
Siang Chen
BLBowen Li
Bowen Li
LCLuc Claesen
Luc Claesen
HYHao Yao
Hao Yao
DXDongliang Xiong
Dongliang Xiong


1 January 2020
Verified
Book Chapter
Closed access
PDF file
DXDongliang Xiong
Dongliang Xiong
KHKai HUANG
Kai HUANG
HJHaitian Jiang
Haitian Jiang
BLBowen Li
Bowen Li
SCSiang Chen
Siang Chen
XJXiaowen Jiang
Xiaowen Jiang