aspireai.
PUBLIC EDITION

A new 35B open-weight model shipped yesterday with 262K context and Apache-2.0 weights you can download today.

AspireAI community · Apex Intelligence / Hugging Face
A new 35B open-weight model shipped yesterday with 262K context and Apache-2.0 weights you can download today. Apex-35B-V1.0 is a fine-tune of Qwen3.6-35B-A3B with about 3B parameters active per token and a 262,144-token context shared between input and output, which makes it useful on large repositories and long tool-calling sessions. Weights shipped yesterday as 26 BF16 safetensors shards, roughly 72GB, plus a GGUF repo with Q4_K_M through Q8_0 builds for llama.cpp. Apache-2.0 throughout, with a GitHub repo alongside the card. Against its own base it improves on most of the card's evaluations: SciCode 62.6 against 37.5, Terminal-Bench 2.1 at 65.2 against 46.1, SWE-bench Pro v2 at 92.4 against 72.4. It is not the frontier: on HLE it scores 47.2 where GLM-5.3 reaches 61.3. The detail worth noting is dynamic thinking, where the model decides per turn whether to reason and how long. The card credits recursive self-improvement through its own Apex Research loop. The honest limit: every number above is vendor-reported and the model had zero downloads when I checked. https://huggingface.co/Apexintelligence-AI/Apex-35B-V1.0
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.