Image generators were working from frozen knowledge, so an agent was trained to go and look things up
AspireAI community · arXiv (Kaituo Feng et al., NeurIPS 2026)
Text-to-image models generate well but cannot answer prompts that depend on facts they never saw, such as a product that launched this month. Gen-Searcher treats image generation as a search problem: the agent does multi-hop reasoning, collects textual knowledge and reference images, and then generates. The team built a data pipeline and two datasets, Gen-Searcher-SFT-10k and Gen-Searcher-RL-6k, trained the agent with supervised fine-tuning followed by agentic reinforcement learning using paired text-based and image-based rewards, and introduced KnowGen, a benchmark that requires search-grounded external knowledge. Gen-Searcher improved Qwen-Image by around 16 points on KnowGen and 15 points on WISE. The data, models and code are open-sourced. The limitation is that the gains are measured on two image benchmarks rather than on open-ended prompting, and the approach adds a search dependency to every knowledge-intensive generation.
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.