paper-with-me

Papers

Runtime Neural Pruning

2017-12-01 · NeurIPS 2017 12 · Ji Lin, Yongming Rao, Jiwen Lu, Jie zhou

In this paper, we propose a Runtime Neural Pruning (RNP) framework which prunes the deep neural network dynamically at the runtime. Unlike existing neural pruning methods which produce a fixed pruned model for deployment, our method preserves the full ability of the original network and conducts pruning according to the input image and current feature maps adaptively. The pruning is performed in a bottom-up, layer-by-layer manner, which we model as a Markov decision process and use reinforcement learning for training. The agent judges the importance of each convolutional kernel and conducts channel-wise pruning conditioned on different samples, where the network is pruned more when the image is easier for the task. Since the ability of network is fully preserved, the balance point is easily adjustable according to the available resources. Our method can be applied to off-the-shelf network structures and reach a better tradeoff between speed and accuracy, especially with a large pruning rate.

📄 PDF Abstract BibTeX

Code (1)

rusdes/runtime-neural-pruning-reproduction pytorch

Tasks

Reinforcement Learning

Methods 이 논문이 사용한 방법론

Pruning 설명 없음
SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

Storage Efficient and Dynamic Flexible Runtime Channel Pruning via Deep Reinforcement Learning

2020-12-01 · NeurIPS 2020 12 · Jianda Chen, Shangyu Chen, Sinno Jialin Pan

In this paper, we propose a deep reinforcement learning (DRL) based framework to efficiently perform runtime channel pruning on convolutional neural networks (CNNs). Our DRL-based framework aims to learn a pruning strate…

Deep Reinforcement Learningreinforcement-learningReinforcement Learning (RL)

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…

BilevelPruning: Unified Dynamic and Static Channel Pruning for Convolutional Neural Networks

2024-01-01 · CVPR 2024 1 · Shangqian Gao, yanfu Zhang, Feihu Huang, Heng Huang

Most existing dynamic or runtime channel pruning methods have to store all weights to achieve efficient inference which brings extra storage costs. Static pruning methods can reduce storage costs directly but their p…

RAP: Runtime-Adaptive Pruning for LLM Inference

2025-05-22 · Huanrong Liu, Chunlin Tian, Xuyang Wei, Jiaheng Dai 외

Large language models (LLMs) excel at language understanding and generation, but their enormous computational and memory requirements hinder deployment. Compression offers a potential solution to mitigate these constrain…

Reinforcement Learning (RL)

RED++ : Data-Free Pruning of Deep Neural Networks via Input Splitting and Output Merging

2021-09-30 · Edouard Yvinec, Arnaud Dapogny, Matthieu Cord, Kevin Bailly

Pruning Deep Neural Networks (DNNs) is a prominent field of study in the goal of inference runtime acceleration. In this paper, we introduce a novel data-free pruning protocol RED++. Only requiring a trained neural netwo…