中文
相关论文

相关论文: Rare Gems: Finding Lottery Tickets at Initializati…

200 篇论文

Neural network pruning techniques can reduce the parameter counts of trained networks by over 90%, decreasing storage requirements and improving computational performance of inference without compromising accuracy. However, contemporary…

机器学习 · 计算机科学 2019-03-05 Jonathan Frankle , Michael Carbin

Pruning is a well-established technique for removing unnecessary structure from neural networks after training to improve the performance of inference. Several recent results have explored the possibility of pruning at initialization time…

机器学习 · 计算机科学 2020-09-29 Jonathan Frankle , Gintare Karolina Dziugaite , Daniel M. Roy , Michael Carbin

The lottery ticket hypothesis states that sparse subnetworks exist in randomly initialized dense networks that can be trained to the same accuracy as the dense network they reside in. However, the subsequent work has failed to replicate…

机器学习 · 计算机科学 2021-06-15 Jaron Maene , Mingxiao Li , Marie-Francine Moens

The search for efficient, sparse deep neural network models is most prominently performed by pruning: training a dense, overparameterized network and removing parameters, usually via following a manually-crafted heuristic. Additionally, the…

机器学习 · 计算机科学 2021-01-12 Pedro Savarese , Hugo Silva , Michael Maire

Pruning is a standard technique for reducing the computational cost of deep networks. Many advances in pruning leverage concepts from the Lottery Ticket Hypothesis (LTH). LTH reveals that inside a trained dense network exists sparse…

机器学习 · 计算机科学 2024-03-20 Artur Jordao , George Correa de Araujo , Helena de Almeida Maia , Helio Pedrini

The recently proposed Lottery Ticket Hypothesis of Frankle and Carbin (2019) suggests that the performance of over-parameterized deep networks is due to the random initialization seeding the network with a small fraction of favorable…

机器学习 · 计算机科学 2019-12-18 Rahul Mehta

Lottery ticket hypothesis for deep neural networks emphasizes the importance of initialization used to re-train the sparser networks obtained using the iterative magnitude pruning process. An explanation for why the specific initialization…

机器学习 · 计算机科学 2024-06-26 Tausifa Jan Saleem , Ramanjit Ahuja , Surendra Prasad , Brejesh Lall

The existence of "lottery tickets" arXiv:1803.03635 at or near initialization raises the tantalizing question of whether large models are necessary in deep learning, or whether sparse networks can be quickly identified and trained without…

机器学习 · 统计学 2024-07-26 Tanishq Kumar , Kevin Luo , Mark Sellke

A striking observation about iterative magnitude pruning (IMP; Frankle et al. 2020) is that $\unicode{x2014}$ after just a few hundred steps of dense training $\unicode{x2014}$ the method can find a sparse sub-network that can be trained to…

机器学习 · 计算机科学 2022-06-06 Mansheej Paul , Brett W. Larsen , Surya Ganguli , Jonathan Frankle , Gintare Karolina Dziugaite

Recent works have shown that Dataset Distillation, the process for summarizing the training data, can be leveraged to accelerate the training of deep learning models. However, its impact on training dynamics, particularly in neural network…

机器学习 · 计算机科学 2025-04-15 Luke McDermott , Rahul Parhi

Network pruning is widely used for reducing the heavy inference cost of deep models in low-resource settings. A typical pruning algorithm is a three-stage pipeline, i.e., training (a large model), pruning and fine-tuning. During pruning,…

机器学习 · 计算机科学 2019-03-06 Zhuang Liu , Mingjie Sun , Tinghui Zhou , Gao Huang , Trevor Darrell

The observation of sparse trainable sub-networks within over-parametrized networks - also known as Lottery Tickets (LTs) - has prompted inquiries around their trainability, scaling, uniqueness, and generalization properties. Across 28…

机器学习 · 计算机科学 2020-07-09 Michela Paganini , Jessica Zosa Forde

Recently, Frankle & Carbin (2019) demonstrated that randomly-initialized dense networks contain subnetworks that once found can be trained to reach test accuracy comparable to the trained dense network. However, finding these high…

机器学习 · 计算机科学 2021-03-18 James Diffenderfer , Bhavya Kailkhura

The lottery ticket hypothesis has sparked the rapid development of pruning algorithms that aim to reduce the computational costs associated with deep learning during training and model deployment. Currently, such algorithms are primarily…

机器学习 · 计算机科学 2022-06-08 Jonas Fischer , Rebekka Burkholz

The strong lottery ticket hypothesis holds the promise that pruning randomly initialized deep neural networks could offer a computationally efficient alternative to deep learning with stochastic gradient descent. Common parameter…

机器学习 · 计算机科学 2022-06-08 Jonas Fischer , Advait Gadhikar , Rebekka Burkholz

The lottery ticket hypothesis (LTH) has shown that dense models contain highly sparse subnetworks (i.e., winning tickets) that can be trained in isolation to match full accuracy. Despite many exciting efforts being made, there is one…

机器学习 · 计算机科学 2022-06-13 Tianlong Chen , Xuxi Chen , Xiaolong Ma , Yanzhi Wang , Zhangyang Wang

The lottery ticket hypothesis suggests that sparse, sub-networks of a given neural network, if initialized properly, can be trained to reach comparable or even better performance to that of the original network. Prior works in lottery…

机器学习 · 计算机科学 2021-02-01 Neha Mukund Kalibhat , Yogesh Balaji , Soheil Feizi

Yes. In this paper, we investigate strong lottery tickets in generative models, the subnetworks that achieve good generative performance without any weight update. Neural network pruning is considered the main cornerstone of model…

计算机视觉与模式识别 · 计算机科学 2022-12-19 Sangyeop Yeo , Yoojin Jang , Jy-yong Sohn , Dongyoon Han , Jaejun Yoo

Pruning the weights of randomly initialized neural networks plays an important role in the context of lottery ticket hypothesis. Ramanujan et al. (2020) empirically showed that only pruning the weights can achieve remarkable performance…

机器学习 · 计算机科学 2022-04-06 Daiki Chijiwa , Shin'ya Yamaguchi , Yasutoshi Ida , Kenji Umakoshi , Tomohiro Inoue

Network pruning is an effective approach to reduce network complexity with acceptable performance compromise. Existing studies achieve the sparsity of neural networks via time-consuming weight training or complex searching on networks with…

计算机视觉与模式识别 · 计算机科学 2023-09-06 Yuxin Zhang , Mingbao Lin , Yunshan Zhong , Fei Chao , Rongrong Ji
‹ 上一页 1 2 3 10 下一页 ›