Demo Data from VLDB 2026 / reviewers in the wild / expert
Yixuan Qian
dblp:354/9085
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial 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
1 paper |
Efficient and distributed learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › model compression › post-training compression
data-free compression |
0.7 | 1 | 2023 | Unified Data-Free Compression: Pruning and Quantization without Fine-Tuning · ICCV 2023 |
Machine learning › Efficient and distributed learning
model compression |
0.7 | 1 | 2023 | Unified Data-Free Compression: Pruning and Quantization without Fine-Tuning · ICCV 2023 |
Machine learning › Efficient and distributed learning › model compression
pruning and quantization |
0.7 | 1 | 2023 | Unified Data-Free Compression: Pruning and Quantization without Fine-Tuning · ICCV 2023 |
Methods — techniques the papers use, named apart from their topics
closed-form solution · 0.7channel reconstruction · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Unified Data-Free Compression: Pruning and Quantization without Fine-TuningabstractStructured pruning and quantization are promising approaches for reducing the inference time and memory footprint of neural networks. However, most existing methods require the original training dataset to fine-tune the model. This not only brings heavy resource consumption but also is not possible for applications with sensitive or proprietary data due to privacy and security concerns. Therefore, a few data-free methods are proposed to address this problem, but they perform data-free pruning and quantization separately, which does not explore the complementarity of pruning and quantization. In this paper, we propose a novel framework named Unified Data-Free Compression(UDFC), which performs pruning and quantization simultaneously without any data and fine-tuning process. Specifically, UDFC starts with the assumption that the partial information of a damaged(e.g., pruned or quantized) channel can be preserved by a linear combination of other channels, and then derives the reconstruction form from the assumption to restore the information loss due to compression. Finally, we formulate the reconstruction error between the original network and its compressed network, and theoretically deduce the closed-form solution. We evaluate the UDFC on the large-scale image classification task and obtain significant improvements over various network architectures and compression methods. For example, we achieve a 20.54% accuracy improvement on ImageNet dataset compared to SOTA method with 30% pruning ratio and 6-bit quantization on ResNet-34. Code will be available at here. Shipeng Bai, Jun Chen 0023, Xintian Shen, Yixuan Qian, Yong Liu 0007 |
ICCV | 4 |