activity
20172026
most citedPatDNN: Achieving Real-Time DNN Execution on Mobile Devices with Pattern-based Weight Pruning

211 citations · 847 across the 45 of their papers we have counts for

collaborators
Showing 2022Show all

5 papers · 1 filter

cs.CV2022

Peeling the Onion: Hierarchical Reduction of Data Redundancy for Efficient Vision Transformer Training

Zhenglun Kong, Haoyu Ma, Geng Yuan +12

Vision transformers (ViTs) have recently obtained success in many applications, but their intensive computation and heavy memory usage at both training and inference time limit the…

cs.CV2022★ 2 cited

Data Level Lottery Ticket Hypothesis for Vision Transformers

Xuan Shen, Zhenglun Kong, Minghai Qin +6

The conventional lottery ticket hypothesis (LTH) claims that there exists a sparse subnetwork within a dense neural network and a proper random initialization method called the win…

cs.CV2022★ 2 cited

CHEX: CHannel EXploration for CNN Model Compression

Zejiang Hou, Minghai Qin, Fei Sun +7

Channel pruning has been broadly recognized as an effective technique to reduce the computation and memory cost of deep convolutional neural networks. However, conventional pruning…

cs.LG2022★ 28 cited

VAQF: Fully Automatic Software-Hardware Co-Design Framework for Low-Bit Vision Transformer

Mengshu Sun, Haoyu Ma, Guoliang Kang +5

The transformer architectures with attention mechanisms have obtained success in Nature Language Processing (NLP), and Vision Transformers (ViTs) have recently extended the applica…

cs.LG2022★ 5 cited

Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets

Tianlong Chen, Xuxi Chen, Xiaolong Ma +2

The lottery ticket hypothesis (LTH) has shown that dense models contain highly sparse subnetworks (i.e., winning tickets) that can be trained in isolation to match full accuracy. D…