aspireai.
PUBLIC EDITION

The same four-sample query cost up to 4.1 times more energy as GPU load rose, and an online controller answered every GSM8K query at high load with 60.0 percent accuracy and no deferrals

AspireAI community · arXiv (ATEST: Adaptive Resource-Aware Test-Time Scaling, Kashaniyan & Jannesari)
Test-time scaling samples multiple answers to improve reasoning, but a fixed sampling budget ignores both query difficulty and how inference energy shifts under GPU contention, which this work measures at up to a 4.1-fold increase for the same four-sample query. ATEST weighs the expected value of extra samples against their current GPU cost, and its default online mode needs no offline calibration: it generates samples incrementally, tracks plurality-answer stability, monitors live GPU conditions and learns step energy cost as it goes. On four reasoning and QA datasets with Phi-3-mini on an A100, ATEST-Online answered every query without exceeding the energy budget at the highest or tied accuracy; on GSM8K at high load it reached 60.0 percent accuracy with no deferrals versus 44.0 percent accuracy and 42.4 percent deferrals for the offline-calibrated variant, using 42 times less GPU time and 48 times less energy. The honest limit: online control trades tail latency and throughput for robustness under varying load.
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.