paper-with-me

Papers

Beyond Loss Values: Robust Dynamic Pruning via Loss Trajectory Alignment

2026-04-08 · Huaiyuan Qin, Muli Yang, Gabriel James Goenawan, Kai Wang, Zheng Wang, Peng Hu, Xi Peng, Hongyuan Zhu arxiv

Existing dynamic data pruning methods often fail under noisy-label settings, as they typically rely on per-sample loss as the ranking criterion. This could mistakenly lead to preserving noisy samples due to their high loss values, resulting in significant performance drop. To address this, we propose AlignPrune, a noise-robust module designed to enhance the reliability of dynamic pruning under label noise. Specifically, AlignPrune introduces the Dynamic Alignment Score (DAS), which is a loss-trajectory-based criterion that enables more accurate identification of noisy samples, thereby improving pruning effectiveness. As a simple yet effective plug-and-play module, AlignPrune can be seamlessly integrated into state-of-the-art dynamic pruning frameworks, consistently outperforming them without modifying either the model architecture or the training pipeline. Extensive experiments on five widely-used benchmarks across various noise types and pruning ratios demonstrate the effectiveness of AlignPrune, boosting accuracy by up to 6.3\% over state-of-the-art baselines. Our results offer a generalizable solution for pruning under noisy data, encouraging further exploration of learning in real-world scenarios. Code is available at: https://github.com/leonqin430/AlignPrune.

📄 PDF Abstract BibTeX arXiv:2604.07306

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Dynamic Runtime Feature Map Pruning

2018-12-24 · Tailin Liang, Lei Wang, Shaobo Shi, John Glossner

High bandwidth requirements are an obstacle for accelerating the training and inference of deep neural networks. Most previous research focuses on reducing the size of kernel maps for inference. We analyze parameter spar…

A Study in Dataset Pruning for Image Super-Resolution

2024-03-25 · Brian B. Moser, Federico Raue, Andreas Dengel

In image Super-Resolution (SR), relying on large datasets for training is a double-edged sword. While offering rich training material, they also demand substantial computational and storage resources. In this work, we an…

Image Super-ResolutionSuper-Resolution

Dynamic Data Pruning for Automatic Speech Recognition

2024-06-26 · Qiao Xiao, Pingchuan Ma, Adriana Fernandez-Lopez, Boqian Wu 외

The recent success of Automatic Speech Recognition (ASR) is largely attributed to the ever-growing amount of training data. However, this trend has made model training prohibitively costly and imposed computational deman…

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)speech-recognitionSpeech Recognition

Beyond FLOPs: Benchmarking Real Inference Acceleration of LLM Pruning under a GEMM-Centric Taxonomy

2026-06-08 · Haozhe Hu, Hao Wu, Anhao Zhao, Longwei Ding 외 arxiv

Pruning has emerged as a dominant paradigm for accelerating large language model (LLM) inference, spanning a broad spectrum of methods that remove computation across tokens, layers, heads, dimensions, and attention patte…

Pruning On-the-Fly: A Recoverable Pruning Method without Fine-tuning

2022-12-24 · Dan Liu, Xue Liu

Most existing pruning works are resource-intensive, requiring retraining or fine-tuning of the pruned models for accuracy. We propose a retraining-free pruning method based on hyperspherical learning and loss penalty ter…