paper-with-me

Papers

AUTOSPARSE: Towards Automated Sparse Training of Deep Neural Networks

2023-04-14 · Abhisek Kundu, Naveen K. Mellempudi, Dharma Teja Vooturi, Bharat Kaul, Pradeep Dubey

Sparse training is emerging as a promising avenue for reducing the computational cost of training neural networks. Several recent studies have proposed pruning methods using learnable thresholds to efficiently explore the non-uniform distribution of sparsity inherent within the models. In this paper, we propose Gradient Annealing (GA), where gradients of masked weights are scaled down in a non-linear manner. GA provides an elegant trade-off between sparsity and accuracy without the need for additional sparsity-inducing regularization. We integrated GA with the latest learnable pruning methods to create an automated sparse training algorithm called AutoSparse, which achieves better accuracy and/or training/inference FLOPS reduction than existing learnable pruning methods for sparse ResNet50 and MobileNetV1 on ImageNet-1K: AutoSparse achieves (2x, 7x) reduction in (training,inference) FLOPS for ResNet50 on ImageNet at 80% sparsity. Finally, AutoSparse outperforms sparse-to-sparse SotA method MEST (uniform sparsity) for 80% sparse ResNet50 with similar accuracy, where MEST uses 12% more training FLOPS and 50% more inference FLOPS.

📄 PDF Abstract BibTeX arXiv:2304.06941

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Pruning 설명 없음
ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
Depthwise Convolution Depthwise Convolution is a type of convolution where we apply a single convolutional filter for each input channel. In the regular 2D…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
GA Genetic Algorithms are search algorithms that mimic Darwinian biological evolution in order to select and propagate better solutions.
Average Pooling 설명 없음

Similar Papers 제목 키워드 기반

Learning effective pruning at initialization from iterative pruning

2024-08-27 · Shengkai Liu, Yaofeng Cheng, Fusheng Zha, Wei Guo 외

Pruning at initialization (PaI) reduces training costs by removing weights before training, which becomes increasingly crucial with the growing network size. However, current PaI methods still have a large accuracy gap w…

3D U-Net: Learning Dense Volumetric Segmentation from Sparse Annotation

2016-06-21 · Özgün Çiçek, Ahmed Abdulkadir, Soeren S. Lienkamp, Thomas Brox 외

This paper introduces a network for volumetric segmentation that learns from sparsely annotated volumetric images. We outline two attractive use cases of this method: (1) In a semi-automated setup, the user annotates som…

3D Instance SegmentationData AugmentationMachine TranslationSegmentation

Fully Automated Segmentation of Fiber Bundles in Anatomic Tracing Data

2025-08-18 · Kyriaki-Margarita Bintsi, Yaël Balbastre, Jingjing Wu, Julia F. Lehman 외 arxiv

Anatomic tracer studies are critical for validating and improving diffusion MRI (dMRI) tractography. However, large-scale analysis of data from such studies is hampered by the labor-intensive process of annotating fiber …

DALSA: Domain Adaptation for Supervised Learning From Sparsely Annotated MR Images

2024-03-12 · Michael Götz, Christian Weber, Franciszek Binczyk, Joanna Polanska 외

We propose a new method that employs transfer learning techniques to effectively correct sampling selection errors introduced by sparse annotations during supervised learning for automated tumor segmentation. The practic…

Domain AdaptationTransfer LearningTumor Segmentation

Sparse Learning for Variable Selection with Structures and Nonlinearities

2019-03-26 · Magda Gregorova

In this thesis we discuss machine learning methods performing automated variable selection for learning sparse predictive models. There are multiple reasons for promoting sparsity in the predictive models. By relying on …

BIG-bench Machine LearningSparse LearningVariable Selection