ModHiFi: Identifying High Fidelity predictive components for Model Modification
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Open weight models, which are ubiquitous, rarely provide access to their training data or loss function. This makes modifying such models for tasks such as pruning or unlearning, which are constrained by this unavailability, an active area of research. Existing techniques typically require gradients or ground-truth labels, rendering them infeasible in settings with limited computational resources. In this work, we investigate the fundamental question of identifying components that are critical to the model's predictive performance, without access to either gradients or the loss function, and with only distributional access such as synthetic data. We theoretically demonstrate that the global error is linearly bounded by local reconstruction errors for Lipschitz-continuous networks such as CNNs and well-trained Transformers (which, contrary to existing literature, we find exhibit Lipschitz continuity). This motivates using the locally reconstructive behavior of component subsets to quantify their global importance, via a metric that we term Subset Fidelity. In the uncorrelated features setting, selecting individual components based on their Subset Fidelity scores is optimal, which we utilize to propose ModHiFi, an algorithm for model modification that requires neither training data nor access to a loss function. ModHiFi-P, for structured pruning, achieves an 11% speedup over the current state of the art on ImageNet models and competitive performance on language models. ModHiFi-U, for classwise unlearning, achieves complete unlearning on CIFAR-10 without fine-tuning and demonstrates competitive performance on Swin Transformers.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 74 of its 104 references that are in the map. First posted on arXiv 24 Nov 2025.
Builds on
74 of 104 references.
Closest ancestors · 10
Same direction, newest first
- 2023Deep Unlearning: Fast and Efficient Gradient-free Approach to Class Forgetting1 Dec
- 2023SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation19 Oct
- 2023Machine Unlearning: Solutions and Challenges14 Aug
- 2023From Adaptive Query Release to Machine Unlearning20 Jul
- 2023Model Sparsity Can Simplify Machine Unlearning11 Apr
- 2023Towards Unbounded Machine Unlearning20 Feb
- 2022A Survey of Machine Unlearning6 Sep
- 2021Unrolling SGD: Understanding Factors Influencing Machine Unlearning27 Sep
- 2021Machine Unlearning of Features and Labels26 Aug
- 2021Remember What You Want to Forget: Algorithms for Machine Unlearning4 Mar
Other references · 64
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2016Layer Normalizationcited by 5,669
- 2022Generative Adversarial Networkscited by 5,627
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2022Elucidating the Design Space of Diffusion-Based Generative Modelscited by 3,045
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
38 more
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2019Machine Unlearningcited by 1,061
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 618
- 2020What is the State of Neural Network Pruning?cited by 583
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2023Erasing Concepts from Diffusion Modelscited by 539
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2021Fast Model Editing at Scalecited by 498
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
- 2021Recent Advances in Natural Language Processing via Large Pre-Trained Language Models: A Surveycited by 463
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
- 2019Dreaming to Distill: Data-free Knowledge Transfer via DeepInversioncited by 423
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 322
- 2020Amnesiac Machine Learningcited by 319
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
- 2020A Survey on Neural Network Interpretabilitycited by 291
- 2023A Survey on Model Compression for Large Language Modelscited by 269
- 2020Approximate Data Deletion from Machine Learning Modelscited by 255
- 2021Improving Robustness using Generated Datacited by 234
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2024Large Language Models for Data Annotation and Synthesis: A Surveycited by 205
- 2023DepGraph: Towards Any Structural Pruningcited by 203
- 2019What Do Compressed Deep Neural Networks Forget?cited by 171
- 2020Characterising Bias in Compressed Modelscited by 167
- 2021Group Fisher Pruning for Practical Network Compressioncited by 131
- 2021Federated Unlearning via Class-Discriminative Pruningcited by 115
- 2019Continual Learning via Neural Pruningcited by 101
- 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
- 2020Neural Pruning via Growing Regularizationcited by 97
- 2022Distilling Model Failures as Directions in Latent Spacecited by 82
50 most cited of 64 All 64 (JSON)
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Compressing LLMs with MoP: Mixture of Prunerscited by 0
- 2026Compressing LLMs with MoP: Mixture of Pruners5 Feb 2026
Similar, not cited
Close in wording, no citation either way
- 2026The Ups and Downs of Backprop Weights
- 2026Individual Parameters in Weight-Sparse Transformers Appear Interpretable
- 2024Learning on LoRAs: GL-Equivariant Processing of Low-Rank Weight Spaces for Large Finetuned Models
- 2025TuckA: Hierarchical Compact Tensor Experts for Efficient Fine-Tuning
- 2024Network reconstruction via the minimum description length principle
- 2025BalancEdit: Dynamically Balancing the Generality-Locality Trade-off in Multi-modal Model Editing
- 2023Finding the SWEET Spot: Analysis and Improvement of Adaptive Inference in Low Resource Settings
- 2023A Closer Look at Model Adaptation using Feature Distortion and Simplicity Bias