paper-with-me

Papers

Change Is the Only Constant: Dynamic LLM Slicing based on Layer Redundancy

2024-11-05 · Razvan-Gabriel Dumitru, Paul-Ioan Clotan, Vikas Yadav, Darius Peteleaza, Mihai Surdeanu

This paper introduces a novel model compression approach through dynamic layer-specific pruning in Large Language Models (LLMs), enhancing the traditional methodology established by SliceGPT. By transitioning from constant to dynamic slicing, our method leverages the newly proposed Layer Redundancy (LR) score, which assesses how much change each layer changes its input by measuring the cosine similarity of the input to the output of the layer. We use this score to prune parts of individual layers based on redundancy in such a way that the average pruned percentage for all layers is a fixed value. We conducted extensive experiments using models like Llama3-8B and Mistral-7B on multiple datasets, evaluating different slicing bases and percentages to determine optimal configurations that balance efficiency and performance. Our findings show that our dynamic slicing approach not only maintains but, in many cases, enhances model performance compared to the baseline established by constant slicing methods. For instance, in several settings, we see performance improvements of up to 5% over the SliceGPT baseline. Additionally, a perplexity decrease by as much as 7% was observed across multiple benchmarks, validating the effectiveness of our method. The code, model weights, and datasets are open-sourced at https://github.com/RazvanDu/DynamicSlicing.

📄 PDF Abstract BibTeX arXiv:2411.03513

Code (1)

razvandu/dynamicslicing 공식 구현 pytorch

Tasks

Model Compression

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Towards Sustainability in 6G Network Slicing with Energy-Saving and Optimization Methods

2025-05-17 · Rodrigo Moreira, Tereza C. M. Carvalho, Flávio de Oliveira Silva, Nazim Agoulmine 외

The 6G mobile network is the next evolutionary step after 5G, with a prediction of an explosive surge in mobile traffic. It provides ultra-low latency, higher data rates, high device density, and ubiquitous coverage, pos…

Contrastive Learning

Dynamic RAN Slicing for Service-Oriented Vehicular Networks via Constrained Learning

2020-12-03 · Wen Wu, Nan Chen, Conghao Zhou, Mushu Li 외

In this paper, we investigate a radio access network (RAN) slicing problem for Internet of vehicles (IoV) services with different quality of service (QoS) requirements, in which multiple logically-isolated slices are con…

Reinforcement Learning (RL)

Mobile Network Slicing under Demand Uncertainty: A Stochastic Programming Approach

2023-04-27 · Anousheh Gholami, Nariman Torkzaban, John S. Baras

Network slicing enables the deployment of multiple dedicated virtual sub-networks, i.e. slices on a shared physical infrastructure. Unlike traditional one-size-fits-all resource provisioning schemes, each network slice (…

Adaptive Resource Management for Edge Network Slicing using Incremental Multi-Agent Deep Reinforcement Learning

2023-10-26 · Haiyuan Li, Yuelin Liu, Xueqing Zhou, Xenofon Vasilakos 외

Multi-access edge computing provides local resources in mobile networks as the essential means for meeting the demands of emerging ultra-reliable low-latency communications. At the edge, dynamic computing requests requir…

Deep Reinforcement LearningEdge-computingIncremental LearningManagement+1

Curve-based slicer for multi-axis DLP 3D printing

2025-08-23 · Chengkai Dai, Tao Liu, Dezhao Guo, Binzhi Sun 외 arxiv

This paper introduces a novel curve-based slicing method for generating planar layers with dynamically varying orientations in digital light processing (DLP) 3D printing. Our approach effectively addresses key challenges…