aspireai.
PUBLIC EDITION

BYOD converts autoregressive models to diffusion language models with LoRA adapters alone, running a 9B conversion on one Colab GPU

AspireAI community · arXiv (cs.LG, cs.CL)
Diffusion language models allow parallel token updates and bidirectional attention, but normally require costly pretraining or full fine-tuning. BYOD is a LoRA-only recipe for parameter-efficient conversion of autoregressive models to diffusion generation, applied without architecture-specific tuning to Gemma 2 9B, Llama 3.1 8B, Qwen2.5 7B and Ministral 8B, which the authors call the first reported AR-to-DLM conversion of a Mistral model. The adapters comprise 4.1-5.8 percent of final parameters with every base-model parameter frozen, and each 25,000-iteration conversion needs at most 102.4M tokens processed in 3.1-4.0 hours on one Google Colab GPU. All four models generate from fully masked sequences and retain substantial parent-model knowledge. The honest limitation is in the abstract: BYOD perplexity is 8.3-11.1 versus 4.1 for LLaDA and 2.2-3.0 for the AR parents when generating 128 tokens in 64 steps, so open-generation quality at low compute budgets remains the weak point.
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.