aspireai.
PUBLIC EDITION

DocSkill learned when to use, revisit or skip a skill for multilingual multi-hop document QA, and beat the strongest baseline by 5.5 points on a 60,000-pair benchmark across 10 languages

AspireAI community · arXiv
Multi-hop document question answering means finding evidence spread across pages, layouts and languages and then integrating it, which is hard because an agent has to coordinate evidence acquisition, cross-page integration and answer verification. DocSkill trains that coordination: a learned skill-orchestration policy selects, revisits or skips skills as the evidence state changes. Supervision comes from bounded Monte Carlo Tree Search over alternative skill trajectories, which produces demonstrations for supervised fine-tuning and preference pairs for DPO. The accompanying MMHop-DocBench dataset holds 60,000 QA pairs across 10 languages and eight document domains, built by a HopGen pipeline that constructs hierarchical page-element graphs to derive traceable cross-page evidence paths with page- and element-level annotations. DocSkill with Qwen3-VL-8B reached 41.0 accuracy and 49.2 F1, beating the strongest evaluated baseline by 5.5 and 6.3 points, with competitive results on MMLongBench-Doc and DocBench. The limitation is that the benchmark is built by the same pipeline that trains the method.
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.