Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zelan Yang

dblp:208/3497 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—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 · 75% Robot manipulation · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
0.912025
Treasures in Discarded Weights for LLM Quantization · AAAI 2025
Machine learning › Efficient and distributed learning › model compression › quantization
post-training quantization
0.912025
Treasures in Discarded Weights for LLM Quantization · AAAI 2025
Machine learning › Efficient and distributed learning › model compression
quantization
0.912025
Treasures in Discarded Weights for LLM Quantization · AAAI 2025
Robotics › Robot manipulation › robot design › static balancing
weight compensation mechanism
0.912025
Treasures in Discarded Weights for LLM Quantization · AAAI 2025

Methods — techniques the papers use, named apart from their topics

search space construction · 0.9global information capture · 0.9
YearPublicationVenuePosition
2025 Treasures in Discarded Weights for LLM Quantization
abstract
In recent years, large language models (LLMs) have developed rapidly and revolutionized natural language processing. However, high storage overhead and computing costs limit LLM deployment in resource-constrained environments. Quantization algorithms can effectively compress LLMs and accelerate inference, but they lead to loss in precision, especially in low-bit scenarios. In this paper, we find that the discarded weight values caused by quantization in fact contain treasures to improve LLMs' accuracy. To excavate those hidden treasures, we construct search spaces around these discarded weights and those weights within the search space can seamlessly be incorporated into the original quantization weights. To determine which weights should be merged, we design a plug-and-play weight compensation framework to capture global information and keep the weights with the highest potential benefits. Our framework can be combined with various LLM quantization algorithms to achieve higher precision without additional inference overhead. We validate the effectiveness of our approach on widely used benchmark datasets for LLMs.
Hao Yu 0027, Bohua Chen, Zelan Yang, Jianxin Wu 0001
AAAI4
2025 SQ-Delta: Ultra-High Delta Compression for LLMs via Joint Sparsification-Quantization
abstract
Current delta compression methods struggle to achieve ultra-high compression, failing to minimize the deployment costs of multiple full-parameter fine-tuned large language models. To address this issue, we propose a novel distribution-driven delta compression framework SQ-Delta, which utilizes joint sparsification-quantization to maximize the compression ratio. We have observed that the matrix-computed intermediate results for the delta weight exhibit small variance and min-max range characteristics. Exploiting this distribution phenomenon, we introduce Group-wise Dropout to perform dropout on the delta weight using an optimal group size. Furthermore, using Separate Quantization, the sparse delta weight is quantized and decomposed to achieve a lower bit. Experimental results show that SQ-Delta achieves 16× compression with improved accuracy compared to baselines for WizardMath and WizardCoder models across different parameter scales. Moreover, SQ-Delta demonstrates the ability for ultra-high compression, achieving 128× compression for the WizardMath-7B model and 512× compression for the WizardMath-70B model. Our code is available at https://github.com/llwx593/SQ-Delta.
Yanfeng Jiang, Zelan Yang, Bohua Chen
ICME2