← Search

Xianzhi Yu

9 accepted papers

2026

Rethinking Depth Pruning for Vision Transformers: A Heterogeneity-Aware Perspective

ICML 2026poster

While prior studies have successfully compressed vision Transformers (ViTs) through various pruning techniques, most have concentrated on width pruning to achieve significant reductions in model size. Depth pruning, which involves the removal of entire layers from a ViT, is notoriously difficult for…

Cited by 0SourceScholar
2026

Scaling Up, Speeding Up: A Benchmark of Speculative Decoding for Efficient LLM Test-Time Scaling

ICLR 2026poster

Test-time scaling has emerged as a powerful paradigm for enhancing the reasoning capabilities of large language models (LLMs) by allocating additional computational resources during inference. However, this paradigm is inherently inefficient due to the generation of redundant and repetitive reasonin…

Cited by 0SourcecodeScholar
2026

TrimR: Verifier-based Training-Free Thinking Trimming for Efficient Test-Time Scaling

ICLR 2026poster

Large Reasoning Models (LRMs) demonstrate exceptional capability in tackling complex mathematical, logical, and coding tasks by leveraging extended Chain-of-Thought (CoT) reasoning. Test-time scaling methods—such as prolonging CoT with explicit token-level exploration—can push LRMs’ accuracy boundar…

Cited by 0SourceScholar
2025

AttentionPredictor: Temporal Patterns Matter for KV Cache Compression

NeurIPS 2025poster

With the development of large language models (LLMs), efficient inference through Key-Value (KV) cache compression has attracted considerable attention, especially for long-context generation. To compress the KV cache, recent methods identify critical KV tokens through static modeling of attention s…

Cited by 0SourcecodeScholar
2025

Faster and Better LLMs via Latency-Aware Test-Time Scaling

EMNLP 2025

Test-Time Scaling (TTS) has proven effective in improving the performance of Large Language Models (LLMs) during inference. However, existing research has overlooked the efficiency of TTS from a latency-sensitive perspective. Through a latency-aware evaluation of representative TTS methods, we demon

Cited by 0SourcePDFScholar
2025

FlatQuant: Flatness Matters for LLM Quantization

ICML 2025poster

Recently, quantization has been widely used for the compression and acceleration of large language models (LLMs). Due to the outliers in LLMs, it is crucial to flatten weights and activations to minimize quantization error with equally spaced quantization points. Prior research explores various pre-…

2025

L-MTP: Leap Multi-Token Prediction Beyond Adjacent Context for Large Language Models

NeurIPS 2025poster

Large language models (LLMs) have achieved notable progress. Despite their success, next-token prediction (NTP), the dominant method for LLM training and inference, is constrained in both contextual coverage and inference efficiency due to its inherently sequential process. To overcome these challen…

Cited by 0SourcecodeScholar
2025

MoESD: Unveil Speculative Decoding's Potential for Accelerating Sparse MoE

NeurIPS 2025spotlight

Large Language Models (LLMs) have achieved remarkable success across many applications, with Mixture of Experts (MoE) models demonstrating great potential. Compared to traditional dense models, MoEs achieve better performance with less computation. Speculative decoding (SD) is a widely used techniqu…

Cited by 0SourceScholar
2022

Accelerating Sparse Convolution with Column Vector-Wise Sparsity

NeurIPS 2022accept

Weight sparsity is a promising approach to reducing the model size and computation cost of convolutional neural networks (CNNs). Nevertheless, non-zero weights often distribute randomly in sparse CNN models, introducing enormous difficulty in obtaining actual speedup on common hardware (e.g., GPU) o…

Cited by 14SourcePDFScholar