On the Robustness and Anomaly Detection of Sparse Neural Networks
Not on the map. Why?
Abstract (arXiv)
The robustness and anomaly detection capability of neural networks are crucial topics for their safe adoption in the real-world. Moreover, the over-parameterization of recent networks comes with high computational costs and raises questions about its influence on robustness and anomaly detection. In this work, we show that sparsity can make networks more robust and better anomaly detectors. To motivate this even further, we show that a pre-trained neural network contains, within its parameter space, sparse subnetworks that are better at these tasks without any further training. We also show that structured sparsity greatly helps in reducing the complexity of expensive robustness and detection methods, while maintaining or even improving their results on these tasks. Finally, we introduce a new method, SensNorm, which uses the sensitivity of weights derived from an appropriate pruning method to detect anomalous samples in the input.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 35 of its 41 references that are in the map. First posted on arXiv 9 Jul 2022.
Builds on
35 of 41 references.
References · 35
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,362
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,539
- 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,274
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
- 2018Deep Anomaly Detection with Outlier Exposurecited by 939
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
23 more
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2018Do Deep Generative Models Know What They Don't Know?cited by 443
- 2020CSI: Novelty Detection via Contrastive Learning on Distributionally Shifted Instancescited by 441
- 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 413
- 2020Simple and Principled Uncertainty Estimation with Deterministic Deep Learning via Distance Awarenesscited by 389
- 2021On the Importance of Gradients for Detecting Distributional Shifts in the Wildcited by 338
- 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
- 2020Why Normalizing Flows Fail to Detect Out-of-Distribution Datacited by 220
- 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
- 2019Gate Decorator: Global Filter Pruning Method for Accelerating Deep Convolutional Neural Networkscited by 118
- 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
- 2021Can Subnetwork Structure be the Key to Out-of-Distribution Generalization?cited by 75
- 2018Sparse DNNs with Improved Adversarial Robustnesscited by 71
- 2020Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpotcited by 66
- 2020Understanding Anomaly Detection with Deep Invertible Networks through Hierarchies of Distributions and Featurescited by 64
- 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
- 2021A Winning Hand: Compressing Deep Networks Can Improve Out-Of-Distribution Robustnesscited by 62
- 2020Learning Invariances in Neural Networkscited by 52
- 2020Pruning via Iterative Ranking of Sensitivity Statisticscited by 25
- 2020Winning Lottery Tickets in Deep Generative Modelscited by 25
- 2021Removing Undesirable Feature Contributions Using Out-of-Distribution Datacited by 23
- 2022Winning the Lottery Ahead of Time: Efficient Early Network Pruningcited by 21
Built on by
Citing papers per year: 2024: 1.
1 paper.