EDBT 2026 Demo / reviewers in the wild / expert
Qisheng He
dblp:38/8947
· DBLP profile ↗
2ranked-venue papers in the field
2as first author
2since 2021 · last 2023
—ORCID · conflict
Domains — venue-derived; a paper can count in several
Big Data, Cloud & Distributed Data Systems · 2 (2 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Transferring Lottery Tickets in Computer Vision Models: a Dynamic Pruning ApproachabstractDeep neural networks can achieve state-of-the-art results on small size datasets by transferring the backbone from a network pre-trained on large datasets. Recent work has shown that pruned networks can also be used as pre-trained models in transfer learning. In this paper, we proposed a novel framework, Transferring Lottery Ticket (TLT), to adapt both masks and weights of a pre-trained and pruned network dynamically during the knowledge transfer to downstream tasks. We show that the lottery tickets of downstream tasks are dramatically different from each other and from the one obtained from the pre-trained network. Thus, both masks and weights need to be learned to better adapt a pre-trained model to the target domain. Our extensive experiments on multiple computer vision tasks, such as image classification and segmentation, show that the transferred networks with adapted masks outperform the ones with original masks at various pruning ratios. Qisheng He, Ming Dong 0001 |
IEEE Big Data | 1 |
| 2023 | Learning Pruned Structure and Weights Simultaneously from Scratch: an Attention based ApproachabstractAs a deep learning model typically contains millions of trainable weights, there has been a growing demand for a more efficient network structure with reduced storage space and improved run-time efficiency. Pruning is one of the most popular network compression techniques. In this paper, we propose a novel unstructured pruning pipeline, Attention-based Simultaneous sparse structure and Weight Learning (ASWL). In ASWL, an efficient algorithm is proposed to calculate the pruning ratios layer-wisely from attentions, and both weights for the dense network and the sparse network are tracked so that the pruned structure is simultaneously learned from randomly initialized weights. Our experiments on MNIST, Cifar10, and ImageNet show that ASWL achieves superior pruning results in terms of accuracy, pruning ratio and operating efficiency when compared with state-of-the-art network pruning methods. Qisheng He, Weisong Shi, Ming Dong 0001 |
IEEE Big Data | 1 |