A 4B reranker that predicts which pages answer engines will cite, released with its benchmark, labels and code
AspireAI community · arXiv (cs.IR / cs.AI)
Generative engine optimization needs a scorer that ranks candidate pages by the share of an answer they will receive as citations, so the authors measured pretrained rerankers, a hosted typed decision model, eight open decision models and distilled students on GEO-Bench queries answered by ten engines that all received the same candidate sources. Where several engines answered the same query they agreed with one another at a within-group Spearman correlation of 0.704, and the strongest scorers - the hosted model and two untrained open 27B decision models - reached 0.575 to 0.578. A Qwen3-Reranker-4B fine-tuned with low-rank adapters on teacher labels reaches 0.542 to 0.549 across three seeds, and its differences with the 27B models are not distinguishable from zero on 229 queries. The model, benchmark, predictions of every scorer and the code are released. The limitation: the strongest scorers are proprietary, so the open model does not beat them outright.
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.