Demo Data from VLDB 2026 / reviewers in the wild / expert
Jiandong Mu
dblp:176/8035
· DBLP profile ↗
5ranked-venue papers
4as first author
2since 2021 · last 2024
0000-0002-0023-841XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 4 · 4 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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.
| Artificial intelligence
2 papers |
Efficient and distributed learning · 94% Optimization for machine learning · 6% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 33% GPUs and heterogeneous computing · 33% Hardware accelerators and domain-specific architectures · 33% | |
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
model compression |
1.3 | 2 | 2024 | Boosting the Convergence of Reinforcement Learning-Based Auto-Pruning Using Historical Data · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024 Bayesian Optimization with Clustering and Rollback for CNN Auto Pruning · ECCV (23) 2022 |
Machine learning › Efficient and distributed learning › model compression › pruning › structured pruning
channel pruning |
0.8 | 1 | 2024 | Boosting the Convergence of Reinforcement Learning-Based Auto-Pruning Using Historical Data · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024 |
Machine learning › Efficient and distributed learning › model compression
pruning |
0.8 | 1 | 2024 | Boosting the Convergence of Reinforcement Learning-Based Auto-Pruning Using Historical Data · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024 |
High-performance computing › performance optimization
auto-tuning |
0.4 | 1 | 2020 | A History-Based Auto-Tuning Framework for Fast and High-Performance DNN Design on GPU · DAC 2020 |
Hardware accelerators and domain-specific architectures › machine learning accelerator › neural network acceleration
DNN operator optimization |
0.4 | 1 | 2020 | A History-Based Auto-Tuning Framework for Fast and High-Performance DNN Design on GPU · DAC 2020 |
GPUs and heterogeneous computing
GPU computing |
0.4 | 1 | 2020 | A History-Based Auto-Tuning Framework for Fast and High-Performance DNN Design on GPU · DAC 2020 |
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization |
0.2 | 1 | 2022 | Bayesian Optimization with Clustering and Rollback for CNN Auto Pruning · ECCV (23) 2022 |
Methods — techniques the papers use, named apart from their topics
genetic algorithm · 0.9auto-tuning · 0.9XGBoost · 0.9transfer learning · 0.8reinforcement learning · 0.8rollback · 0.6clustering · 0.6bayesian optimization · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Boosting the Convergence of Reinforcement Learning-Based Auto-Pruning Using Historical DataabstractRecently, neural network compression schemes like channel pruning have been widely used to reduce the model size and computational complexity of deep neural networks (DNNs) for applications in power-constrained scenarios, such as embedded systems. Reinforcement learning (RL)-based auto-pruning has been further proposed to automate the DNN pruning process to avoid expensive hand-crafted work. However, the RL-based pruner involves a time-consuming training process, and pruning and evaluating each network comes at high-computational expense. These problems have greatly restricted the real-world application of RL-based auto-pruning. Thus, we propose an efficient auto-pruning framework that solves this problem by taking advantage of the historical data from the previous auto-pruning process. In our framework, we first boost the convergence of the RL-pruner by transfer learning. Then, an augmented transfer learning scheme is proposed to further speed up the training process by improving the transferability. Finally, an assistant learning process is proposed to improve the sample efficiency of the RL agent. The experiments show that our framework can accelerate the auto-pruning process by$1.5\times $–$2.5\times $for ResNet20, and$1.81\times $–$2.375\times $for other neural networks, such as ResNet56, ResNet18, and MobileNet v1. Jiandong Mu, Mengdi Wang 0001, Feiwen Zhu, Jun Yang 0052, Wei Lin 0016, Wei Zhang 0012 |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 1 |
| 2022 | Bayesian Optimization with Clustering and Rollback for CNN Auto Pruning
Hanwei Fan, Jiandong Mu, Wei Zhang 0012 |
ECCV (23) | 2 |
| 2020 | A History-Based Auto-Tuning Framework for Fast and High-Performance DNN Design on GPUabstractWhile Deep Neural Networks (DNNs) are becoming increasingly popular, there is a growing trend to accelerate the DNN applications on hardware platforms like GPUs, FPGAs, etc., to gain higher performance and efficiency. However, it is time-consuming to tune the performance for such platforms due to the large design space and the expensive cost to evaluate each design point. Although many tuning algorithms, such as XGBoost tuner and genetic algorithm (GA) tuner, have been proposed to guide the design space exploring process in the previous work, the timing issue still remains a critical problem. In this work, we propose a novel auto-tuning framework to optimize the DNN operator design on GPU by leveraging the tuning history efficiently in different scenarios. Our experiments show that we can achieve superior performance than the state-of-the-art work, such as auto-tuning framework TVM and the handcraft optimized library cuDNN, while reducing the searching time by 8.96x and 4.58x comparing with XGBoost tuner and GA tuner in TVM. Jiandong Mu, Mengdi Wang 0001, Lanbo Li, Jun Yang 0052, Wei Lin 0016, Wei Zhang 0012 |
DAC | 1 |
| 2020 | Optimizing OpenCL-Based CNN Design on FPGA with Comprehensive Design Space Exploration and Collaborative Performance ModelingabstractRecent success in applying convolutional neural networks (CNNs) to object detection and classification has sparked great interest in accelerating CNNs using hardware-like field-programmable gate arrays (FPGAs). However, finding an efficient FPGA design for a given CNN model and FPGA board is not trivial since a strong background in hardware design and detailed knowledge of the target board are required. In this work, we try to solve this problem by design space exploration with a collaborative framework. Our framework consists of three main parts: FPGA design generation, coarse-grained modeling, and fine-grained modeling. In the FPGA design generation, we propose a novel data structure, LoopTree, to capture the details of the FPGA design for CNN applications without writing down the source code. Different LoopTrees, which indicate different FPGA designs, are automatically generated in this process. A coarse-grained model will evaluate LoopTrees at the operation level, e.g., add, mult, and so on, so that the most efficient LoopTrees can be selected. A fine-grained model, which is based on the source code, will then refine the selected design in a cycle-accurate manner. A set of comprehensive OpenCL-based designs have been implemented on board to verify our framework. An average estimation error of 8.87% and 4.8% has been observed for our coarse-grained model and fine-grained model, respectively. This is much lower than the prevalent operation-statistics-based estimation, which is obtained according to a predefined formula for specific loop schedules. Jiandong Mu, Wei Zhang 0012, Hao Liang 0003, Sharad Sinha |
ACM Trans. Reconfigurable Technol. Syst. | 1 |
| 2018 | A Collaborative Framework for FPGA-based CNN Design Modeling and OptimizationabstractConvolutional neural network (CNN) has presented a great success in numerous areas and has sparked an increasing interest in accelerating CNN using hardware like FPGAs. However, efficient FPGA design for CNN applications requires a long development time and a strong background in hardware details. Consequently, an easy-to-use yet powerful auto CNN design optimization framework is required. In this work, we propose a collaborative framework to model and optimize the OpenCL based FPGA design for CNN applications according to the device resource limitation and the CNN specification. Our framework mainly consists of LoopTree, a novel data structure we propose to capture the structure of OpenCL based CNN design; a LoopTree based coarse-grained model, which will estimate the performance of the CNN design at the module level; and a source code based fine-grained model, which will estimate the CNN design performance in a cycle-accurate manner. Efficient designs can be achieved by collaborating the two models in a search and refined manner. A variety of OpenCL based designs have been implemented on board to verify our framework. The results show that our coarse-grained model and fine-grained model have an average estimation error of 10.2% and 4.7% which are much lower than prevalent operation statistics based estimation calculated by the predefined formula for specific loop schedules. Jiandong Mu, Wei Zhang 0012, Hao Liang 0003, Sharad Sinha |
FPL | 1 |