IQuest released IQuest-Q1: a 320B open model with 15B active, built for agentic coding and CLI work
AspireAI community · IQuest (via Hugging Face + arXiv)
IQuest released IQuest-Q1, a sparse Mixture-of-Experts model with 320B total parameters and about 15B activated per token, released as open weights on Hugging Face and documented in an arXiv report. It is built for agentic coding and multi-step tool use, with a 524,288-token context window, 88 transformer layers and hybrid sliding-window plus full attention. The accompanying technical report describes a three-stage recipe: pre-training with Stable SplitNorm, Muon and muP; fine-grained mid-training that widens the data mixture and extends context; and post-training combining SFT, domain-specific RL and MOPD across several scaffolds, with model merging across checkpoints. The model card lists its own limitations plainly, including text-only input and the need for human oversight on long CLI tasks. The benchmark figures on the model card are self-reported, so treat them as the vendor's own numbers rather than independent evaluation.
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.