← Search

Pengle Zhang

7 accepted papers

2026

Deterministic Differentiable Structured Pruning for Large Language Models

ICML 2026poster

Structured pruning reduces LLM inference cost by removing low-importance architectural components. This can be viewed as learning a multiplicative gate for each component under an $\ell_0$ sparsity constraint. Due to the discreteness of the $\ell_0$ norm, prior work typically adopts stochastic hard-…

Cited by 0SourceScholar
2026

TetraJet-v2: Accurate NVFP4 Training for Large Language Models with Oscillation Suppression and Outlier Control

ICML 2026spotlight

Large Language Models (LLMs) training is prohibitively expensive, driving interest in low-precision fully-quantized training (FQT). While novel 4-bit formats like NVFP4 offer substantial efficiency gains, achieving near-lossless training at such low precision remains challenging. We introduce **Tetr…

Cited by 0SourceScholar
2025

SageAttention2: Efficient Attention with Thorough Outlier Smoothing and Per-thread INT4 Quantization

ICML 2025poster

Although quantization for linear layers has been widely used, its application to accelerate the attention process remains limited. To further enhance the efficiency of attention computation compared to SageAttention while maintaining precision, we propose SageAttention2, which utilizes significantly…

2025

SageAttention3: Microscaling FP4 Attention for Inference and An Exploration of 8-Bit Training

NeurIPS 2025spotlight

The efficiency of attention is important due to its quadratic time complexity. We enhance the efficiency of attention through two key contributions: First, we leverage the new $\texttt{FP4}$ Tensor Cores in Blackwell GPUs to accelerate attention computation. Our implementation achieves $\textbf{1038…

Cited by 0SourcecodeScholar
2025

SageAttention: Accurate 8-Bit Attention for Plug-and-play Inference Acceleration

ICLR 2025poster

The transformer architecture predominates across various models. As the heart of the transformer, attention has a computational complexity of $O(N^2)$, compared to $O(N)$ for linear transformations. When handling large sequence lengths, attention becomes the primary time-consuming component. Althoug…

2024

InfLLM: Training-Free Long-Context Extrapolation for LLMs with an Efficient Context Memory

NeurIPS 2024poster

Large language models (LLMs) have emerged as a cornerstone in real-world applications with lengthy streaming inputs (e.g., LLM-driven agents). However, existing LLMs, pre-trained on sequences with a restricted maximum length, cannot process longer sequences due to the out-of-domain and distraction i…

2023

Variator: Accelerating Pre-trained Models with Plug-and-Play Compression Modules

EMNLP 2023long findings

Large language models (LLMs) have achieved remarkable results on NLP tasks but at the expense of huge parameter sizes and the consequent computational costs. In this paper, we propose Variator, a parameter-efficient acceleration method that enhances computational efficiency through plug-and-play com…

Cited by 0SourcecodeScholar