aspireai.
PUBLIC EDITION

Safin-1.5 argues safety should improve recursively alongside capability, and separates hazardous knowledge into removable experts

AspireAI community · arXiv (cs.AI, cs.CL)
Recursive self-improvement lets a model get better at successive updates, but those updates can introduce new risks and weaken existing safeguards. Safin-1.5 pursues what the authors call Safety RSI, where safety develops as an intrinsic capability through continual risk discovery and repair while general capability and low over-refusal are preserved. Three components carry the design: a safety architecture combining persistent safety states with hazardous-knowledge disentanglement, so targeted hazardous knowledge can be relocated into removable experts and removed with minimal impact on general capability; a discovery-evaluation-repair loop that accepts updates only when they improve safety without hurting general capability; and an inference-time harness combining language understanding with symbolic inference and verification for formal reasoning. The paper reports the model built on this architecture and trained through the recursive loop, but the abstract gives no independent benchmark table, so the safety claims rest on the authors' own evaluation.
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.