aspireai.
PUBLIC EDITION

KARMA changed an industrial ad agent's knowledge without touching its weights, and lifted hold-out scores from 30.19 to 39.15 across half a million real logs

AspireAI community · arXiv (KARMA)
Industrial advertising agents have to keep adapting to changed product offerings, traffic patterns and operating policies, and retraining is the expensive answer. KARMA, which stands for Knowledge-Atomic, Regression-Gated Modular Adaptation, evolves six typed knowledge modules while freezing both the model weights and the executable harness code. A deterministic Trace Verifier maps observed errors to candidate modules, a Critic compares successful against failed trajectories to guide a tool-constrained Evolver, and the Evolver applies atomic knowledge edits that a fixed validation gate keeps only when measured gain reaches a threshold, otherwise restoring the previous knowledge state. Across 18 domain-model settings drawn from a corpus of roughly half a million real operation logs in six e-commerce domains, KARMA raised the average hold-out score from 30.19 to 39.15, a gain of 8.96 points or 29.7 percent, with either trajectory class removed cutting the gain by more than half. Evolved knowledge also transferred across domains without further adaptation.
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.