mlsanityData to 14 Oct 2026

Downsized and Compromised?: Assessing the Faithfulness of Model Compression

arXiv 2510.06125 ↗First posted 7 Oct 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

In real-world applications, computational constraints often require transforming large models into smaller, more efficient versions through model compression. While these techniques aim to reduce size and computational cost without sacrificing performance, their evaluations have traditionally focused on the trade-off between size and accuracy, overlooking the aspect of model faithfulness. This limited view is insufficient for high-stakes domains like healthcare, finance, and criminal justice, where compressed models must remain faithful to the behavior of their original counterparts. This paper presents a novel approach to evaluating faithfulness in compressed models, moving beyond standard metrics. We introduce and demonstrate a set of faithfulness metrics that capture how model behavior changes post-compression. Our contributions include introducing techniques to assess predictive consistency between the original and compressed models using model agreement, and applying chi-squared tests to detect statistically significant changes in predictive patterns across both the overall dataset and demographic subgroups, thereby exposing shifts that aggregate fairness metrics may obscure. We demonstrate our approaches by applying quantization and pruning to artificial neural networks (ANNs) trained on three diverse and socially meaningful datasets. Our findings show that high accuracy does not guarantee faithfulness, and our statistical tests detect subtle yet significant shifts that are missed by standard metrics, such as Accuracy and Equalized Odds. The proposed metrics provide a practical and more direct method for ensuring that efficiency gains through compression do not compromise the fairness or faithfulness essential for trustworthy AI.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 37 of its 63 references that are in the map. First posted on arXiv 7 Oct 2025.

Builds on

37 of 63 references.

References · 37

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  2. 2017On Calibration of Modern Neural Networkscited by 4,960
  3. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
  4. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  5. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  6. 2016Equality of Opportunity in Supervised Learningcited by 2,007
  7. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,917
  8. 2020Reformer: The Efficient Transformercited by 1,668
  9. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,167
  10. 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 856
  11. 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 359
  12. 2017Fairness in Criminal Justice Risk Assessments: The State of the Artcited by 315
25 more
  1. 2017A Survey of Model Compression and Acceleration for Deep Neural Networkscited by 301
  2. 2018Model compression via distillation and quantizationcited by 289
  3. 2019What Do Compressed Deep Neural Networks Forget?cited by 171
  4. 2015Conditional Computation in Neural Networks for faster modelscited by 167
  5. 2017Adaptive Neural Networks for Efficient Inferencecited by 163
  6. 2020When BERT Plays the Lottery, All Tickets Are Winningcited by 114
  7. 2019Machine Learning at the Network Edge: A Surveycited by 84
  8. 2020Compression of Deep Learning Models for Text: A Surveycited by 64
  9. 2017Distill-and-Compare: Auditing Black-Box Models Using Transparent Model Distillationcited by 62
  10. 2016Deep Model Compression: Distilling Knowledge from Noisy Teacherscited by 36
  11. 2017Compressing Word Embeddings via Deep Compositional Code Learningcited by 35
  12. 2017Learning Compact Recurrent Neural Networks with Block-Term Tensor Decompositioncited by 33
  13. 2019Reweighted Proximal Pruning for Large-Scale Language Representationcited by 29
  14. 2019Lightweight and Efficient Neural Natural Language Processing with Quaternion Networkscited by 26
  15. 2017Balanced Quantization: An Effective and Efficient Approach to Quantized Neural Networkscited by 21
  16. 2018Grow and Prune Compact, Fast, and Accurate LSTMscited by 20
  17. 2022Can Model Compression Improve NLP Fairnesscited by 20
  18. 2023Understanding the Effect of Model Compression on Social Bias in Large Language Modelscited by 19
  19. 2020Going Beyond Classification Accuracy Metrics in Model Compressioncited by 15
  20. 2016Effective Quantization Methods for Recurrent Neural Networkscited by 14
  21. 2022The Effect of Model Compression on Fairness in Facial Expression Recognitioncited by 13
  22. 2016DropNeuron: Simplifying the Structure of Deep Neural Networkscited by 11
  23. 2023Bias in Pruned Vision Models: In-Depth Analysis and Countermeasurescited by 11
  24. 2023Measuring Bias in AI Models: An Statistical Approach Introducing N-Sigmacited by 11
  25. 2015Auto-Sizing Neural Networks: With Applications to n-gram Language Modelscited by 9

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Towards Understanding and Improving Refusal in Compressed Models via Mechanistic Interpretability
  2. 2024Accuracy is Not All You Need
  3. 2024Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression
  4. 2026Big2Small: A Unifying Neural Network Framework for Model Compression
  5. 2024Beyond Perplexity: Multi-dimensional Safety Evaluation of LLM Compression
  6. 2026Requential Coding: Pushing the Limits of Model Compression with Self-Generated Training Data
  7. 2023The Cost of Compression: Investigating the Impact of Compression on Parametric Knowledge in Language Models
  8. 2025Unified Scaling Laws for Compressed Representations