Pith. sign in

REVIEW 2 cited by

Structured Bayesian Pruning via Log-Normal Multiplicative Noise

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1705.07283 v2 pith:WCAFJ7Q2 submitted 2017-05-20 stat.ML

classification stat.ML
keywords noisemodelneuralbayesiansparsitystructuredaccelerationarchitectures
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Dropout-based regularization methods can be regarded as injecting random noise with pre-defined magnitude to different parts of the neural network during training. It was recently shown that Bayesian dropout procedure not only improves generalization but also leads to extremely sparse neural architectures by automatically setting the individual noise magnitude per weight. However, this sparsity can hardly be used for acceleration since it is unstructured. In the paper, we propose a new Bayesian model that takes into account the computational structure of neural networks and provides structured sparsity, e.g. removes neurons and/or convolutional channels in CNNs. To do this we inject noise to the neurons outputs while keeping the weights unregularized. We establish the probabilistic model with a proper truncated log-uniform prior over the noise and truncated log-normal variational approximation that ensures that the KL-term in the evidence lower bound is computed in closed-form. The model leads to structured sparsity by removing elements with a low SNR from the computation graph and provides significant acceleration on a number of deep neural architectures. The model is easy to implement as it can be formulated as a separate dropout-like layer.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Compact Bayesian Neural Networks via pruned MCMC sampling

    cs.LG 2025-01 conditional novelty 4.0 of 10

    Post-hoc signal-to-noise and signal-plus-noise pruning with a short resampling run can shrink MCMC-trained Bayesian neural networks by 75% with modest accuracy loss, though uncertainty retention is not measured.

  2. Group Pruning using a Bounded-Lp norm for Group Gating and Regularization

    stat.ML 2019-08 conditional novelty 4.0 of 10

    A bounded-L1 regularizer combined with exponential gating layers prunes neural network channels to exactly zero during training, compressing standard models by 30 to 75 percent with little accuracy loss.

Pith tools