Published event
ArtificialIntelligence HardwareLaunch 1 source(s)

Accelerating vision-language models with LFM2.5-VL-DSpark

Updated September 26, 2026 · 2:44 PM · source date September 24, 2026

Summary

Accelerating vision-language models with LFM2.5-VL-DSpark Accelerating vision-language models with LFM2.5-VL-DSpark Team Article Published September 24, 2026 Upvote 14 xx tugot17 LiquidAI Yuri Khrustalev ykhrustalev LiquidAI Leonie Monigatti iamleonie LiquidAI Viviana Márquez vivianamarquez LiquidAI Today, we release an experimental DSpark draft model for our vision-language model (VLM) LFM2.5-VL-3B . As with our recently released LFM2.5-DSpark drafter models , it adds a speculative decoding path that trades a minimal increase in memory footprint for a larger speedup without changing output quality.

Why it matters

This HardwareLaunch is relevant to the technology intelligence record because it involves Apple, OpenAI, Meta, Hugging Face. The source article should remain the factual reference for follow-up coverage.

Key facts
  • Accelerating vision-language models with LFM2.5-VL-DSpark Team Article Published September 24, 2026 Upvote 14 xx tugot17 LiquidAI Yuri Khrustalev ykhrustalev LiquidAI Leonie Monigatti iamleonie LiquidAI Viviana Márquez vivianamarquez LiquidAI Today, we release an experimental DSpark draft model for our vision-language model (VLM) LFM2.5-VL-3B .
  • As with our recently released LFM2.5-DSpark drafter models , it adds a speculative decoding path that trades a minimal increase in memory footprint for a larger speedup without changing output quality.
  • Faster inference: decode speedups up to 3.13x on device and 2.66x on an H100, with end-to-end gains up to 2.62x and 2.27x.
  • Small memory cost: the drafter adds 280M parameters, 8.9% on top of the 3B target Day-one support: LFM-compatible DSpark integrations for llama.cpp, MLX-VLM, and SGLang How does speculative decoding work for VLMs The vision drafter uses the same architecture as our text LFM2.5-DSpark drafters: it captures the target model's hidden states at a fixed set of tapped layers and conditions on them to draft a block of k candidate tokens.
  • Image patches and text tokens are projected into a shared representation before those layers, so the drafter operates on hidden-state vectors of identical dimensionality regardless of input modality.
  • The inference algorithm is therefore unchanged from the text models.
Entities in this story
Related events