← Research

Paper review · October 13, 2026

Host-Aware Web Crawling for LLM Pretraining Data

Data engineeringLanguage models Intermediate cs.CL

Using the finding that about half of web document quality varies at the host level, the authors show that sampling only a few pages per host and then crawling good hosts deeply increases the yield of high-quality pages several times over.

Problem

Much of LLM pretraining data comes from web crawling, but most collected pages are discarded by quality filters. Little research has examined how a crawler should allocate a limited budget across hosts, and how deeply, to collect more high-quality data.

Method

The authors extracted 3.01 million documents (532,628 hosts) from 224 WARC files (about 0.25%) of Common Crawl CC-MAIN-2024-10. They scored these with 10 quality and topic classifiers, including DCLM, FineWeb-Edu, Nemotron-CC and GneissWeb. They combined these scores with web-graph centrality (harmonic centrality, PageRank) and Common Crawl's per-host crawl coverage. The analyses are ICC1 variance decomposition, simulations of crawl yield by host ordering, simulations of crawl-depth policies, and correlation analysis between actual crawl budget and quality density.

Results

Limitations

"Quality" is a proxy metric: the pretraining usefulness predicted by a classifier. The authors did not pretrain actual models on the crawl results to compare performance. The classified sample is about 0.25% of all WARC files. The estimate of uncrawled high-quality pages assumes that uncrawled pages have the same quality density as crawled pages from the same host.

Why it matters

Quality control for pretraining data can be moved earlier, from filtering after the crawl to the crawl stage itself. Only a few pages per host need to be classified, so the compute cost is low. The approach can be applied directly to running large-scale web data collection pipelines.

Key terms

ICC1 (intraclass correlation coefficient)
The share of total score variance that comes from differences between groups (here, hosts). The closer it is to 1, the more uniform page quality is within the same host.
Harmonic Centrality
A centrality metric that measures how closely a node is connected to other nodes in the web graph. Common Crawl uses it to set crawl priorities.
Quality classifier
A model that reads a document's text and predicts a score for how useful it is for pretraining. fastText-based classifiers are common.
Sample-then-deepen
A policy that first collects only a few pages from each host to estimate quality, then spends more of the crawl budget on hosts with high scores.

Original

Authors: Malte Ostendorff · Posted 2026-10-09 · License CC BY 4.0 · Based on the full text

This review is an AI-written summary of the paper. Please treat the original paper as the reference.