paper-with-me

홈 › Papers

FracTrain: Fractionally Squeezing Bit Savings Both Temporally and Spatially for Efficient DNN Training

2020-12-24 · NeurIPS 2020 12 · Yonggan Fu, Haoran You, Yang Zhao, Yue Wang, Chaojian Li, Kailash Gopalakrishnan, Zhangyang Wang, Yingyan Celine Lin

Recent breakthroughs in deep neural networks (DNNs) have fueled a tremendous demand for intelligent edge devices featuring on-site learning, while the practical realization of such systems remains a challenge due to the limited resources available at the edge and the required massive training costs for state-of-the-art (SOTA) DNNs. As reducing precision is one of the most effective knobs for boosting training time/energy efficiency, there has been a growing interest in low-precision DNN training. In this paper, we explore from an orthogonal direction: how to fractionally squeeze out more training cost savings from the most redundant bit level, progressively along the training trajectory and dynamically per input. Specifically, we propose FracTrain that integrates (i) progressive fractional quantization which gradually increases the precision of activations, weights, and gradients that will not reach the precision of SOTA static quantized DNN training until the final training stage, and (ii) dynamic fractional quantization which assigns precisions to both the activations and gradients of each layer in an input-adaptive manner, for only "fractionally" updating layer parameters. Extensive simulations and ablation studies (six models, four datasets, and three training settings including standard, adaptation, and fine-tuning) validate the effectiveness of FracTrain in reducing computational cost and hardware-quantified energy/latency of DNN training while achieving a comparable or better (-0.12%~+1.87%) accuracy. For example, when training ResNet-74 on CIFAR-10, FracTrain achieves 77.6% and 53.5% computational cost and training latency savings, respectively, compared with the best SOTA baseline, while achieving a comparable (-0.07%) accuracy. Our codes are available at: https://github.com/RICE-EIC/FracTrain.

📄 PDF Abstract BibTeX arXiv:2012.13113

Code (1)

RICE-EIC/FracTrain 공식 구현 pytorch

Tasks

Quantization

Similar Papers 제목 키워드 기반

Weight Squeezing: Reparameterization for Knowledge Transfer and Model Compression

2021-11-16 · ACL ARR November 2021 11 · Anonymous

In this work, we present a novel approach to simultaneous knowledge transfer and model compression called \textbf{Weight Squeezing}. With this method, we perform knowledge transfer from a teacher model \textbf{by learnin…

Model Compressiontext-classificationText ClassificationTransfer Learning

Weight Squeezing: Reparameterization for Knowledge Transfer and Model Compression

2020-10-14 · Artem Chumachenko, Daniil Gavrilov, Nikita Balagansky, Pavel Kalaidin

In this work, we present a novel approach for simultaneous knowledge transfer and model compression called Weight Squeezing. With this method, we perform knowledge transfer from a teacher model by learning the mapping fr…

General ClassificationModel Compressiontext-classificationText Classification+1

Fractionally-Supervised Classification

2013-07-13 · Irene Vrbik, Paul D. McNicholas

Traditionally, there are three species of classification: unsupervised, supervised, and semi-supervised. Supervised and semi-supervised classification differ by whether or not weight is given to unlabelled observations i…

ClassificationClusteringGeneral Classification

Video Decoding Energy Reduction Using Temporal-Domain Filtering

2023-06-12 · Christian Herglotz, Matthias Kränzler, Robert Ludwig, André Kaup

In this paper, we study decoding energy reduction opportunities using temporal-domain filtering and subsampling methods. In particular, we study spatiotemporal filtering using a contrast sensitivity function and temporal…

Sensitivity

Feature Squeezing Mitigates and Detects Carlini/Wagner Adversarial Examples

2017-05-30 · Weilin Xu, David Evans, Yanjun Qi

Feature squeezing is a recently-introduced framework for mitigating and detecting adversarial examples. In previous work, we showed that it is effective against several earlier methods for generating adversarial examples…