paper-with-me

Papers

Language Model-Driven Data Pruning Enables Efficient Active Learning

2024-10-05 · Abdul Hameed Azeemi, Ihsan Ayyub Qazi, Agha Ali Raza

Active learning (AL) optimizes data labeling efficiency by selecting the most informative instances for annotation. A key component in this procedure is an acquisition function that guides the selection process and identifies the suitable instances for labeling from the unlabeled pool. However, these acquisition methods suffer from high computational costs with large unlabeled data pools, posing a roadblock to their applicability on large datasets. To address this challenge and bridge this gap, we introduce a novel plug-and-play unlabeled data pruning strategy, ActivePrune, which leverages language models to prune the unlabeled pool. ActivePrune implements a two-stage pruning process: an initial fast evaluation using perplexity scores from an n-gram language model, followed by a high-quality selection using metrics for data quality computed through a quantized LLM. Additionally, to enhance the diversity in the unlabeled pool, we propose a novel perplexity reweighting method that systematically brings forward underrepresented instances for selection in subsequent labeling iterations. Experiments on translation, sentiment analysis, topic classification, and summarization tasks on four diverse datasets and four active learning strategies demonstrate that ActivePrune outperforms existing data pruning methods. Finally, we compare the selection quality $\leftrightarrow$ efficiency tradeoff of the data pruning methods and demonstrate that ActivePrune is computationally more efficient than other LLM score-based pruning methods, and provides up to 74% reduction in the end-to-end time required for active learning.

📄 PDF Abstract BibTeX arXiv:2410.04275

Code (0)

등록된 구현이 없습니다.

Tasks

Active LearningLanguage ModelingLanguage ModellingSentiment AnalysisTopic Classification

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Spatio-Temporal Pruning for Compressed Spiking Large Language Models

2025-08-23 · Yi Jiang, Malyaban Bal, Brian Matejek, Susmit Jha 외 arxiv

Large Language Models (LLMs) present significant challenges for deployment in energy-constrained environments due to their large model sizes and high inference latency. Spiking Neural Networks (SNNs), inspired by the spa…

Computational EfficiencyKnowledge Distillation

A Glimpse to Compress: Dynamic Visual Token Pruning for Large Vision-Language Models

2025-08-03 · Quan-Sheng Zeng, Yunheng Li, Qilong Wang, Peng-Tao Jiang 외 arxiv

Visual token compression is critical for Large Vision-Language Models (LVLMs) to efficiently process high-resolution inputs. Existing methods that typically adopt fixed compression ratios cannot adapt to scenes of varyin…

Answer Generation

IPCV: Information-Preserving Compression for MLLM Visual Encoders

2025-12-21 · Yuan Chen, Zichen Wen, Yuzhou Wu, Xuyang Liu 외 arxiv

Multimodal Large Language Models (MLLMs) deliver strong vision-language performance but at high computational cost, driven by numerous visual tokens processed by the Vision Transformer (ViT) encoder. Existing token pruni…

3D Skeletonization of Complex Grapevines for Robotic Pruning

2023-07-21 · Eric Schneider, Sushanth Jayanth, Abhisesh Silwal, George Kantor

Robotic pruning of dormant grapevines is an area of active research in order to promote vine balance and grape quality, but so far robotic efforts have largely focused on planar, simplified vines not representative of co…

BackSlash: Rate Constrained Optimized Training of Large Language Models

2025-04-23 · Jun Wu, Jiangtao Wen, Yuxing Han

The rapid advancement of large-language models (LLMs) has driven extensive research into parameter compression after training has been completed, yet compression during the training phase remains largely unexplored. In t…