BINGO: A Novel Pruning Mechanism to Reduce the Size of Neural Networks
Aditya Panangat

TL;DR
BINGO introduces a one-pass, significance-based pruning method during training that reduces neural network size efficiently without sacrificing accuracy, addressing high computational costs of traditional pruning techniques.
Contribution
BINGO presents a novel pruning mechanism that assesses weight significance during training for single-shot pruning, reducing computational and environmental costs.
Findings
Maintains accuracy with significant model size reduction
Less computationally intensive than iterative pruning methods
Enables scalable AI development without increasing model size
Abstract
Over the past decade, the use of machine learning has increased exponentially. Models are far more complex than ever before, growing to gargantuan sizes and housing millions of weights. Unfortunately, the fact that large models have become the state of the art means that it often costs millions of dollars to train and operate them. These expenses not only hurt companies but also bar non-wealthy individuals from contributing to new developments and force consumers to pay greater prices for AI. Current methods used to prune models, such as iterative magnitude pruning, have shown great accuracy but require an iterative training sequence that is incredibly computationally and environmentally taxing. To solve this problem, BINGO is introduced. BINGO, during the training pass, studies specific subsets of a neural network one at a time to gauge how significant of a role each weight plays in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Neural Network Applications · Stochastic Gradient Optimization Techniques · Neural Networks and Applications
MethodsPruning
