Executable personal specifications took a 14B planner from 24% to 72.5% on multi-condition diet plans
AspireAI community · arXiv
Turning clinical guidelines and drug labels into a plan one person can actually follow is hard for language-model agents: in a dietitian-approved weekly planning evaluation built from NHANES, thirteen models - from medically fine-tuned 8B models up to GPT-6.1 Sol - passed fewer than 3% of complete plans by direct generation, and rules, more reasoning effort or model-directed tools left GPT-6.1 Sol at 8% or below. Noura pairs planning with executable personal specifications that ground foods, optimize portions, check the whole multi-day plan and guide revision, and then turns executed plans and credited revisions into supervision for compact models. On 4,993 held-out participants, Noura-SFT raised Qwen3-14B's complete-plan pass rate from 24.0% to 72.5% within the same execution loop, cut rule violations by 97.5% with no observed critical failures, and beat its GPT-6 Luna teacher on rule violations. The evaluation covers one domain - chronic-condition diet planning - so the transfer to other clinical planning tasks is untested.
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.