mlsanityData to 14 Oct 2026

LAIT: Efficient Multi-Segment Encoding in Transformers with Layer-Adjustable Interaction

arXiv 2305.19585 ↗First posted 31 May 2023cs.CL cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Transformer encoders contextualize token representations by attending to all other tokens at each layer, leading to quadratic increase in compute effort with the input length. In practice, however, the input text of many NLP tasks can be seen as a sequence of related segments (e.g., the sequence of sentences within a passage, or the hypothesis and premise in NLI). While attending across these segments is highly beneficial for many tasks, we hypothesize that this interaction can be delayed until later encoding stages. To this end, we introduce Layer-Adjustable Interactions in Transformers (LAIT). Within LAIT, segmented inputs are first encoded independently, and then jointly. This partial two-tower architecture bridges the gap between a Dual Encoder's ability to pre-compute representations for segments and a fully self-attentive Transformer's capacity to model cross-segment attention. The LAIT framework effectively leverages existing pretrained Transformers and converts them into the hybrid of the two aforementioned architectures, allowing for easy and intuitive control over the performance-efficiency tradeoff. Experimenting on a wide range of NLP tasks, we find LAIT able to reduce 30-50% of the attention FLOPs on many tasks, while preserving high accuracy; in some practical settings, LAIT could reduce actual latency by orders of magnitude.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 48 of its 67 references that are in the map. First posted on arXiv 31 May 2023.

Builds on

48 of 67 references.

References · 48

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  5. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  6. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
  7. 2020Longformer: The Long-Document Transformercited by 3,413
  8. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  9. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  10. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
  11. 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
  12. 2020Big Bird: Transformers for Longer Sequencescited by 1,684
36 more
  1. 2018FEVER: a large-scale dataset for Fact Extraction and VERificationcited by 1,375
  2. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
  3. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,167
  4. 2017SemEval-2017 Task 1: Semantic Textual Similarity - Multilingual and Cross-lingual Focused Evaluationcited by 1,001
  5. 2020Efficient Transformers: A Surveycited by 790
  6. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 476
  7. 2021Sentence-T5: Scalable Sentence Encoders from Pre-trained Text-to-Text Modelscited by 463
  8. 2021Large Dual Encoders Are Generalizable Retrieverscited by 456
  9. 2020Efficient Intent Detection with Dual Sentence Encoderscited by 433
  10. 2017Supervised Learning of Universal Sentence Representations from Natural Language Inference Datacited by 432
  11. 2018WiC: the Word-in-Context Dataset for Evaluating Context-Sensitive Meaning Representationscited by 372
  12. 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 359
  13. 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
  14. 2022Confident Adaptive Language Modelingcited by 310
  15. 2019Q8BERT: Quantized 8Bit BERTcited by 300
  16. 2018Hypothesis Only Baselines in Natural Language Inferencecited by 295
  17. 2020Sparse Sinkhorn Attentioncited by 251
  18. 2021LongT5: Efficient Text-To-Text Transformer for Long Sequencescited by 232
  19. 2021Get Your Vitamin C! Robust Fact Verification with Contrastive Evidencecited by 225
  20. 2016Enhanced LSTM for Natural Language Inferencecited by 200
  21. 2022Scaling Up Models and Data with textttt5x and textttseqiocited by 187
  22. 2021ContractNLI: A Dataset for Document-level Natural Language Inference for Contractscited by 148
  23. 2022Tomayto, Tomahto. Beyond Token-level Answer Equivalence for Question Answering Evaluationcited by 67
  24. 2016Dynamic Coattention Networks For Question Answeringcited by 49
  25. 2018End-to-End Retrieval in Continuous Spacecited by 46
  26. 2020Efficient Document Re-Ranking for Transformers by Precomputing Term Representationscited by 44
  27. 2022Stretching Sentence-pair NLI Models to Reason over Long Documents and Clusterscited by 44
  28. 2020Generating Representative Headlines for News Storiescited by 39
  29. 2020Beyond 512 Tokens: Siamese Multi-depth Transformer-based Hierarchical Encoder for Long-Form Document Matchingcited by 35
  30. 2021Hi-Transformer: Hierarchical Interactive Transformer for Efficient and Effective Long Document Modelingcited by 35
  31. 2020TwinBERT: Distilling Knowledge to Twin-Structured BERT Models for Efficient Retrievalcited by 24
  32. 2022Decoupled Context Processing for Context Augmented Language Modelingcited by 24
  33. 2023Pre-computed memory or on-the-fly encoding? A hybrid approach to retrieval augmentation makes the most of your computecited by 17
  34. 2022Improving Wikipedia Verifiability with AIcited by 11
  35. 2022ED2LM: Encoder-Decoder to Language Model for Faster Document Re-ranking Inferencecited by 9
  36. 2022Embedding Recycling for Language Modelscited by 5

Built on by

Cited by year

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

7 papers.