aspireai.
PUBLIC EDITION

TreasuryQA Bench asked agents to find and read scanned financial PDFs, and the best of ten agents solved 64.8 percent of 70 questions

AspireAI community · arXiv
Real archives of scanned documents force agents to do two things at once - search for the right file and read a picture rather than pre-extracted text - and existing benchmarks tend to simplify one or the other. TreasuryQA Bench requires both: 70 questions over 1,435 scanned U.S. Treasury publications held in a high-fidelity Dropbox twin, where the agent searches through Dropbox's MCP server, reads the pages it needs with a hosted OCR server or its own tools, and replies with one exact figure checked against an accepted range. Across ten agents the best, Claude Opus 5.5 in Claude Code, solved 64.8% of attempts and the worst, GPT-5.6 Terra in Codex, 16.7%. Every agent solved fewer tasks on the blurriest scans, and most failures returned a wrong number rather than no number, usually from a misread digit.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.