中文
相关论文

相关论文: Hyperpruning: Efficient Search through Pruned Vari…

200 篇论文

Recurrent Spiking Neural Networks (RSNNs) have emerged as a computationally efficient and brain-inspired learning model. The design of sparse RSNNs with fewer neurons and synapses helps reduce the computational complexity of RSNNs.…

神经与进化计算 · 计算机科学 2024-03-07 Biswadeep Chakraborty , Beomseok Kang , Harshit Kumar , Saibal Mukhopadhyay

Recurrent neural networks (RNNs) have recently achieved remarkable successes in a number of applications. However, the huge sizes and computational burden of these models make it difficult for their deployment on edge devices. A practically…

机器学习 · 计算机科学 2019-12-10 Liangjian Wen , Xuanyang Zhang , Haoli Bai , Zenglin Xu

Foundation models and their checkpoints have significantly advanced deep learning, boosting performance across various applications. However, fine-tuned models often struggle outside their specific domains and exhibit considerable…

Network pruning has been the driving force for the acceleration of neural networks and the alleviation of model storage/transmission burden. With the advent of AutoML and neural architecture search (NAS), pruning has become topical with…

计算机视觉与模式识别 · 计算机科学 2020-08-04 Yawei Li , Shuhang Gu , Kai Zhang , Luc Van Gool , Radu Timofte

Pruning is a compression method which aims to improve the efficiency of neural networks by reducing their number of parameters while maintaining a good performance, thus enhancing the performance-to-cost ratio in nontrivial ways. Of…

神经与进化计算 · 计算机科学 2023-09-25 Hugo Tessier , Ghouti Boukli Hacene , Vincent Gripon

Neural network pruning is a popular technique used to reduce the inference costs of modern, potentially overparameterized, networks. Starting from a pre-trained network, the process is as follows: remove redundant parameters, retrain, and…

机器学习 · 计算机科学 2021-03-05 Lucas Liebenwein , Cenk Baykal , Brandon Carter , David Gifford , Daniela Rus

Structured pruning is a well-established technique for compressing neural networks, making it suitable for deployment in resource-limited edge devices. This paper presents an efficient Loss-Aware Automatic Selection of Structured Pruning…

计算机视觉与模式识别 · 计算机科学 2025-06-26 Deepak Ghimire , Kilho Lee , Seong-heum Kim

We propose an algorithm capable of identifying and eliminating irrelevant layers of a neural network during the early stages of training. In contrast to weight or filter-level pruning, layer pruning reduces the harder to parallelize…

机器学习 · 计算机科学 2024-06-10 Valentin Frank Ingmar Guenter , Athanasios Sideris

The optimization of over-parameterized deep neural networks represents a large-scale, high-dimensional, and strongly non-convex decision problem that challenges existing optimization frameworks. Current evolutionary and gradient-based…

神经与进化计算 · 计算机科学 2026-04-02 Zak Khan , Azam Asilian Bidgoli

Channel pruning is one of the predominant approaches for accelerating deep neural networks. Most existing pruning methods either train from scratch with a sparsity inducing term such as group lasso, or prune redundant channels in a…

机器学习 · 计算机科学 2020-05-25 Ashish Khetan , Zohar Karnin

Deep neural networks (DNNs) have become a widely deployed model for numerous machine learning applications. However, their fixed architecture, substantial training cost, and significant model redundancy make it difficult to efficiently…

神经与进化计算 · 计算机科学 2019-05-28 Xiaoliang Dai , Hongxu Yin , Niraj K. Jha

In this paper, we propose a novel meta learning approach for automatic channel pruning of very deep neural networks. We first train a PruningNet, a kind of meta network, which is able to generate weight parameters for any pruned structure…

计算机视觉与模式识别 · 计算机科学 2019-08-15 Zechun Liu , Haoyuan Mu , Xiangyu Zhang , Zichao Guo , Xin Yang , Tim Kwang-Ting Cheng , Jian Sun

Neural network pruning with suitable retraining can yield networks with considerably fewer parameters than the original with comparable degrees of accuracy. Typical pruning methods require large, fully trained networks as a starting point…

机器学习 · 计算机科学 2020-10-13 Timothy Foldy-Porto , Yeshwanth Venkatesha , Priyadarshini Panda

Slimmable Neural Networks (S-Net) is a novel network which enabled to select one of the predefined proportions of channels (sub-network) dynamically depending on the current computational resource availability. The accuracy of each…

计算机视觉与模式识别 · 计算机科学 2022-12-08 Hideaki Kuratsu , Atsuyoshi Nakamura

Recurrent neural networks (RNNs) are a class of neural networks used in sequential tasks. However, in general, RNNs have a large number of parameters and involve enormous computational costs by repeating the recurrent structures in many…

One-shot neural architecture search allows joint learning of weights and network architecture, reducing computational cost. We limit our search space to the depth of residual networks and formulate an analytically tractable variational…

We propose a novel algorithm for combined unit and layer pruning of deep neural networks that functions during training and without requiring a pre-trained network to apply. Our algorithm optimally trades-off learning accuracy and pruning…

机器学习 · 计算机科学 2025-07-17 Valentin Frank Ingmar Guenter , Athanasios Sideris

Network compression is crucial to making the deep networks to be more efficient, faster, and generalizable to low-end hardware. Current network compression methods have two open problems: first, there lacks a theoretical framework to…

机器学习 · 计算机科学 2022-06-09 Ziqi Zhou , Li Lian , Yilong Yin , Ze Wang

Network pruning reduces the computation costs of an over-parameterized network without performance damage. Prevailing pruning algorithms pre-define the width and depth of the pruned networks, and then transfer parameters from the unpruned…

计算机视觉与模式识别 · 计算机科学 2019-10-17 Xuanyi Dong , Yi Yang

Network pruning is an effective method to reduce the computational expense of over-parameterized neural networks for deployment on low-resource systems. Recent state-of-the-art techniques for retraining pruned networks such as weight…

机器学习 · 计算机科学 2021-05-10 Duong H. Le , Binh-Son Hua
‹ 上一页 1 2 3 10 下一页 ›