Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bifocal Diffusion Language Models: Asymmetric Bidirectional Context for Parallel Generation

Published 26 Jun 2026 in cs.IR, cs.AI, and cs.LG | (2606.27732v1)

Abstract: Discrete diffusion LLMs (dLLMs) recover masked tokens in parallel, offering significant speedups over autoregressive (AR) generation. However, such promising frameworks face a fundamental architectural design dilemma: \ding{182} Adopting bidirectional attention achieves strong generation quality by allowing each position to access the full context, but is inherently incompatible with KV caching, limiting inference throughput in batch-serving scenarios; \ding{183} Conversely, causal attention enables efficient cached inference but loses all right-side context, substantially degrading generation quality. This paper introduces Bifocal dLLMs, a new paradigm that resolves this dilemma through \emph{asymmetric bidirectional context}. Analogous to bifocal lenses, we instantiate the paradigm as \textbf{R2LM} (Right-to-Left Mamba), which combines two complementary mechanisms: $a$) standard causal attention providing precise left-context with full KV cache compatibility, while $b$) a lightweight reverse Mamba SSM sidecar supplying compressed right-side context without breaking cacheability. Comprehensive experiments on continued pretraining of Qwen3-1.7B with 60B tokens demonstrate that R2LM achieves $2.4\times$ to $12.9\times$ higher throughput than bidirectional dLLMs and $1.9\times$ to $2.9\times$ speedup over AR baselines in batch serving through parallel decoding with KV caching, while exceeding the causal baseline on most benchmarks and surpassing the bidirectional dLLM on average.

Summary

  • The paper presents a dual-path architecture using a causal Transformer and a reverse SSM to maintain KV caching while injecting right-context for improved generation.
  • It achieves up to 12.9x throughput improvement and up to 32% memory savings on long sequences compared to bidirectional models.
  • Experimental results demonstrate enhanced performance on key benchmarks, surpassing both causal and bidirectional approaches in quality and efficiency.

Bifocal Diffusion LLMs: Asymmetric Bidirectional Context for Parallel Generation

Introduction and Motivation

Diffusion-based LLMs (dLLMs) have emerged as an alternative to conventional autoregressive (AR) LLMs by enabling parallel recovery of masked tokens for text generation through iterative denoising. However, achieving fast parallel decoding raises an architectural compromise: bidirectional attention provides full context but prohibits efficient key-value (KV) caching for inference, resulting in high compute and memory cost, while causal attention enables KV caching but discards right-side context, leading to reduced generation quality. Existing attempts (block-wise, hybrid, or reordered-attention models) only partially mitigate this dilemma by trading off context completeness, cacheability, and model complexity.

This work presents a new architectural paradigm termed Bifocal Diffusion LLMs (Bifocal dLLMs), which achieves asymmetric bidirectional context—distinct mechanisms process left and right context—offering a resolution to the context-cacheability dichotomy. The core instantiation, named R2LM (Right-to-Left Mamba), utilizes a standard causal Transformer to fully exploit left-side context and maintain KV-cache compatibility, while a lightweight reverse Mamba state space model (SSM) supplies compressed right-side context via a parallel sidecar pathway. This design allows efficient batch-serving inference with parallel generation and validates the notion that right context can be injected without breaking prefix-caching.

Architectural Contributions

Bifocal dLLMs decouple left and right context processing as follows:

  1. Causal Transformer Backbone: The backbone provides left-context information strictly through causal attention, fully compatible with KV caching, ensuring fast and efficient inference.
  2. Reverse Mamba SSM Sidecar (R2L pathway): The right context is supplied through a residual stream using a reverse-direction Mamba (an SSM), which scans the sequence right-to-left, flipped for correct aggregation, and injects compressed right-side context as a residual correction to the backbone hidden states. Gated and normalized connections ensure stable additive integration.
  3. Zero-Initialized Residual Gate: R2LM is initialized to be functionally identical to the causal model, enabling seamless integration into pretrained checkpoints and progressive opening of the right-context path during continued pretraining.
  4. Plug-in Adaptation: The R2LM-PI variant allows freezing a pretrained causal dLLM and training only the R2L pathway, demonstrating transferability and flexibility.

The primary theoretical insight is additive log-posterior decomposition, where total conditional information at each masked position can be separated into left- and right-context contributions; the model operationalizes this by independently computing each and summing them, bounded by design limitations such as non-linearities in Transformer architectures.

Experimental Results

