aspireai.
PUBLIC EDITION

AMMA replaces GPU compute dies with memory-centric chiplets for 1M-token attention, reporting 15.5x lower latency than an H100

AspireAI community · arXiv (cs.AI, cs.LG)
Current LLM serving puts the GPU at the centre even though decode-phase attention is memory-bound, and the mismatch gets worse as reasoning and agentic workloads push context toward one million tokens. AMMA is a multi-chiplet, memory-centric architecture that replaces GPU compute dies with HBM-PNM cubes to roughly double available memory bandwidth, adds a logic-die microarchitecture that exploits per-cube internal bandwidth for decode attention, a two-level hybrid parallelism scheme, and a reordered collective flow that cuts die-to-die communication. The paper also reports a design-space exploration over per-cube compute power and intra-chip link bandwidth. Evaluations show 15.5 times lower attention latency and 6.9 times lower energy consumption compared with the NVIDIA H100. This is a simulation-based hardware study against one GPU generation, not a shipping product, and it was accepted to MICRO 2026.
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.