← Search

Yixing Xu

21 accepted papers

2026

Learnable Permutation for Structured Sparsity on Transformer Models

AAAI 2026technical

Structured sparsity has emerged as a popular model pruning technique, widely adopted in various architectures, including CNNs, Transformer models, and especially large language models (LLMs) in recent years. A promising direction to further improve post-pruning performance is weight permutation, whi

Cited by 0SourcePDFScholar
2026

SparK: Query-Aware Unstructured Sparsity with Recoverable KV Cache Channel Pruning

AAAI 2026technical

Long-context inference in large language models (LLMs) is increasingly constrained by the KV cache bottleneck: memory usage grows linearly with sequence length, while attention computation scales quadratically. Existing approaches address this issue by compressing the KV cache along the temporal axi

Cited by 0SourcePDFScholar
2026

Training-Free Loosely Speculative Decoding: Accepting Semantically Correct Drafts Beyond Exact Match

ICLR 2026poster

Large language models (LLMs) achieve strong performance across diverse tasks but suffer from high inference latency due to their autoregressive generation. Speculative Decoding (SPD) mitigates this issue by verifying candidate tokens from a smaller draft model in parallel, yet its strict exact-matc…

Cited by 0SourcecodeScholar
2025

Enhancing One-Shot Pruned Pre-trained Language Models through Sparse-Dense-Sparse Mechanism

COLING 2025main

Pre-trained language models (PLMs) are engineered to be robust in contextual understanding and exhibit outstanding performance in various natural language processing tasks. However, their considerable size incurs significant computational and storage costs. Modern pruning strategies employ retrainin…

Cited by 0SourcePDFScholar
2025

Gumiho: A Hybrid Architecture to Prioritize Early Tokens in Speculative Decoding

ICML 2025poster

Speculative decoding (SPD) aims to accelerate the auto-regressive token generation process of a target Large Language Model (LLM). Some approaches employ a draft model with multiple heads to predict a sequence of future tokens, where each head handles a token in the sequence. The target LLM verifies…

2025

Týr-the-Pruner: Structural Pruning LLMs via Global Sparsity Distribution Optimization

NeurIPS 2025poster

Structural pruning enhances hardware-agnostic inference efficiency for large language models (LLMs) yet often fails to maintain comparable performance. Local pruning performs efficient layer-by-layer compression but ignores global topology. Although global pruning aims to identify an optimal sparse…

Cited by 0SourceScholar
2024

Enhancing Vision Transformer: Amplifying Non-Linearity in Feedforward Network Module

ICML 2024poster

Transformer models have been gaining substantial interest in the field of computer vision tasks nowadays. Although a vision transformer contains two important components which are self-attention module and feedforward network (FFN) module, the majority of research tends to concentrate on modifying t…

Cited by 3SourcePDFScholar
2024

QT-ViT: Improving Linear Attention in ViT with Quadratic Taylor Expansion

NeurIPS 2024poster

Vision transformer model (ViT) is widely used and performs well in vision tasks due to its ability to capture long-range dependencies. However, the time complexity and memory consumption increase quadratically with the number of input patches which limits the usage of ViT in real-world applications.…

Cited by 0SourcePDFScholar
2023

FDViT: Improve the Hierarchical Architecture of Vision Transformer

ICCV 2023poster

Despite the fact that transformer-based models have yielded great success in computer vision tasks, they suffer from the challenge of high computational costs that limits their use on resource-constrained devices. One major reason is that vision transformers have redundant calculations since the sel…

Cited by 18PDFScholar
2022

Federated Learning with Positive and Unlabeled Data

ICML 2022spotlight

We study the problem of learning from positive and unlabeled (PU) data in the federated setting, where each client only labels a little part of their dataset due to the limitation of resources and time. Different from the settings in traditional PU learning where the negative class consists of a sin…

2022

Source-Free Domain Adaptation via Distribution Estimation

CVPR 2022poster

Domain Adaptation aims to transfer the knowledge learned from a labeled source domain to an unlabeled target domain whose data distributions are different. However, the training data in source domain required by most of the existing methods is usually unavailable in real-world applications due to pr…

Cited by 161PDFScholar
2021

Learning Frequency Domain Approximation for Binary Neural Networks

NeurIPS 2021oral

Binary neural networks (BNNs) represent original full-precision weights and activations into 1-bit with sign function. Since the gradient of the conventional sign function is almost zero everywhere which cannot be used for back-propagation, several attempts have been proposed to alleviate the optimi…

Cited by 71SourcePDFScholar
2021

ReNAS: Relativistic Evaluation of Neural Architecture Search

CVPR 2021poster

An effective and efficient architecture performance evaluation scheme is essential for the success of Neural Architecture Search (NAS). To save computational cost, most of existing NAS algorithms often train and evaluate intermediate neural architectures on a small proxy dataset with limited trainin…

Cited by 106PDFcodeScholar
2020

Kernel Based Progressive Distillation for Adder Neural Networks

NeurIPS 2020spotlight

Adder Neural Networks (ANNs) which only contain additions bring us a new way of developing deep neural networks with low energy consumption. Unfortunately, there is an accuracy drop when replacing all convolution filters by adder filters. The main reason here is the optimization difficulty of ANNs u…

Cited by 52SourcePDFScholar
2020

SCOP: Scientific Control for Reliable Neural Network Pruning

NeurIPS 2020poster

This paper proposes a reliable neural network pruning algorithm by setting up a scientific control. Existing pruning methods have developed various hypotheses to approximate the importance of filters to the network and then execute filter pruning accordingly. To increase the reliability of the resul…

2020

Training Binary Neural Networks through Learning with Noisy Supervision

ICML 2020poster

This paper formalizes the binarization operations over neural networks from a learning perspective. In contrast to classical hand crafted rules (\eg hard thresholding) to binarize full-precision neurons, we propose to learn a mapping from full-precision neurons to the target binary ones. Each indivi…

Cited by 62SourcePDFScholar
2019

Positive-Unlabeled Compression on the Cloud

NeurIPS 2019poster

Many attempts have been done to extend the great success of convolutional neural networks (CNNs) achieved on high-end GPU servers to portable devices such as smart phones. Providing compression and acceleration service of deep learning models on the cloud is therefore of significance and is attracti…

Cited by 64SourcePDFScholar