Throughput and Memory Efficiency

R2LM achieves a substantial throughput advantage over bidirectional dLLMs due to its retention of KV cacheability:

  • In batch-serving regimes (e.g., batch size 8, sequence length 4096), R2LM provides a 2.4x to 12.9x throughput improvement over bidirectional dLLMs, while maintaining a consistent computational and memory profile close to pure causal dLLMs.
  • Peak GPU memory usage grows sublinearly with sequence length for R2LM, contrasting with linear memory growth in bidirectional models, yielding up to 32% memory savings at large sequence lengths (16384 tokens).

Generation Quality

On seven multiple-choice benchmarks spanning both multi-token and single-token target tasks (ARC-Challenge, HellaSwag, PIQA, WinoGrande, OpenBookQA, BoolQ, MMLU), R2LM is evaluated on a continued-pretrained Qwen3-1.7B backbone:

  • On long-target tasks, R2LM attains an average accuracy of 47.44%, outperforming both the causal baseline (43.90%) and the bidirectional dLLM (44.78%).
  • On short-target tasks, R2LM closes most of the gap to bidirectional dLLM and surpasses causal.
  • The R2LM-PI plug-in variant, despite training only 185M parameters on 5B tokens (one-tenth the compute budget), matches or surpasses all baselines on ALL (47.76%) and Short (52.15%) averages.
  • Variants without correct directionality (MLP Adapter, L2R Mamba) confirm directionality is essential and mere parameter increase is insufficient; only the reverse pathway recovers the bidirectional information upper bound.

Notably, R2LM and R2LM-PI exceed both the causal and bidirectional dLLM endpoints on key benchmarks on average, indicating the efficacy of asymmetric context supply.

Theoretical and Practical Implications

The Bifocal framework redefines the context-efficiency trade-off in parallel-convergent text generation. By showing that non-attention right-context modules can deliver position-aware, compressed information without impacting KV-caching, the work revises aspirations for batch-inference text generation—demonstrating that full-sequence context does not necessitate full recomputation per generation step.

  • The clean integration via forward hooks and zero-gate initialization facilitates non-destructive, efficient adaptation of any cached Transformer checkpoint into a dLLM with enhanced context aggregation.
  • The approach exposes an open design space: the nature of the right-context module (here, SSM-based) can be flexibly defined without modifying the backbone, suggesting applicability for other sequence models, potentially impacting architectures reliant on masked token prediction or iterative denoising.
  • The setup allows for data- and compute-efficient right-context adaptation, which can be critical for applying large pretrained LMs to new domains or tasks where right-context dependency is high.

Limitations and Future Work

The presented results are obtained in the moderately-sized Qwen3-1.7B regime with 60B tokens; the behavior and scaling properties at larger model/data scales remain to be explored. The overhead of the R2L pathway, while minor, can impose a small penalty in single-request (B=1) settings. Exploring lower-rank, shared, or factored variants for the right-context module could offer further efficiency. Investigating the interplay between backbone adaptation and right-context signal, as well as alternative right-context mechanisms, constitutes a rich avenue for architectural research.

Conclusion

Bifocal dLLMs, instantiated as R2LM, present a principled architectural framework for discrete diffusion-based language generation that reconciles the context-quality advantage of bidirectional models with the inference efficiency of causal models. By using parallel pathways for asymmetric context—causal backbone with KV cache for left, SSM-based sidecar for right—this approach produces state-of-the-art throughput and quality among parallel dLLMs. The effectiveness of plug-in adaptation and empirical dominance over both classical endpoints underscore the broader implication: parallel language generation can closely approach (and sometimes exceed) AR model quality without sacrificing deployment efficiency, challenging previous boundaries between context optimization and inference throughput (2606.27732).

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Explain it Like I'm 14

Overview

This paper is about making AI models that write text both fast and well. Most AI writers build sentences one word at a time, which is slow. A newer kind, called diffusion LLMs, can fill in many missing words at once, which is faster. But there’s a big problem: to write well, the model wants to look at words on both sides of a blank (left and right), and doing that breaks a key speed trick called “caching.” If the model only looks left, it stays fast but writes worse.

The authors introduce “Bifocal” diffusion LLMs. Like bifocal glasses that help you see near and far, their model looks left with the usual method and gets a compact summary from the right using a second, lighter system. This keeps the speed benefit while improving writing quality.

Key Questions

