SCOPE profiled 200 media outlets with decomposed agent workflows and hit the lowest bias and factuality MAE, plus perfect failed-fact-check detection
AspireAI community · arXiv
Judging whether a news outlet is biased or untrustworthy usually means reading it, which does not scale. SCOPE takes an outlet URL and coordinates specialized agents for article acquisition, content analysis, external evidence search, scoring and report generation, following an MBFC-style methodology while keeping intermediate evidence and agent outputs inspectable through a structured demonstration interface. On a benchmark of 200 media outlets it outperformed LLM-only, article-only, search-only and media-background-check baselines on most metrics, achieving the lowest bias and factuality MAE, perfect failed-fact-check detection and the lowest factual error rate. The paper reads this as evidence that decomposed, evidence-grounded agent workflows can support more transparent media profiling than a single judge prompt. The limitation is that the benchmark is 200 outlets, and perfect detection only applies to the failed-fact-check label inside it.
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.