Uno: A Lossless Diffusion Adapter That Speeds Up LLM Generation 2.2x

The Institute of Foundation Models (IFM) released Uno on September 17, 2026 — a method for speeding up autoregressive LLM generation by adding a small, cheap-to-train diffusion adapter to a model's existing weights, without the quality tradeoff that usually comes with faster decoding. IFM's headline claim is that Uno delivers "autoregressive quality at diffusion speed": up to 2.2x higher throughput at batch size 1, and 1.7x at the largest supported batch size, on its own K2-Horizon-7B model, with a sampling method IFM describes as provably lossless. Here's what Uno actually changes about how a model generates text, how it differs from speculative decoding, and what "provably lossless" does and doesn't establish on its own.

TL;DR

What Uno actually does differently

Standard autoregressive LLM decoding generates one token at a time: predict the next token, append it, repeat — a hard sequential bottleneck that limits how fast generation can go regardless of available compute, because each step depends on the previous one finishing. Diffusion language models sidestep that sequential constraint by generating multiple tokens in parallel, but historically at some cost to quality relative to a well-trained autoregressive model of comparable size — IFM's own framing is that today's LLMs "still write like typewriters" precisely because the field hasn't found a way to get diffusion's parallelism without autoregressive's quality.

Uno's approach: keep the causal LLM architecture and its existing autoregressive weights intact for quality, and add a small diffusion adapter alongside them, under 4% of the base model's size according to IFM, specifically trained to enable multiple-token generation in parallel. The autoregressive weights still do the heavy lifting on quality; the adapter is what unlocks the parallel-generation speed. IFM describes the adapter as "small and cheap to train" relative to the base model — a materially lower cost than training a full diffusion model from scratch or training a separate draft model for speculative decoding.

The Ψ-Spec sampler and the "lossless" claim

The core technical claim rests on what IFM calls the Ψ-Spec sampler, which it describes as performing "provably lossless multi-token prediction from the AR distribution" — meaning the tokens Uno produces are mathematically the same as what the original autoregressive model would have generated one token at a time, not a faster-but-different approximation. This is a specific, falsifiable claim rather than a vague quality assurance, and it's the detail that differentiates Uno's pitch from ordinary diffusion-model speedups, which typically do trade some output quality for parallelism.

IFM's specific comparison to speculative decoding is worth reading carefully: unlike that technique, which typically requires training and serving a separate, smaller "draft" model whose guesses get verified by the larger target model, Uno needs no separately trained draft model at inference time — the diffusion adapter attached to the target model itself does that job. That removes a real piece of serving infrastructure (an extra model to host, version, and keep in sync with the target model) that speculative decoding setups typically carry.

As with any single-vendor benchmark claim, the "provably lossless" language deserves the same treatment explainx.ai applies to any self-reported performance claim: the paper is on arXiv and open for scrutiny, and the model weights are public on Hugging Face, which meaningfully lowers the bar for independent verification compared to a claim with no artifacts attached — but no third-party reproduction of the "lossless" property specifically had been published at time of writing.

The numbers

On IFM's own K2-Horizon-7B-Uno model, IFM reports:

• ~5,200 tokens/second at the largest supported batch size — a 1.7x throughput improvement over the diffusion methods IFM compares against
• ~400 tokens/second at batch size 1 — a 2.2x throughput improvement at that single-request setting

Batch size 1 is the more relevant number for latency-sensitive, single-user applications (a chat interface, an interactive coding agent); the larger-batch number matters more for high-throughput serving scenarios processing many requests in parallel. IFM states Uno is already supported in SGLang, a widely used open-source LLM inference and serving framework — meaning teams running SGLang in production have a documented path to trying this rather than needing custom integration work.

Honest limitations

• These are IFM's own reported benchmark numbers, from its own paper and release announcement, not an independently reproduced result from a third party.
• The "provably lossless" claim is specific and checkable given the public paper and weights, but no independent verification of that exact property had been published at time of writing.
• Real-world speedup depends on the comparison baseline — "1.7-2.2x faster than other diffusion methods" is a different claim than "1.7-2.2x faster than standard autoregressive decoding with no adapter at all," and the exact baseline comparison matters for how the numbers apply to your own deployment.
• This is a young release (September 17, 2026) with one model (K2-Horizon-7B) demonstrated — how well the adapter approach generalizes across model families and sizes isn't yet established.

Why "no separate draft model" is the practically interesting part

It's worth spelling out why removing the draft-model requirement matters operationally, beyond just being a simpler pitch. Speculative decoding's draft model has to be kept in sync with the target model across every fine-tune, every safety update, and every deployment change — a second artifact to version, evaluate, and redeploy in lockstep with the model it's accelerating, which is real ongoing engineering overhead for any team running it in production. It also has to actually be good at predicting what the target model will say; a poorly matched draft model produces low acceptance rates and can end up slower than plain decoding once verification overhead is accounted for, which is part of why speculative decoding setups need their own tuning and monitoring.

Uno's adapter-on-the-target-model approach sidesteps that specific failure mode by construction — there's no second model whose predictions can drift out of alignment with the first, because the adapter is trained directly against the base model it accelerates, and (per IFM's claim) mathematically reproduces that exact model's output distribution rather than approximating it. Whether that tradeoff nets out better in practice than a well-tuned speculative decoding setup likely depends on how much retraining flexibility a team has — an adapter requires access to train against the base model's weights, which is a different operational posture than speculative decoding's ability to bolt on an external draft model without touching the target model at all.

Why this matters beyond one model release

Inference cost, not training cost, is increasingly the line item that determines whether an AI product's unit economics work at scale — a model that's marginally more expensive to train but meaningfully cheaper to serve on every single request compounds into large savings the moment usage grows past a modest scale. That's the underlying reason inference-optimization techniques like Uno, DeepSeek's KV-cache reductions, and quantization approaches like PrismML's Bonsai compression have become as closely watched as raw capability benchmarks this year — a 2.2x throughput improvement, if it holds up under independent testing and generalizes past one 7B model, is roughly equivalent in economic terms to a 2.2x reduction in the serving hardware a given amount of traffic requires, which is a materially larger deal for most production deployments than a few extra points on a reasoning benchmark.

What this means for builders

If you're running LLM inference at scale and currently use speculative decoding, Uno's pitch of comparable or better speedup without maintaining a separate draft model is worth testing directly, especially given SGLang support already exists — that's a materially lower integration cost than most new inference-optimization techniques carry at launch. The broader trend worth watching: this is another entry in a growing category of techniques — alongside DeepSeek's KV-cache and HBM reduction work and NVIDIA's BioNeMo inference runtime in a different domain — where the actual inference bottleneck, not just raw parameter count, is where a lot of near-term real-world speed gains are coming from, and where the cheapest wins increasingly come from rethinking decoding itself rather than simply training a bigger model.

Related on explainx.ai

• DeepSeek V4.1 Flash: KV-cache and HBM reduction
• NVIDIA Nemotron Labs' two-tower diffusion LLM
• FastGen PDD: NVIDIA's parallel decoding distillation
• Claude sped up 30 biology models 4x with FlashPairformer
• How to read AI benchmark claims critically
• What is AI model quantization? A complete guide
• Paper: arXiv:2609.04010
• Model: Hugging Face — IFM/K2-Horizon-7B-Uno

This post is sourced to the Institute of Foundation Models' September 17, 2026 paper and release announcement. Throughput figures and the "lossless" sampling claim are IFM's own reported results; no independent third-party reproduction was available at time of writing.