The paper tries to answer three simple questions:

  • Can we give the model useful “right-side” context without breaking the speed-up trick (caching)?
  • How much faster is this new approach compared to older methods during real use (serving many requests)?
  • Do the gains come from the special right-to-left mechanism itself, or just from adding more parts (parameters) to the model?

How It Works (Methods) in Everyday Terms

First, some quick translations:

  • Autoregressive (AR): The model writes one word at a time from left to right. Think of typing each word in order.
  • Diffusion LLM: The model starts with a sentence full of blanks and fills them in over a few steps, fixing several blanks at once—like solving a crossword puzzle in batches.
  • Attention: A way for the model to “look” at other words in the sentence. Bidirectional attention looks left and right; causal attention looks only left.
  • KV cache: Notes the model keeps so it doesn’t have to re-read the whole sentence every step. Caching saves a lot of time.
  • Right-side context: Words that appear to the right of a blank. Seeing them can help choose the right word for the blank.
  • State Space Model (SSM), Mamba: A fast sequence-reading technique that scans text in order and builds a compact summary of what it has seen.

Now, the approach:

  • The “Bifocal” idea: Use two pathways at the same time. 1) The main pathway is standard “causal attention,” which looks left. This keeps caching working, so it’s fast. 2) A small side pathway, called R2LM (“Right-to-Left Mamba”), reads the text from right to left using Mamba (an SSM). It creates a compact summary of the right side and gently adds it to the main pathway as a tiny “residual” signal.
  • Why this helps: The main pathway stays cache-friendly and fast. The side pathway brings in the missing right-side information at low cost, improving quality.
  • Safety and simplicity: The side pathway starts turned off (its contribution is zero). So the model is identical to the original at the beginning and only learns to use the right-side signal if it actually helps.
  • Two training styles:
    • Joint training: Train both the main model and the side pathway together.
    • Plug-in training: Freeze the main model and train just the side pathway. This makes it easy to retrofit the right-side signal onto existing models without changing their core.
  • Testing setup: They continued pretraining a 1.7B-parameter model (Qwen3-1.7B) on 60 billion tokens and tested on several multiple-choice tasks (like ARC, HellaSwag, MMLU). They also measured speed and memory use on a single high-end GPU.

Main Findings and Why They Matter

  • It’s much faster than full bidirectional models: The new model (R2LM) achieved 2.4x to 12.9x higher throughput than bidirectional diffusion models when serving batches of requests, especially with long prompts. This means servers can answer more users at once.
  • It’s also faster than classic one-word-at-a-time models: In batch serving, R2LM got about 1.9x to 2.9x speedups compared to strong autoregressive baselines.
  • It improves accuracy over purely left-looking models: On most benchmarks, R2LM beat the purely causal (left-only) diffusion model. It also beat the fully bidirectional diffusion model on the overall average across tasks.
  • The plug-in version is strong: Training only the side pathway on a frozen backbone with just 5B extra tokens still matched or beat the joint model on averages and even topped bidirectional on some tasks. This shows the right-to-left side pathway transfers well and can be added to existing models without full retraining.
  • Direction really matters: In ablation tests, simply adding more parameters without a right-to-left scan didn’t help, and scanning in the wrong direction (left-to-right) made things worse. The right-to-left summary is the key ingredient.
  • Memory-friendly: R2LM kept a memory usage profile similar to the fast causal model and saved up to 32% memory compared to fully bidirectional variants on very long prompts.

Why this matters: You get high-quality text generation with the speed and efficiency needed for real-world deployment, especially when serving many users at once.

Implications and Impact

  • Better user experience at scale: Websites and apps using AI text generation can serve more people faster without losing quality.
  • Lower cost and energy: Faster, cache-friendly generation means less compute time and lower bills for companies running large models.
  • Easy upgrades: The plug-in pathway can be added to existing models, making it practical to improve current systems without starting from scratch.
  • A new design direction: The “Bifocal” idea—keeping attention causal for speed while adding a compact right-context summary—opens a design space for future models that need both quality and efficiency.

In short, this paper shows a smart way to mix two views of the text—left and right—so AI can write better and faster at the same time.

Knowledge Gaps

Knowledge gaps, limitations, and open questions

