Demo Data from VLDB 2026 / reviewers in the wild / expert
Daihai Liao
dblp:332/1407
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Artificial intelligence and machine learning · 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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › model compression › quantization › post-training quantization
data-free quantization |
0.7 | 1 | 2023 | Hard Sample Matters a Lot in Zero-Shot Quantization · CVPR 2023 |
Machine learning › Efficient and distributed learning
hard sample synthesis |
0.7 | 1 | 2023 | Hard Sample Matters a Lot in Zero-Shot Quantization · CVPR 2023 |
Machine learning › Efficient and distributed learning
model compression |
0.7 | 1 | 2023 | Hard Sample Matters a Lot in Zero-Shot Quantization · CVPR 2023 |
Machine learning › Efficient and distributed learning › model compression
quantization |
0.7 | 1 | 2023 | Hard Sample Matters a Lot in Zero-Shot Quantization · CVPR 2023 |
Methods — techniques the papers use, named apart from their topics
synthetic sample generation · 0.7feature alignment · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Automated Dominative Subspace Mining for Efficient Neural Architecture SearchabstractNeural Architecture Search (NAS) aims to automatically find effective architectures within a predefined search space. However, the search space is often extremely large. As a result, directly searching in such a large search space is non-trivial and also very time-consuming. To address the above issues, in each search step, we seek to limit the search space to a small but effective subspace to boost both the search performance and search efficiency. To this end, we propose a novel Neural Architecture Search method via Dominative Subspace Mining (DSM-NAS) that finds promising architectures in automatically mined subspaces. Specifically, we first perform a global search,i.e., dominative subspace mining, to find a good subspace from a set of candidates. Then, we perform a local search within the mined subspace to find effective architectures. More critically, we further boost search performance by taking well-designed/ searched architectures to initialize candidate subspaces. Experimental results demonstrate that DSM-NAS not only reduces the search cost but also discovers better architectures than state-of-the-art methods in various benchmark search spaces. Yaofo Chen, Daihai Liao, Fanbing Lv, Hengjie Song, James T. Kwok, Mingkui Tan |
IEEE Trans. Circuits Syst. Video Technol. | 3 |
| 2023 | Hard Sample Matters a Lot in Zero-Shot QuantizationabstractZero-shot quantization (ZSQ) is promising for compressing and accelerating deep neural networks when the data for training full-precision models are inaccessible. In ZSQ, network quantization is performed using synthetic samples, thus, the performance of quantized models depends heavily on the quality of synthetic samples. Nonetheless, we find that the synthetic samples constructed in existing ZSQ methods can be easily fitted by models. Accordingly, quantized models obtained by these methods suffer from significant performance degradation on hard samples. To address this issue, we propose HArd sample Synthesizing and Training (HAST). Specifically, HAST pays more attention to hard samples when synthesizing samples and makes synthetic samples hard to fit when training quantized models. HAST aligns features extracted by full-precision and quantized models to ensure the similarity between features extracted by these two models. Extensive experiments show that HAST significantly outperforms existing ZSQ methods, achieving performance comparable to models that are quantized with real data. Huantong Li, Xiangmiao Wu, Fanbing Lv, Daihai Liao, Thomas H. Li, Yonggang Zhang 0003, Bo Han 0003, Mingkui Tan |
CVPR | 4 |