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.

Hao Tan 0005

dblp:94/877-5 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-4475-5937ORCID · conflict

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 · 70% Language models and text generation · 30%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › neural language model
autoregressive transformer
0.912025
Numerical Pruning for Efficient Autoregressive Models · AAAI 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
Numerical Pruning for Efficient Autoregressive Models · AAAI 2025
Machine learning › Efficient and distributed learning › model compression › pruning
weight pruning
0.912025
Numerical Pruning for Efficient Autoregressive Models · AAAI 2025
Machine learning › Efficient and distributed learning
inference acceleration
0.312025
Numerical Pruning for Efficient Autoregressive Models · AAAI 2025

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

structural pruning · 0.9newton's method · 0.9compensation · 0.9
YearPublicationVenuePosition
2025 Numerical Pruning for Efficient Autoregressive Models
abstract
Transformers have emerged as the leading architecture in deep learning, proving to be versatile and highly effective across diverse domains beyond language and image processing. However, their impressive performance often incurs high computational costs due to their substantial model size. This paper focuses on compressing decoder-only transformer-based autoregressive models through structural weight pruning to improve the model efficiency while preserving performance for both language and image generation tasks. Specifically, we propose a training-free pruning method that calculates a numerical score with Newton's method for the Attention and MLP modules, respectively. Besides, we further propose another compensation algorithm to recover the pruned model for better performance. To verify the effectiveness of our method, we provide both theoretical support and extensive experiments. Our experiments show that our method achieves state-of-the-art performance with reduced memory usage and faster generation speeds on GPUs.
Xuan Shen, Zhao Song 0002, Yufa Zhou 0001, Bo Chen 0029, Jing Liu 0001, Ruiyi Zhang 0002, Ryan Rossi, Hao Tan 0005, Tong Yu 0001, Xiang Chen 0010, Yufan Zhou 0001, Tong Sun 0005, Pu Zhao 0001, Yanzhi Wang 0001, Jiuxiang Gu
AAAI8