BERTops: Studying BERT Representations under a Topological Lens
Not on the map. Why?
Abstract (arXiv)
Proposing scoring functions to effectively understand, analyze and learn various properties of high dimensional hidden representations of large-scale transformer models like BERT can be a challenging task. In this work, we explore a new direction by studying the topological features of BERT hidden representations using persistent homology (PH). We propose a novel scoring function named "persistence scoring function (PSF)" which: (i) accurately captures the homology of the high-dimensional hidden representations and correlates well with the test set accuracy of a wide range of datasets and outperforms existing scoring metrics, (ii) captures interesting post fine-tuning "per-class" level properties from both qualitative and quantitative viewpoints, (iii) is more stable to perturbations as compared to the baseline functions, which makes it a very robust proxy, and (iv) finally, also serves as a predictor of the attack success rates for a wide category of black-box and white-box adversarial attack methods. Our extensive correlation experiments demonstrate the practical utility of PSF on various NLP tasks relevant to BERT.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 33 of its 46 references that are in the map. First posted on arXiv 2 May 2022.
Builds on
33 of 46 references.
References · 33
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2017Graph Attention Networkscited by 8,923
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,512
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
- 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,485
- 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 1,003
- 2017Revisiting Unreasonable Effectiveness of Data in Deep Learning Eracited by 919
- 2020Quantifying Attention Flow in Transformerscited by 775
- 2019Universal Adversarial Triggers for Attacking and Analyzing NLPcited by 722
- 2019Is BERT Really Robust? A Strong Baseline for Natural Language Attack on Text Classification and Entailmentcited by 671
21 more
- 2018Generating Natural Language Adversarial Examplescited by 424
- 2018TextBugger: Generating Adversarial Text Against Real-world Applicationscited by 381
- 2018Characterizing Adversarial Subspaces Using Local Intrinsic Dimensionalitycited by 282
- 2019Visualizing and Measuring the Geometry of BERTcited by 216
- 2019To Tune or Not to Tune? Adapting Pretrained Representations to Diverse Taskscited by 167
- 2020Geometric Dataset Distances via Optimal Transportcited by 158
- 2018Predicting the Generalization Gap in Deep Networks with Margin Distributionscited by 113
- 2017A Tutorial on Kernel Density Estimation and Recent Advancescited by 101
- 2019A Topology Layer for Machine Learningcited by 80
- 2018Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topologycited by 73
- 2019Visualizing and Understanding the Effectiveness of BERTcited by 67
- 2020Computing the Testing Error without a Testing Setcited by 54
- 2020Predicting Performance for Natural Language Processing Taskscited by 49
- 2021Artificial Text Detection via Examining the Topology of Attention Mapscited by 49
- 2019Characterizing the Decision Boundary of Deep Neural Networkscited by 32
- 2020Few-Shot Learning on Graphs via Super-Classes based on Graph Spectral Measurescited by 31
- 2018Semi-Supervised Learning via Compact Latent Space Clusteringcited by 15
- 2019On the Downstream Performance of Compressed Word Embeddingscited by 13
- 2018Word Embedding Perturbation for Sentence Classificationcited by 11
- 2019Adversarial Attacks on Deep Learning Models in Natural Language Processing: A Surveycited by 10
- 2020BERT as a Teacher: Contextual Embeddings for Sequence-Level Rewardcited by 5
Built on by
Citing papers per year: 2023: 3; 2024: 1; 2025: 0; 2026: 1.
5 papers.
- 2023Can BERT eat RuCoLA? Topological Data Analysis to Explaincited by 5
- 2023k* Distribution: Evaluating the Latent Space of Deep Neural Networks using Local Neighborhood Analysiscited by 2
- 2024Topological Data Analysis Applications in Natural Language Processing: A Surveycited by 2
- 2023Addressing caveats of neural persistence with deep graph persistencecited by 1
- 2026Cloud-ScPO: Hidden-State Geometry for Semi-Supervised Preference Optimization in LLM Reasoningcited by 0
- 2026Cloud-ScPO: Hidden-State Geometry for Semi-Supervised Preference Optimization in LLM Reasoning2 Aug 2026
- 2024Topological Data Analysis Applications in Natural Language Processing: A Survey15 Nov 2024
- 2023k* Distribution: Evaluating the Latent Space of Deep Neural Networks using Local Neighborhood Analysis7 Dec 2023
- 2023Addressing caveats of neural persistence with deep graph persistence20 Jul 2023
- 2023Can BERT eat RuCoLA? Topological Data Analysis to Explain4 Apr 2023