Below is a single consolidated list of concrete gaps and open problems left unresolved by the paper; each item is phrased to guide actionable follow-up work.

  • Scaling behavior: Validate R2LM at larger model sizes, longer context windows, and larger training budgets (e.g., ≥7B–70B params, contexts ≥32k, ≥0.5–1T tokens) to test whether quality and throughput gains persist at scale.
  • Task coverage: Assess open-ended generation (e.g., long-form QA, summarization, reasoning chain-of-thought, code, multilingual) beyond multiple-choice scoring to verify that benefits generalize to free-form decoding and diverse domains.
  • Long-context quality: Benchmark accuracy and coherence on truly long-context tasks (e.g., long-book QA, Needle-in-a-Haystack, retrieval-augmented tasks) where right-side context should be most beneficial but was not evaluated.
  • Step budget sensitivity: Explore how performance changes with denoising steps T and generation length G (only T=32, G=128 tested) to understand the trade-off between step count, quality, and latency, and whether R2LM enables fewer steps.
  • Scheduling and masking policies: Compare alternative corruption schedules and unmasking strategies (e.g., different t-schedules, uncertainty-aware selection) to determine if the right-context pathway interacts with masking policy.
  • Architectural design space of “X” (right-context module): Systematically evaluate alternatives to reverse Mamba (e.g., reverse self-attention with caching tricks, reverse linear attention, reverse RNNs, convolutional or Fourier modules, low-rank SSMs) to map accuracy/throughput/memory trade-offs.
  • Placement and frequency of hooks: Ablate hook frequency (k), insertion depth patterns, and layer-wise gating to find optimal locations and densities for the R2L sidecar under fixed compute/parameter budgets.
  • Capacity vs. compression in R2L: Quantify how SSM state size (dstate), convolution width, and expansion affect the fidelity of right-context signals, and identify the minimal capacity that preserves quality gains.
  • Parameter-efficiency: Investigate lighter-weight or shared-parameter R2L designs (e.g., shared projections across hooks, bottlenecked adapters, LoRA-style or low-rank SSMs) to reduce the ~10.8% parameter overhead without losing accuracy.
  • Vector or dynamic gating: Evaluate per-channel or per-position gates and learned gating schedules (rather than scalar per-layer gates) for finer control of the right-context contribution and potential quality/efficiency gains.
  • Training dynamics of gates: Study convergence behavior, gate growth patterns, and potential failure modes (e.g., gate collapse or saturation), and devise regularization or curricula that stabilize learning.
  • Frozen-backbone vs. joint training: Characterize when plug-in training on a frozen backbone is sufficient versus when joint training is necessary (tasks, domains, scales), and quantify data efficiency curves (R2LM-PI uses only 5B tokens).
  • Cross-architecture generalization: Test portability to other backbones (e.g., LLaMA, Mistral, Jamba-like hybrids) and tokenizer variants to confirm the modularity claim beyond Qwen3-1.7B.
  • Robustness and calibration: Measure calibration (e.g., ECE), uncertainty, and robustness to distribution shifts or adversarial noise under the bifocal architecture, especially since the R2L module compresses right-side context.
  • Error analysis and failure cases: Analyze why R2LM underperforms bidirectional attention on specific tasks (e.g., ARC-C) and identify input characteristics (length, position of masks, reasoning type) where the right-context correction is insufficient.
  • Theoretical fidelity of the additive decomposition: Quantify how well the learned residual approximates the intended log-posterior correction in practice (given non-linearities like LayerNorm and softmax) and explore logit-level injection strategies that more closely match the theory.
  • Formal cache-validity guarantees: Provide a rigorous analysis of KV-cache correctness when coupling cached causal attention with a per-step R2L scan over generated tokens, especially under dynamic unmasking and variable-step decoding.
  • Interaction with inference optimizations: Evaluate compatibility with speculative decoding, KV compression, paged attention, prefix-sharing, and quantization (e.g., 4/8-bit) to ensure practical deployment does not erode gains.
  • Latency under batch serving: Report per-step and tail latency (not only throughput) in realistic serving scenarios, including multi-tenant batchers, to understand user-perceived speedups.
  • GPU kernelization of SSM scans: Examine the effectiveness of SSM scan kernels in practice (parallel prefix-scan, fused ops) and whether the sequential scan becomes a bottleneck at long G or high batch sizes.
  • Extremely long prompts: Extend memory and throughput measurements beyond P=16384 and analyze degradations or architectural changes needed for ultra-long contexts.
  • Multi-turn and streaming scenarios: Investigate how R2LM behaves in conversational settings (interleaved prompts/responses) and streaming generation where right-context evolves incrementally.
  • Interaction with block/hybrid paradigms: Explore whether R2LM can be combined with block diffusion or hybrid AR–diffusion methods to further balance quality and cacheability, and identify when hybrids outperform a single bifocal path.
  • Quantitative position-wise gains: Verify the information-theoretic prediction that earlier masked positions benefit more from right context by reporting accuracy improvements as a function of position within the target.
  • Training cost and energy: Report and compare full training compute (FLOPs, wall-clock, energy) across causal, bidirectional, and R2LM to validate that efficiency gains at inference do not introduce prohibitive training overheads.
  • Data/task transfer: Test domain adaptation for the R2L module (e.g., train R2L on domain A, apply to domain B) to assess the modular transferability implied by plug-in success.
  • Safety and hallucination: Evaluate whether asymmetric bidirectional context changes behavior on safety benchmarks and hallucination rates, especially in long-form outputs where right context may affect consistency.
  • Multimodal extension: Assess whether the bifocal idea extends to multimodal diffusion LMs (e.g., VLMs) and how to supply right-context signals across modalities without breaking cacheability.
  • Alternative objectives: Compare MDLM with other discrete diffusion objectives (e.g., discrete flow matching, different absorbing-state variants) to test objective–architecture interactions under bifocal design.
  • Fair baseline comparisons: Revisit the bidirectional baseline with more aggressive engineering (e.g., partial caching, attention recomputation strategies) to ensure R2LM advantages are not due to unoptimized bidir inference.
  • Interpretability of R2L signals: Develop tools to inspect what information the R2L stream encodes (e.g., probing classifiers, attribution over right-context tokens) to guide principled capacity and placement choices.

