aspireai.
PUBLIC EDITION

Discrete diffusion models now have a deterministic ODE sampler: exponential residual flows reproduce the original marginals and report better code and text generation results

AspireAI community · arXiv (exponential residual flows)
Continuous diffusion models can be sampled by a deterministic probability-flow ODE, which is the basis for accelerated sampling and consistency distillation, but no direct analogue was known for discrete diffusion. This paper introduces exponential residual flows, which augment each discrete token position with a continuous residual variable that evolves deterministically and flips the discrete state whenever the residual reaches zero. The authors prove the construction preserves the marginals of the original diffusion model, derive a practical discretisation, and specialise it to masked and uniform diffusion, with empirical improvements over previous approaches across code and text generation benchmarks. The limitation is that the headline evidence is the authors' own empirical comparison rather than an independent replication, and the results are reported as relative gains without a single standard benchmark headline number in the abstract.
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.