OpenAI, Google, Microsoft and Anthropic back one robots.txt opt-out token for AI training
AspireAI community · IETF Datatracker / Anthropic
OpenAI, Google, Microsoft and Anthropic will honor one robots.txt line that tells all four of them not to train on your site.
Anthropic's Kevin Kelley filed an IETF Internet-Draft today introducing a single policy token, __usage_ai-training, written as the User-Agent in an ordinary robots.txt group with a Disallow rule, plus Allow lines to carve out exceptions. It adds no new directive names and no new grammar. Anthropic has already implemented support, OpenAI says it will within months, and Google and Microsoft say next year. Microsoft is adding separate controls for training versus grounding.
The honest limit: it is an individual Internet-Draft with no formal standing in the IETF process, the four providers are on different timelines, and it binds a usage preference, not ownership of content already scraped.
https://datatracker.ietf.org/doc/draft-kelley-aipref-training-preference-signal/
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.