Practical Applications

Immediate Applications

Below are actionable use cases that can be deployed now or with modest engineering, leveraging the paper’s asymmetric bidirectional context (Bifocal dLLMs) and the R2LM/R2LM-PI instantiations.

  • High-throughput LLM serving for long prompts and batch workloads
    • Sector: Software/Cloud, Enterprise SaaS
    • What: Replace bidirectional dLLMs or AR inference backends with R2LM to reduce cost/latency for multi-user, long-context serving (e.g., customer support, documentation assistants, analytics chat).
    • Why now: Parallel decoding with KV caching yields 2.4x–12.9x higher throughput than bidirectional dLLMs and 1.9x–2.9x vs AR in batch-serving regimes; memory stays close to causal.
    • Tools/workflow: Integrate a reverse Mamba sidecar into an existing causal Transformer; deploy cached parallel denoising with T≈32 steps; adapt vLLM/TensorRT-LLM-style engines to support diffusion decoding with KV reuse.
    • Assumptions/dependencies: Gains are largest at B>1 and long prompts (P up to 4096+); requires implementing the MDLM sampler with unmask scheduling; paper’s results on H100-80GB may vary on other GPUs.
  • Cost and carbon reduction for LLM workloads
    • Sector: Cloud, Sustainability/Policy
    • What: Consolidate GPU fleets for diffusion-based generation and scoring, cutting energy per token for long-prompt, batch-serving scenarios.
    • Why now: Preserves causal KV caching profile while avoiding bidirectional recompute; up to 32% peak memory savings vs bidirectional at long context.
    • Tools/workflow: Update FinOps dashboards to track tok/s-per-watt; shift batch jobs to R2LM backends; adjust autoscaling policies based on higher throughput.
    • Assumptions/dependencies: Realized savings depend on workload mix (prompt length, batch size) and ability to keep GPUs saturated.
  • Retrofits for existing causal dLLMs via plug-in adapters (R2LM-PI)
    • Sector: Industry/Academia
    • What: Add right-context capability to a pretrained causal dLLM without touching backbone weights.
    • Why now: R2LM-PI on a frozen backbone (≈10.8% extra params) trained on 5B tokens recovers 59% of long-target gains and tops average accuracy across benchmarks.
    • Tools/workflow: Insert reverse Mamba hooks after every k-th decoder layer; train only the sidecar and scalar gates; reuse existing data pipelines.
    • Assumptions/dependencies: Requires 5B tokens of domain or general data; training code to support sidecar hooks and gating.
  • Long-answer evaluation and multi-choice scoring at scale
    • Sector: Education, ML Evaluation, Hiring/Assessments
    • What: Faster large-scale scoring of multi-token candidates (exams, long MCQ options, rubric-aligned answers).
    • Why now: R2LM improves accuracy over causal on all long-target tasks tested (+3.54 pp average) while being much faster than bidirectional.
    • Tools/workflow: Swap MC-evaluation harness backends to R2LM; prefill prompts once, denoise/scoring in parallel.
    • Assumptions/dependencies: Benefits strongest when candidate answers span multiple tokens; for single-token tasks, bidirectional may remain slightly ahead.
  • High-volume content operations with long prompts
    • Sector: Marketing/Ads, E-commerce, Media
    • What: Bulk generation of product descriptions, campaign variants, and article expansions from long style guides/briefs.
    • Why now: KV-cached diffusion decoding scales far better with long prompts than bidirectional diffusion, lowering per-item cost at scale.
    • Tools/workflow: Batch jobs that pack prompts to keep B high; QA loops that exploit parallel unmasking.
    • Assumptions/dependencies: Quality and tone control depend on domain data; parallel diffusion sampling pipeline required.
  • Retrieval-augmented generation (RAG) over large contexts
    • Sector: Enterprise Search, Legal/Finance Ops
    • What: Faster responses in RAG workflows with many retrieved passages (long P) and many concurrent users (high B).
    • Why now: Throughput remains high as P grows; preserves memory profile similar to causal while injecting right-context cues.
    • Tools/workflow: Use R2LM for answer generation and long-context re-ranking; cache prompt KV once, iterate T denoising steps only over generated tokens.
    • Assumptions/dependencies: RAG grounding data quality affects outcomes; ensure sampler respects document boundaries/unmask policy.
  • Document triage and summarization at scale
    • Sector: Healthcare (clinical notes), Public Sector, Financial Services
    • What: Batch summarization/triage of long documents with many parallel jobs (e.g., nightly processing windows).
    • Why now: R2LM’s speedups at high B and long P reduce window times and GPU hours.
    • Tools/workflow: Schedule nightly batches to saturate GPUs; integrate R2LM checkpoints into existing summarization pipelines.
    • Assumptions/dependencies: Clinical/legal safety review still required; domain fine-tuning via R2LM-PI improves reliability.
  • Backend upgrades for ranking and reranking
    • Sector: Search/Recommendation
    • What: Upgrade generative re-rankers that score long candidates or rationales.
    • Why now: Better long-target performance than causal and much higher throughput than bidirectional enables larger candidate sets or deeper reasoning under the same budget.
    • Tools/workflow: Port Gen-Rerankers to R2LM; adjust candidate pool sizes upward; maintain KV cache across candidates sharing a prompt.
    • Assumptions/dependencies: Gains depend on candidate length and shared prompt reuse.
  • Teaching/research baseline for discrete diffusion LLMs
    • Sector: Academia
    • What: Use R2LM as a teaching exemplar and a strong, cacheable baseline for future dLLM studies.
    • Why now: First design to provide continuous right-side context without breaking KV cache; easy to ablate (sidecar on/off).
    • Tools/workflow: Release course labs that toggle sidecar gates; reproduce ablations (MLP adapter vs L2R vs R2L Mamba).
    • Assumptions/dependencies: Availability of reference implementation and pretrained checkpoints.

