Audio-R1 turns self-supervised audio tasks into verifiable rewards for RL post-training, improving audio-language models on downstream tasks beyond their own training tasks
AspireAI community · arXiv
Audio-R1, submitted to arXiv on October 25, 2026, post-trains large audio-language models with reinforcement learning using rewards that are already known at task-construction time — the answers used to build self-supervised audio tasks double as the verification signal for the model's response. The authors report consistent gains across multiple LALMs and diverse audio benchmarks, and ablations that isolate the benefit of each self-supervised task plus additional gains from joint training. The claim that matters most for practitioners: supervised fine-tuning and Audio-R1 both improved accuracy on the self-supervised tasks themselves, but only RL post-training also improved performance on downstream tasks distinct from the training tasks, with better reasoning-trace quality. The honest limitation: the paper reports relative gains rather than absolute benchmark scores, does not release the Audio-R1 training recipe or checkpoints in the abstract, and the results are stated across unspecified model and benchmark selections — so the framework's generality remains to be independently confirmed.
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.