paper-with-me

홈 › Papers

Calibrating the Rigged Lottery: Making All Tickets Reliable

2023-02-18 · Bowen Lei, Ruqi Zhang, Dongkuan Xu, Bani Mallick

Although sparse training has been successfully used in various resource-limited deep learning tasks to save memory, accelerate training, and reduce inference time, the reliability of the produced sparse models remains unexplored. Previous research has shown that deep neural networks tend to be over-confident, and we find that sparse training exacerbates this problem. Therefore, calibrating the sparse models is crucial for reliable prediction and decision-making. In this paper, we propose a new sparse training method to produce sparse models with improved confidence calibration. In contrast to previous research that uses only one mask to control the sparse topology, our method utilizes two masks, including a deterministic mask and a random mask. The former efficiently searches and activates important weights by exploiting the magnitude of weights and gradients. While the latter brings better exploration and finds more appropriate weight values by random updates. Theoretically, we prove our method can be viewed as a hierarchical variational approximation of a probabilistic deep Gaussian process. Extensive experiments on multiple datasets, model architectures, and sparsities show that our method reduces ECE values by up to 47.8\% and simultaneously maintains or even improves accuracy with only a slight increase in computation and storage burden.

📄 PDF Abstract BibTeX arXiv:2302.09369

Code (1)

stevenboys/cigl 공식 구현 pytorch

Tasks

AllDecision Making

Similar Papers 제목 키워드 기반

Winning Lottery Tickets in Deep Generative Models

2020-10-05 · Neha Mukund Kalibhat, Yogesh Balaji, Soheil Feizi

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

KS-Lottery: Finding Certified Lottery Tickets for Multilingual Language Models

2024-02-05 · Fei Yuan, Chang Ma, Shuai Yuan, Qiushi Sun 외

The lottery ticket hypothesis posits the existence of ``winning tickets'' within a randomly initialized neural network. Do winning tickets exist for LLMs in fine-tuning scenarios? How can we find such winning tickets? In…

Translation

Rare Gems: Finding Lottery Tickets at Initialization

2022-02-24 · Kartik Sreenivasan, Jy-yong Sohn, Liu Yang, Matthew Grinde 외

Large neural networks can be pruned to a small fraction of their original size, with little loss in accuracy, by following a time-consuming "train, prune, re-train" approach. Frankle & Carbin conjecture that we can avoid…

COLT: Cyclic Overlapping Lottery Tickets for Faster Pruning of Convolutional Neural Networks

2022-12-24 · Md. Ismail Hossain, Mohammed Rakib, M. M. Lutfe Elahi, Nabeel Mohammed 외

Pruning refers to the elimination of trivial weights from neural networks. The sub-networks within an overparameterized model produced after pruning are often called Lottery tickets. This research aims to generate winnin…

When Layers Play the Lottery, all Tickets Win at Initialization

2023-01-25 · Artur Jordao, George Correa de Araujo, Helena de Almeida Maia, Helio Pedrini

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

All