Long-Term Applications

These require additional research, scaling, productization, or ecosystem support.

  • On-device and edge assistants with right-context compression
    • Sector: Mobile/Edge, Consumer Devices
    • What: Bring asymmetric bidirectional context to compact models via quantized sidecars that summarize future context cheaply.
    • Why later: Needs smaller, memory-efficient R2L modules and on-device diffusion decoding primitives.
    • Dependencies: Quantization-aware training for the sidecar; efficient T-step schedulers; hardware SSM kernels.
  • Bifocal multimodal models (text+vision/audio)
    • Sector: Media, Accessibility, Enterprise AI
    • What: Use an R2L SSM to inject “future” frames or utterances while keeping primary attention causal for KV caching.
    • Why later: Requires extending MDLM objectives and sidecar design to multimodal token streams.
    • Dependencies: Multimodal tokenization, synchronized flip/scan across modalities, evaluation benchmarks.
  • Code generation and repair with global consistency
    • Sector: Software Engineering
    • What: Improve long-horizon code synthesis and patching by injecting right-context (e.g., tests, constraints) without breaking cacheability.
    • Why later: Needs code-specialized training and evaluations; diffusion decoding UX for developers still evolving.
    • Dependencies: Domain-pretrained code checkpoints, R2LM-PI adaptation on code corpora, tool integration (LSPs, IDEs).
  • Real-time collaborative writing with parallel region fills
    • Sector: Productivity, Enterprise SaaS
    • What: Fill multiple disjoint regions of a document in parallel, using bifocal context to coordinate across sections.
    • Why later: Product design and conflict resolution (multi-author edits) needed; streaming-friendly diffusion decoding.
    • Dependencies: Editor APIs, region-level unmask scheduling, latency hiding with speculative decoding.
  • Dynamic mode-switching engines (AR ↔ Diffusion ↔ Bifocal)
    • Sector: Serving Infrastructure
    • What: Adaptive runtime that selects AR for single-user streaming, R2LM for batch/long prompts, hybrids for mixed loads.
    • Why later: Requires robust policy learning or heuristics and unified kernels.
    • Dependencies: Joint benchmarking and cost models, orchestrators that inspect traffic patterns in real time.
  • Hardware-software co-design for cache-preserving right-context
    • Sector: Semiconductors, HPC
    • What: Kernels and accelerators optimized for reverse SSM scans plus causal attention with persistent KV.
    • Why later: Vendor kernel support for SSM (reverse) and diffusion schedules is nascent.
    • Dependencies: Compiler/runtime support (CUDA/ROCm), memory hierarchy optimizations for sidecar state.
  • Domain-governed adapters for regulated sectors
    • Sector: Healthcare, Finance, Public Sector
    • What: R2LM-PI adapters trained on vetted corpora, offering auditability and controlled right-context usage.
    • Why later: Governance, red-teaming, and certification pipelines needed.
    • Dependencies: Curated data, privacy-preserving training (federated/DP), policy toolkits.
  • Knowledge distillation from bifocal diffusion to lighter AR models
    • Sector: Model Compression, Edge AI
    • What: Use R2LM as a teacher to transfer long-target reasoning to small AR students.
    • Why later: Requires effective teacher–student alignment for diffusion-to-AR.
    • Dependencies: Sequence-level distillation objectives that capture right-context gains.
  • Bifocal sequence modeling beyond language
    • Sector: Time Series, Bioinformatics
    • What: Apply asymmetric context to forecasting/imputation where future context is available at scoring time (e.g., EHR panel scoring, batch analytics).
    • Why later: Adaptation of MDLM to continuous/categorical mixed tokens and task-specific evaluation.
    • Dependencies: Tokenization schemes, domain validation, right-context gating per task.
  • Policy and procurement standards for “efficiency-grade” LLMs
    • Sector: Policy, Enterprise Procurement
    • What: Introduce standards that consider KV-cache compatibility and right-context access in cost/performance ratings for LLM purchases.
    • Why later: Needs consensus metrics and third-party audits.
    • Dependencies: Community benchmarks that report tok/s vs prompt length and accuracy on long-target tasks.

