Demo Data from EDBT 2026 / reviewers in the wild / expert
Yu Zheng 0022
dblp:87/1585-22
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 2 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
3 papers |
Efficient and distributed learning · 64% Deep learning architectures and training · 23% Representation and self-supervised learning · 9% |
Topics — the 11 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › model compression
large language model compression |
0.9 | 1 | 2025 | SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression · ICLR 2025 |
Machine learning › Efficient and distributed learning › model compression
low-rank approximation |
0.9 | 1 | 2025 | SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression · ICLR 2025 |
Machine learning › Efficient and distributed learning
model compression |
0.9 | 1 | 2025 | SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression · ICLR 2025 |
Machine learning › Efficient and distributed learning › model compression › low-rank approximation
SVD-based compression |
0.9 | 1 | 2025 | SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression · ICLR 2025 |
Machine learning › Deep learning architectures and training › data augmentation
automatic data augmentation |
0.6 | 1 | 2022 | Deep AutoAugment · ICLR 2022 |
Machine learning › Deep learning architectures and training
data augmentation |
0.6 | 1 | 2022 | Deep AutoAugment · ICLR 2022 |
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
architecture representation learning |
0.4 | 1 | 2020 | Does Unsupervised Architecture Representation Learning Help Neural Architecture Search? · NeurIPS 2020 |
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search |
0.4 | 1 | 2020 | Does Unsupervised Architecture Representation Learning Help Neural Architecture Search? · NeurIPS 2020 |
Natural language and speech › Language models and text generation
large language model |
0.3 | 1 | 2025 | SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression · ICLR 2025 |
Machine learning › Deep learning architectures and training
transformer |
0.3 | 1 | 2025 | SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compression · ICLR 2025 |
Machine learning › Representation and self-supervised learning › representation learning
unsupervised representation learning |
0.1 | 1 | 2020 | Does Unsupervised Architecture Representation Learning Help Neural Architecture Search? · NeurIPS 2020 |
Methods — techniques the papers use, named apart from their topics
singular value decomposition · 0.9sequential low-rank approximation · 0.9data whitening · 0.9reinforcement learning · 0.6automatic data augmentation · 0.6unsupervised pre-training · 0.4architecture encoding · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model CompressionabstractThe advancements in Large Language Models (LLMs) have been hindered by
their substantial sizes, which necessitates LLM compression methods for practical
deployment. Singular Value Decomposition (SVD) offers a promising solution for
LLM compression. However, state-of-the-art SVD-based LLM compression meth-
ods have two key limitations: truncating smaller singular values may lead to higher
compression loss, and the lack of update on the compressed weights after SVD
truncation. In this work, we propose SVD-LLM, a SVD-based post-training LLM
compression method that addresses the limitations of existing methods. SVD-LLM
incorporates a truncation-aware data whitening technique to ensure a direct map-
ping between singular values and compression loss. Moreover, SVD-LLM adopts
a parameter update with sequential low-rank approximation to compensate for
the accuracy degradation after SVD compression. We evaluate SVD-LLM on 10
datasets and seven models from three different LLM families at three different
scales. Our results demonstrate the superiority of SVD-LLM over state-of-the-arts,
especially at high model compression ratios. Xin Wang 0120, Yu Zheng 0022, Zhongwei Wan, Mi Zhang 0002 |
ICLR | 2 |
| 2022 | Deep AutoAugment
Yu Zheng 0022, Shen Yan 0008, Mi Zhang 0002 |
ICLR | 1 |
| 2020 | Does Unsupervised Architecture Representation Learning Help Neural Architecture Search?abstractExisting Neural Architecture Search (NAS) methods either encode neural architectures using discrete encodings that do not scale well, or adopt supervised learning-based methods to jointly learn architecture representations and optimize architecture search on such representations which incurs search bias. Despite the widespread use, architecture representations learned in NAS are still poorly understood. We observe that the structural properties of neural architectures are hard to preserve in the latent space if architecture representation learning and search are coupled, resulting in less effective search performance. In this work, we find empirically that pre-training architecture representations using only neural architectures without their accuracies as labels improves the downstream architecture search efficiency. To explain this finding, we visualize how unsupervised architecture representation learning better encourages neural architectures with similar connections and operators to cluster together. This helps map neural architectures with similar performance to the same regions in the latent space and makes the transition of architectures in the latent space relatively smooth, which considerably benefits diverse downstream search strategies. Shen Yan 0008, Yu Zheng 0022, Mi Zhang 0002 |
NeurIPS | 2 |