mlsanityData to 7 Oct 2026

Can persistent homology whiten Transformer-based black-box models? A case study on BERT compression

arXiv 2312.10702 ↗First posted 17 Dec 2023cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Large Language Models (LLMs) like BERT have gained significant prominence due to their remarkable performance in various natural language processing tasks. However, they come with substantial computational and memory costs. Additionally, they are essentially black-box models, challenging to explain and interpret. In this article, we propose Optimus BERT Compression and Explainability (OBCE), a methodology to bring explainability to BERT models using persistent homology, aiming to measure the importance of each neuron by studying the topological characteristics of their outputs. As a result, we can compress BERT significantly by reducing the number of parameters (58.47% of the original parameters for BERT Base, 52.3% for BERT Large). We evaluated our methodology on the standard GLUE Benchmark, comparing the results with state-of-the-art techniques and achieving outstanding results. Consequently, our methodology can "whiten" BERT models by providing explainability to its neurons and reducing the model's size, making it more suitable for deployment on resource-constrained devices.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 51 references that are in the map. First posted on arXiv 17 Dec 2023.

Builds on

24 of 51 references.

References · 24

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  4. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  5. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  6. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
  7. 2023A Survey on Evaluation of Large Language Modelscited by 1,227
  8. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  9. 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
  10. 2018Neural Network Acceptability Judgmentscited by 952
  11. 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
  12. 2019Are Sixteen Heads Really Better than One?cited by 803
12 more
  1. 2018Explaining Explanations: An Overview of Interpretability of Machine Learningcited by 508
  2. 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 355
  3. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  4. 2017Bilateral Multi-Perspective Matching for Natural Language Sentencescited by 120
  5. 2020Compressing Large-Scale Transformer-Based Models: A Case Study on BERTcited by 95
  6. 2020Compression of Deep Learning Models for Text: A Surveycited by 64
  7. 2020Efficient Transformer-based Large Scale Language Representations using Hardware-friendly Block Structured Pruningcited by 39
  8. 2019Reweighted Proximal Pruning for Large-Scale Language Representationcited by 29
  9. 2021You Only Compress Once: Towards Effective and Elastic BERT Compression via Exploit-Explore Stochastic Nature Gradientcited by 14
  10. 2022An Automatic and Efficient BERT Pruning for Edge AI Systemscited by 13
  11. 2020AUBER: Automated BERT Regularizationcited by 4
  12. 2023TopoBERT: Plug and Play Toponym Recognition Module Harnessing Fine-tuned BERTcited by 2

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.