UltraBERT: Beyond the Limit of BERT Pre-Training
cs.CL, cs.AI
Submitted: 2026-10-10
Updated: 2026-10-10
Code: https://github.com/allenai/pes2o
License: http://creativecommons.org/licenses/by/4.0/
The gist: Recent bidirectional encoders have been modernized with innovations from causal large language models (LLMs).
Abstract
Recent bidirectional encoders have been modernized with innovations from causal large language models (LLMs). However, the pretraining recipe itself remains inherited from small-scale conventions, leaving encoders underoptimized, with no single model performing competitively across both classification and retrieval tasks. In this work, we investigate how far encoder performance can be pushed by revisiting core design choices in training, revealing three key findings: (1) Encoders saturate on downstream tasks beyond a few trillion tokens, indicating that additional compute past this point does not help. (2) Across model sizes, lower masking ratios benefit classification while higher ones benefit retrieval, contradicting prior work suggesting larger ratios for larger models. (3) Distillation with pruning improves classification at low masking ratios but degrades retrieval at high ones. Guided by these findings, we present UltraBERT, a single encoder that assigns separate LM heads to low and high masking ratios within a batch and restricts the distillation objective to the low ratio. To our knowledge, UltraBERT is the first encoder to achieve state of the art on both classification and retrieval tasks, reaching 91.0 on GLUE and 47.7 on BEIR. Together, these results show how far encoder performance can be pushed and provide a principled basis for compute allocation, masking ratio design, and knowledge transfer in bidirectional models.
Sources
- LFM2 Technical Report
- Program Synthesis with Large Language Models
- Fine-Tuned 'Small' LLMs (Still) Significantly Outperform Zero-Shot Generative AI Models in Text Classification
- Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge
- Training Verifiers to Solve Math Word Problems
- Efficient pre-training objectives for Transformers
- Gemma 2: Improving Open Language Models at a Practical Size
- Gemma 3 Technical Report
- CodeSearchNet Challenge: Evaluating the State of Semantic Code Search
- JetParticle-JEPA: An Efficient Self-Supervised Representation Learning method for Jet Tagging in High-Energy Physics
- Towards General Text Embeddings with Multi-stage Contrastive Learning
- Ministral 3
- Skywork-Reward: Bag of Tricks for Reward Modeling in LLMs
- RoBERTa: A Robustly Optimized BERT Pretraining Approach
- mmBERT: A Modern Multilingual Encoder with Annealed Language Learning
- MS MARCO: A Human Generated MAchine Reading COmprehension Dataset
- 2 OLMo 2 Furious
- From Topology to Retrieval: Decoding Embedding Spaces with Unified Signatures
- DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter
- GLU Variants Improve Transformer
Related papers
- Exploring Solution Divergence and Its Effect on Large Language Model Problem Solving
- Ishigaki-IDS-Bench: A Benchmark for Generating Information Delivery Specification from BIM Information Requirements
- Subliminal Steering: Stronger Encoding of Hidden Signals
- MedStruct-S: A Benchmark for Key Discovery, Key-Conditioned QA and Semi-Structured Extraction from OCR Clinical Reports
- The End of Transformers? On Challenging Attention and the Rise of Sub-Quadratic Architectures
- Untangling the Mechanisms of Misleading Context in Medical Question Answering