mlsanityData to 14 Oct 2026

The Architectural Bottleneck Principle

arXiv 2211.06420 ↗First posted 11 Nov 2022cs.CL cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

In this paper, we seek to measure how much information a component in a neural network could extract from the representations fed into it. Our work stands in contrast to prior probing work, most of which investigates how much information a model's representations contain. This shift in perspective leads us to propose a new principle for probing, the architectural bottleneck principle: In order to estimate how much information a given component could extract, a probe should look exactly like the component. Relying on this principle, we estimate how much syntactic information is available to transformers through our attentional probe, a probe that exactly resembles a transformer's self-attention head. Experimentally, we find that, in three models (BERT, ALBERT, and RoBERTa), a sentence's syntax tree is mostly extractable by our probe, suggesting these models have access to syntactic information while composing their contextual representations. Whether this information is actually used by these models, however, remains an open question.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 32 of its 55 references that are in the map. First posted on arXiv 11 Nov 2022.

Builds on

32 of 55 references.

References · 32

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  5. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
  6. 2016Understanding intermediate layers using linear classifier probescited by 1,353
  7. 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,059
  8. 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 1,003
  9. 2020A Primer in BERTology: What we know about how BERT workscited by 815
  10. 2019Designing and Interpreting Probes with Control Taskscited by 640
  11. 2018What you can cram into a single vector: Probing sentence embeddings for linguistic propertiescited by 457
  12. 2019Linguistic Knowledge and Transferability of Contextual Representationscited by 383
20 more
  1. 2016Deep Biaffine Attention for Neural Dependency Parsingcited by 334
  2. 2018Analysis Methods in Neural Language Processing: A Surveycited by 277
  3. 2019Analyzing the Structure of Attention in a Transformer Language Modelcited by 243
  4. 2020Information-Theoretic Probing with Minimum Description Lengthcited by 232
  5. 2016Fine-grained Analysis of Sentence Embeddings Using Auxiliary Prediction Taskscited by 216
  6. 2020Information-Theoretic Probing for Linguistic Structurecited by 207
  7. 2017What do Neural Machine Translation Models Learn about Morphology?cited by 166
  8. 2020A Theory of Usable Information Under Computational Constraintscited by 162
  9. 2019Do Attention Heads in BERT Track Syntactic Dependencies?cited by 88
  10. 2021Low-Complexity Probing via Finding Subnetworkscited by 64
  11. 2021Conditional probing: measuring usable information beyond a baselinecited by 62
  12. 2021Counterfactual Interventions Reveal the Causal Effect of Relative Clause Representations on Agreement Predictioncited by 59
  13. 2022Probing for the Usage of Grammatical Numbercited by 59
  14. 2020Pareto Probing: Trading Off Accuracy for Complexitycited by 55
  15. 2020A Tale of a Probe and a Parsercited by 40
  16. 2021A Non-Linear Structural Probecited by 31
  17. 2021A Bayesian Framework for Information-Theoretic Probingcited by 22
  18. 2020A Matter of Framing: The Impact of Linguistic Formalism on Probing Resultscited by 12
  19. 2020Efficient Computation of Expectations under Spanning Tree Distributionscited by 11
  20. 2020Please Mind the Root: Decoding Arborescences for Dependency Parsingcited by 11

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 2; 2025: 1.

5 papers.