Demo Data from VLDB 2026 / reviewers in the wild / expert
Yijun Tan
dblp:346/1017
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware accelerators and domain-specific architectures · 100% | |
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware accelerators and domain-specific architectures › machine learning accelerator
CNN accelerator |
0.6 | 1 | 2022 | Accelerating Sparse Convolution with Column Vector-Wise Sparsity · NeurIPS 2022 |
Hardware accelerators and domain-specific architectures › sparsity exploitation
sparse convolution |
0.6 | 1 | 2022 | Accelerating Sparse Convolution with Column Vector-Wise Sparsity · NeurIPS 2022 |
Hardware accelerators and domain-specific architectures › sparsity exploitation
structured sparsity |
0.6 | 1 | 2022 | Accelerating Sparse Convolution with Column Vector-Wise Sparsity · NeurIPS 2022 |
Machine learning › Efficient and distributed learning
model compression |
0.2 | 1 | 2022 | Accelerating Sparse Convolution with Column Vector-Wise Sparsity · NeurIPS 2022 |
Machine learning › Efficient and distributed learning › model compression › sparsity
weight sparsity |
0.2 | 1 | 2022 | Accelerating Sparse Convolution with Column Vector-Wise Sparsity · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
im2col · 1.1clustering-based channel permutation · 1.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Accelerating Sparse Convolution with Column Vector-Wise SparsityabstractWeight sparsity is a promising approach to reducing the model size and computation cost of convolutional neural networks (CNNs). Nevertheless, non-zero weights often distribute randomly in sparse CNN models, introducing enormous difficulty in obtaining actual speedup on common hardware (e.g., GPU) over their dense counterparts. Existing acceleration solutions either require hardware modifications for irregular memory access support or rely on a partially structured sparsity pattern. Neither of these methods is capable of achieving fruitful speedup on convolution layers.In this work, we propose an algorithm-software co-designed sparse convolution based on a novel out-vector-wise (OVW) sparse pattern. Building on the insight that vertical vector integrity can preserve continuous memory access in IM2COL, the OVW pattern treats a $V\times1$ vector as an entirety. To reduce the error caused by sparsity, we propose an equivalent transformation process, i.e., clustering-based channel permutation, to gather similar rows together. Experimental evaluations demonstrate that our method achieves a $1.7\times$ and $3.2\times$ speedup over the SOTA solution and the dense convolution of ResNet50 on NVIDIA V100 at 75\% sparsity, respectively, with only negligible accuracy loss. Moreover, compared to the SOTA solution that achieves speedups only on data with 60\% sparsity or more, our method begins to obtain speedups on data with only 10\% sparsity. Yijun Tan, Kai Han 0002, Xianzhi Yu, Zidong Du, Yunji Chen, Yunhe Wang 0001 |
NeurIPS | 1 |