"Understanding Robustness Lottery": A Geometric Visual Comparative Analysis of Neural Network Pruning Approaches
Not on the map. Why?
Abstract (arXiv)
Deep learning approaches have provided state-of-the-art performance in many applications by relying on large and overparameterized neural networks. However, such networks have been shown to be very brittle and are difficult to deploy on resource-limited platforms. Model pruning, i.e., reducing the size of the network, is a widely adopted strategy that can lead to a more robust and compact model. Many heuristics exist for model pruning, but empirical studies show that some heuristics improve performance whereas others can make models more brittle or have other side effects. This work aims to shed light on how different pruning methods alter the network's internal feature representation and the corresponding impact on model performance. To facilitate a comprehensive comparison and characterization of the high-dimensional model feature space, we introduce a visual geometric analysis of feature representations. We decomposed and evaluated a set of critical geometric concepts from the common adopted classification loss, and used them to design a visualization system to compare and highlight the impact of pruning on model performance and feature representation. The proposed tool provides an environment for in-depth comparison of pruning methods and a comprehensive understanding of how model response to common data corruption. By leveraging the proposed visualization, machine learning researchers can reveal the similarities between pruning methods and redundant in robustness evaluation benchmarks, obtain geometric insights about the differences between pruned models that achieve superior robustness performance, and identify samples that are robust or fragile to model pruning and common data corruption to model pruning and data corruption but also obtain insights and explanations on how some pruned models achieve superior robustness performance.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 42 of its 66 references that are in the map. First posted on arXiv 16 Jun 2022.
Builds on
42 of 66 references.
References · 42
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,733
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2017Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)cited by 1,319
- 2018Sanity Checks for Saliency Mapscited by 1,156
- 2020Beyond Accuracy: Behavioral Testing of NLP models with CheckListcited by 1,006
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
30 more
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
- 2018Rethinking the Value of Network Pruningcited by 599
- 2020What is the State of Neural Network Pruning?cited by 583
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2019Benchmarking Robustness in Object Detection: Autonomous Driving when Winter is Comingcited by 336
- 2016Large-Margin Softmax Loss for Convolutional Neural Networkscited by 296
- 2019What's Hidden in a Randomly Weighted Neural Network?cited by 237
- 2019What Do Compressed Deep Neural Networks Forget?cited by 171
- 2021On Interaction Between Augmentations and Corruptions in Natural Corruption Robustnesscited by 97
- 2022Benchmarking Robustness of 3D Point Cloud Recognition Against Common Corruptionscited by 80
- 2019Summit: Scaling Deep Learning Interpretability by Visualizing Activation and Attribution Summarizationscited by 72
- 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
- 2020A Survey of Visual Analytics Techniques for Machine Learningcited by 56
- 2021Multi-Prize Lottery Ticket Hypothesis: Finding Accurate Binary Neural Networks by Pruning A Randomly Weighted Networkcited by 55
- 2018Manifold: A Model-Agnostic Framework for Interpretation and Diagnosis of Machine Learning Modelscited by 50
- 2018Decoupled Networkscited by 45
- 2019Embedding Comparator: Visualizing Differences in Global Structure and Local Neighborhoods via Small Multiplescited by 38
- 2020Analyzing the Noise Robustness of Deep Neural Networkscited by 31
- 2019Angular Visual Hardnesscited by 29
- 2021Revisiting Dimensionality Reduction Techniques for Visual Cluster Analysis: An Empirical Studycited by 27
- 2021Certified Adversarial Defenses Meet Out-of-Distribution Corruptions: Benchmarking Robustness and Simple Baselinescited by 17
- 2022Emblaze: Illuminating Machine Learning Representations through Interactive Comparison of Embedding Spacescited by 16
- 2019ConfusionFlow: A model-agnostic visualization for temporal analysis of classifier confusioncited by 15
- 2020StackGenVis: Alignment of Data, Algorithms, and Models for Stacking Ensemble Learning Using Performance Metricscited by 13
- 2020CNNPruner: Pruning Convolutional Neural Networks with Visual Analyticscited by 11
- 2022Learning-From-Disagreement: A Model Comparison and Visual Analytics Frameworkcited by 10
- 2019Ablate, Variate, and Contemplate: Visual Analytics for Discovering Neural Architecturescited by 7
- 2020A Visual Analytics System for Multi-model Comparison on Clinical Data Predictionscited by 7
- 2021Finding Everything within Random Binary Networkscited by 4
Built on by
Citing papers per year: 2022: 1.
1 paper.