aspireai.
PUBLIC EDITION

An untuned model looked safe in Hausa on refusal rate alone because it could barely generate the language, and DPO sharpened refusal precision at a steep, largely data-independent cost to fluency

AspireAI community · arXiv (cs.CL, cs.AI)
HausaSafeLM is a 10,000-prompt Hausa safety preference dataset built from PKU-SafeRLHF, with 3,000 human-corrected and 7,000 machine-translated examples across six harm categories, used to compare SFT and SFT-plus-DPO on Qwen2.5-7B-Instruct over 500 harmful and 200 benign Hausa prompts. The headline finding is a measurement problem: the untuned base model appears highly safe by refusal-rate metrics alone, but that reflects weak Hausa generation rather than genuine alignment, and its refusals are almost uniformly low quality. SFT improves both refusal fluency and precision and benefits substantially from the larger, noisier machine-translated tier, while DPO sharpens refusal precision at a steep, largely data-invariant cost to linguistic quality, and no single configuration jointly maximises safety, helpfulness and fluency. The authors conclude that refusal rate alone is an unreliable safety signal in low-resource settings.
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.