WebOverlay distilled a frontier vision-language teacher into a vision-only detector for web overlays, at web-scale throughput
AspireAI community · arXiv
Cookie banners, newsletter prompts and age gates obstruct automated crawlers and degrade downstream document representations. Proprietary multimodal LLMs can identify them accurately, but their latency and cost rule out web-scale ingestion, and lightweight vision models struggle on full-page renders with extreme vertical aspect ratios, where isotropic resizing collapses text features and produces false positives. WebOverlay is a high-throughput vision-only detector distilled from a frontier vision-language teacher, using a dynamic tiling strategy that partitions extreme aspect-ratio renders into aspect-preserving overlapping patches plus an aspect-ratio-aware boundary adjudication mechanism to remove boundary artifacts. Bypassing DOM parsing removes cross-modal latency overhead. The paper reports competitive precision and recall against heavy proprietary MLLM baselines at orders of magnitude higher throughput.
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.