中文
相关论文

相关论文: Efficient Lottery Ticket Finding: Less Data is Mor…

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

Lottery Ticket Hypothesis (LTH) raises keen attention to identifying sparse trainable subnetworks, or winning tickets, which can be trained in isolation to achieve similar or even better performance compared to the full models. Despite many…

计算机视觉与模式识别 · 计算机科学 2021-10-29 Xiaohan Chen , Yu Cheng , Shuohang Wang , Zhe Gan , Jingjing Liu , Zhangyang Wang

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

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

Recent advances in deepfake technology have created increasingly convincing synthetic media that poses significant challenges to information integrity and social trust. While current detection methods show promise, their underlying…

计算机视觉与模式识别 · 计算机科学 2025-07-22 Lisan Al Amin , Md. Ismail Hossain , Thanh Thi Nguyen , Tasnim Jahan , Mahbubul Islam , Faisal Quader

In deep model compression, the recent finding "Lottery Ticket Hypothesis" (LTH) (Frankle & Carbin, 2018) pointed out that there could exist a winning ticket (i.e., a properly pruned sub-network together with original weight initialization)…

机器学习 · 计算机科学 2021-07-20 Ning Liu , Geng Yuan , Zhengping Che , Xuan Shen , Xiaolong Ma , Qing Jin , Jian Ren , Jian Tang , Sijia Liu , Yanzhi Wang

The \textit{lottery ticket hypothesis} (LTH) states that learning on a properly pruned network (the \textit{winning ticket}) improves test accuracy over the original unpruned network. Although LTH has been justified empirically in a broad…

机器学习 · 计算机科学 2021-12-06 Shuai Zhang , Meng Wang , Sijia Liu , Pin-Yu Chen , Jinjun Xiong

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

The Lottery Ticket Hypothesis asserts the existence of highly sparse, trainable subnetworks ('winning tickets') within dense, randomly initialized neural networks. However, state-of-the-art methods of drawing these tickets, like Lottery…

机器学习 · 计算机科学 2025-12-09 Tanay Arora , Christof Teuscher

Discovering a high-performing sparse network within a massive neural network is advantageous for deploying them on devices with limited storage, such as mobile phones. Additionally, model explainability is essential to fostering trust in…

计算机视觉与模式识别 · 计算机科学 2023-07-27 Shantanu Ghosh , Kayhan Batmanghelich

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 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

Spiking Neural Networks (SNNs) have recently emerged as a new generation of low-power deep neural networks, which is suitable to be implemented on low-power mobile/edge devices. As such devices have limited memory storage, neural pruning on…

人工智能 · 计算机科学 2022-07-22 Youngeun Kim , Yuhang Li , Hyoungseob Park , Yeshwanth Venkatesha , Ruokai Yin , Priyadarshini Panda

Recognition tasks, such as object recognition and keypoint estimation, have seen widespread adoption in recent years. Most state-of-the-art methods for these tasks use deep networks that are computationally expensive and have huge memory…

计算机视觉与模式识别 · 计算机科学 2021-04-20 Sharath Girish , Shishira R. Maiya , Kamal Gupta , Hao Chen , Larry Davis , Abhinav Shrivastava

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 lottery ticket hypothesis (LTH) has attracted attention because it can explain why over-parameterized models often show high generalization ability. It is known that when we use iterative magnitude pruning (IMP), which is an algorithm…

机器学习 · 计算机科学 2022-09-29 Keitaro Sakamoto , Issei Sato

Lottery Ticket Hypothesis (LTH) suggests that a dense neural network contains a sparse sub-network that can match the performance of the original dense network when trained in isolation from scratch. Most works retrain the sparse…

机器学习 · 计算机科学 2021-10-12 Ajay Kumar Jaiswal , Haoyu Ma , Tianlong Chen , Ying Ding , 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

This work introduces a novel approach to pruning deep learning models by using distilled data. Unlike conventional strategies which primarily focus on architectural or algorithmic optimization, our method reconsiders the role of data in…

机器学习 · 计算机科学 2023-08-10 Luke McDermott , Daniel Cummings

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
‹ 上一页 1 2 3 10 下一页 ›