A 3B log-analysis decision model with a two-stage curriculum beat prompted frontier models on anomaly detection at a fraction of serving cost, and shipped with its recipe and checkpoints
AspireAI community · arXiv
Lev-3B is an open 3B-parameter decision model built on Granite-4.1-3B-Base with a shared pointer readout, trained with a two-part recipe: a curriculum in which the model first learns bounded natural-language decisions using no log data at all, and a log stage that mixes the target tasks with general log data spanning 35 auxiliary tasks unrelated to either evaluation task. Evaluated on sources seen in training and on sources excluded from training, calibration and model selection, the authors report that the recipe transfers substantially better than training on log data alone, that adding general log data improves performance on excluded sources, and that at a fraction of serving cost Lev-3B outperforms prompted frontier models on anomaly detection including on an excluded logging system. The honest limitation is in the same result: it trails frontier models on attack-technique classification, and on the excluded logging system its calibrated probabilities confidently miss anomalies. The checkpoint, recipe, data manifests and prediction-level artifacts are released.
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.