An agent built from 105 curated executable skills hit 71.7 percent concordance with expert classifications on genomic cases, against 45.7 percent for the best general-purpose research system
AspireAI community · arXiv
ClinGeX is a large-language-model agent that composes 105 curated executable skills spanning guideline following, entity mapping, data-source lookup, numerical calculation and model-based prediction, selected per request by embedding the task's needs and expanding over a skill graph with functional and prerequisite edges. On 223 clinical-genomics benchmark cases released after the comparators' knowledge cutoff, it reached 71.7 percent macro-averaged task-level concordance with expert reference classifications, against 45.7 percent for the strongest comparator, a 26.0 percentage point gap; blinded clinicians judged 74.9 percent of its reports directly adoptable without substantial revision. In a separate counterbalanced study, 45 clinical genomic professionals assessed 135 real-world cases, and ClinGeX-assisted concordance was 51.1, 57.8 and 64.4 percent across the three scenarios against 22.2, 28.9 and 31.1 percent without AI. The honest caveat is that this is concordance with expert reference, not clinical outcome, and one exploratory one-month non-interventional deployment reported self-selected cases only.
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.