Cross-cutting assumptions and risks

  • Quality generalization: Reported gains (e.g., +3.11 pp ALL average) are on specific benchmarks at 1.7B/60B tokens; effects may change at larger scales or different domains.
  • Workload sensitivity: Speedups grow with prompt length and batch size; interactive single-user streaming (B=1) may see smaller or negative latency gains vs pure causal due to sidecar overhead.
  • Engineering requirements: Requires implementing reverse Mamba sidecar, flip/unflip scans, per-layer gated residuals, and a diffusion sampler with KV-cached prefill.
  • Data and licensing: R2LM-PI needs 5B+ tokens for good transfer; ensure licensing and privacy compliance for domain corpora.
  • Hardware variability: Results are on H100; performance on other accelerators depends on SSM kernel maturity and memory bandwidth.

Glossary

  • absorbing-state variant: A discrete diffusion setup where corrupted tokens are replaced by a dedicated mask token that absorbs probability mass. "The absorbing-state variant, in which each corrupted position takes a dedicated [MASK] token, was simplified by Masked Diffusion LLMs (MDLM) ..."
  • additive log-posterior decomposition: A decomposition expressing the log-posterior as a sum of a left-context term and a right-context correction. "Proposition 1 (Additive log-posterior decomposition)."
  • autoregressive (AR): A generation paradigm that predicts tokens sequentially from left to right, conditioning on previously generated tokens. "offering significant speedups over autoregressive (AR) generation."
  • bidirectional attention: An attention pattern where each position attends to both left and right context across the entire sequence. "Adopting bidirectional attention achieves strong generation quality by allowing each position to access the full context"
  • Bifocal dLLMs: The proposed paradigm that keeps causal attention while adding a separate right-context pathway to retain cacheability. "We propose Bifocal dLLMs, a new dLLM paradigm that supplies right-side context through a non-attention pathway in parallel with causal attention"
  • block diffusion: A design that applies bidirectional attention within fixed-size blocks while keeping causal dependencies across blocks. "Block diffusion models (Arriola et al., 2025; Cheng et al., 2025; Wu et al., 2025) apply bidirectional attention within fixed blocks and causal dependencies across blocks"
  • causal attention: A left-to-right attention mask that enables efficient KV caching but removes access to right-side context. "Conversely, causal attention enables efficient cached inference but loses all right-side context"
  • conditional mutual information: An information-theoretic quantity measuring the remaining information about a target from the right-side context given the left context. "equals the conditional mutual information of the target with the right-side observed context."
  • continued pretraining (CPT): Further pretraining of a model on additional data after initial training to adapt or improve capabilities. "Table 2. Multiple-choice accuracy on seven benchmarks at 60B-token CPT from Qwen3-1.7B."
  • denoising steps: Iterative inference updates that progressively reconstruct masked tokens in diffusion models. "At inference, generation starts fully masked and runs T denoising steps"
  • discrete diffusion LLMs (dLLMs): LLMs that generate text by iteratively denoising masked sequences rather than strictly autoregressing. "Discrete diffusion LLMs (dLLMs) recover masked tokens in parallel, offering significant speedups over autoregressive (AR) generation."
  • ELBO-weighted cross-entropy: A training objective for MDLMs that weights cross-entropy by an ELBO-derived factor over masked positions. "A denoising network pe(xi | Zt) is trained by minimising the ELBO-weighted cross-entropy over masked positions (Sahoo et al., 2024):"
  • forward corruption process: The stochastic process that masks tokens over time to define the diffusion forward model. "defines a generative model over discrete sequences via a forward corruption process and a learned reverse denoising process."
  • forward hooks: Attachment points in a model’s forward pass used to inject auxiliary modules without altering the base architecture. "attached to a pretrained autoregressive backbone via forward hooks at every k-th decoder layer"
  • gated residual: A residual connection modulated by a learnable gate to control the contribution of an auxiliary pathway. "4 gated residual: h+ = h + hR2L . tanh(s), where s E R is one learnable scalar gate per hooked layer, initialised at zero."
  • inductive bias: A modeling assumption that guides learning without being a strict equality or constraint. "we treat equation (4) as an inductive bias rather than a strict equality."
  • LayerNorm: A normalization layer applied to stabilize and scale activations, here used to bound the residual magnitude. "The LayerNorm is necessary to bound the magnitude of the residual before it is added back to the backbone stream."
  • Mamba (selective state space model, SSM): A linear-time selective SSM architecture for sequence modeling with input-dependent transitions. "Mamba (Gu and Dao, 2024) introduced a selective state space model (SSM) with input-dependent transition matrices, achieving linear-time sequence modeling with quality competitive with Transformers."
  • Masked Diffusion LLMs (MDLM): A discrete diffusion formulation that trains with an absorbing-mask objective over masked tokens. "We adopt the absorbing-state MDLM objective throughout."
  • plug-in mode (R2LM-PI): A training mode that learns only the right-context pathway on a frozen causal backbone, enabling adapter-like integration. "In the plug-in mode (R2LM-PI), the backbone is frozen at a separately trained causal dLLM checkpoint"
  • prefill: The inference phase that processes the prompt once to populate caches used across denoising steps. "1 prefill forwards the prompt of length P through the causal backbone and the R2L hooks once, caching prompt keys, values, and post-hook hidden states"
  • prefix KV caching: Reusing cached key-value tensors from the prompt so subsequent steps avoid recomputation. "preserving standard causal prefix KV caching."
  • reverse-direction Mamba sidecar: An auxiliary right-to-left Mamba SSM module that injects compressed right-context signals alongside a causal backbone. "a reverse Mamba SSM sidecar supplying compressed right-side context without breaking cacheability."
  • selective scan: The Mamba operation that sequentially scans inputs with selective state updates. "2 selective scan: hmamba = Mamba(hflip),"
  • state space model (SSM): A sequence model that evolves hidden states over positions via a state-transition structure. "as a sequential state space model, Mamba processes tokens in order"
  • topological reordering: Reordering positions during training or inference to maintain cacheability under causal masking. "restore cacheability via topological reordering or masking schedules"

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 37 likes about this paper.