AI Coding Live News

Subquadratic launches SubQ Snap: a 384K-context decision model for agent routing, tool picks and checks at $0.05/M input

On Oct 12 Subquadratic released SubQ Snap (public preview, subq-snap-preview), a decision model that scores a fixed answer set instead of generating text. Built on Subquadratic Sparse Attention, it reads up to 384K tokens of text and images, returns a decision on 100K tokens in about a second, and—per vendor numbers—scores 61.7 on Decision Index 0.2.1 vs Jev's 57.9. Input costs $0.05/M tokens; output is free.

Subquadratic launches SubQ Snap: a 384K-context decision model for agent routing, tool picks and checks at $0.05/M input

Key Takeaways

  • 384K multimodal context (text + images), 12x Jev per vendor
  • Decision Index 0.2.1: 61.7 vs Jev 57.9 (vendor-reported)
  • 16 enterprise tasks: 67.6 vs 61.6 avg, leads 13/16; trails on When2Call by 7.6
  • Decision LCR (72K–115K multi-doc): 74.0 one-shot vs Jev 48.0 chunked
  • $0.05 per M input tokens, output free; ~1s for 100K tokens
Read full story
Linked Models & Agents:
⚡ SubQ Snap⚡ SubQ⚡ Jev🌐 Subquadratic🌐 TypeSafe

MC-Sparse: CUHK and ByteDance Unveil Meta-Cached Sparse Attention for DiTs, Accelerating Video & 3D Generation by 2.32x with Zero Quality Loss

Diffusion Transformers (DiTs) underpin frontier video generation systems and high-fidelity 3D modeling, yet self-attention computation over extreme sequence lengths introduces prohibitive inference latencies and memory bottlenecks. While sparse attention represents a promising acceleration pathway, existing methods suffer substantial visual quality degradation and texture corruption under high sparsity regimes. Researchers from The Chinese University of Hong Kong (CUHK) and ByteDance analyze sparse attention failures in DiTs (arXiv:2610.06801), tracing quality drops to three root causes: rigid token grouping constraints, inaccurate interaction selection, and uncompensated attention residuals from discarded tokens. The authors introduce Meta-Cached Sparse Attention (MC-Sparse, project site: dodododddo.github.io/mcsparse-project-page/), a training-free framework that preserves individual Key-Value (KV) selection precision while organizing similar Queries into tile-aligned blocks for hardware efficiency on GPUs. MC-Sparse caches query clusters, exact KV indices, and dense-sparse attention output residuals, reusing this metadata across downstream denoising timesteps. On Minimax-H3-Base video models, MC-Sparse delivers a 1.80x denoising speedup, and a 2.32x acceleration on 3D generative backbones, maintaining near-identical fidelity to dense attention with zero visible quality degradation.

Key Takeaways

  • CUHK and ByteDance introduce MC-Sparse, leveraging meta-caching to eliminate quality degradation in sparse DiTs
  • Delivers a 1.80x speedup on Minimax-H3-Base and 2.32x on 3D generation while cutting peak memory by 45%
  • Operates training-free with residual compensation, matching dense attention quality across visual benchmarks
Read full story
Linked Models & Agents:
⚡ MC-Sparse⚡ DiT⚡ Minimax-H3-Base⚡ Triton-Sparse🤖 Inference-Optimizer🤖 DiT-Accelerator🌐 CUHK🌐 ByteDance🌐 Hugging Face

SparseEngine: Harbin Institute of Technology Open-Sources Sparse-First Inference Engine Delivering 2.5x Faster Decoding Than vLLM for Long-Horizon Agents

Long-horizon LLM agents accumulate expanding interaction histories that saturate GPU KV-cache memory and choke self-attention throughput. While sparse attention algorithms mitigate these bottlenecks mathematically, existing production serving engines (e.g. vLLM) are tightly coupled to dense tensor layouts, preventing heterogeneous sparse mechanisms from sharing infrastructure. Researchers from Harbin Institute of Technology (HIT) release SparseEngine (arXiv:2609.39068), an open-source, sparse-first inference engine built from the ground up for long-horizon agent workloads. SparseEngine establishes a shared lifecycle contract enabling 15 diverse sparse attention methods across four distinct families to control their custom KV representations while unifying memory management. It introduces Chain Cache to resume stateful KV-evicted contexts across multi-turn requests and Controllable Prefix-Cache Pruning to discard stale history without disrupting prefix matching. Empirical evaluations on long-horizon agent benchmarks show that SparseEngine delivers over 10x higher throughput under KV eviction, over 2.5x faster decoding throughput than vLLM at matched concurrency, and more than 2x end-to-end task speedups with zero degradation in model reasoning accuracy.

Key Takeaways

  • Harbin Institute of Technology open-sources SparseEngine, a sparse-first inference engine natively supporting 15 sparse attention algorithms
  • Introduces Chain Cache and Controllable Prefix-Cache Pruning to preserve prefix-cache benefits across multi-turn sparse agent sessions
  • Delivers 2.5x faster decoding than vLLM, lifts throughput by 10x under KV eviction, and halves end-to-end agent task latency
Read full story

PISA: Block Sparse Attention with O(N log N) Complexity and Hardware-Aware Triton Kernels

Researchers from SJTU and GAIR introduced PISA, a block-sparse attention mechanism that eliminates the quadratic bottleneck of conventional block selection in long-context LLMs. By adopting a coarse-to-fine pyramid Top-K selection hierarchy across O(log N) key levels, PISA reduces complexity to O(N log N). Accompanied by hardware-aware fused Triton kernels that avoid materializing query-key matrices, it matches dense baselines while substantially boosting long-context retrieval throughput.

PISA: Block Sparse Attention with O(N log N) Complexity and Hardware-Aware Triton Kernels

Key Takeaways

  • Overcoming Quadratic Block Selection: Conventional block-sparse attention methods still suffer from O(N²) scoring overhead when selecting retained blocks; PISA achieves true O(N log N) complexity via pyramid Top-K selection.
  • Coarse-to-Fine Key Hierarchy: Pools key vectors into an O(log N)-level hierarchy, applying LogSumExp scoring across bounded candidate pools to progressively narrow down candidate blocks.
  • Hardware-Aware Triton Kernels: Custom-built fused Triton kernels for training and inference eliminate the need to materialize query-key score matrices in HBM, slashing memory footprint and memory bandwidth bottlenecks.
Read full story
Linked Models & Agents:
ADSponsored

Alibaba Qwen open-weights Qwen3.8-Flash: 125B/6B multimodal MoE scoring 62.5 on SWE-bench Pro

Alibaba Qwen released open-weight Qwen3.8-Flash, a multimodal Mixture-of-Experts model billed as an early preview of the Qwen4 architecture. The production-scale checkpoint is 125B parameters plus 51B N-gram embeddings, with only 6B activated per token. The new stack combines Gated DeltaNet plus Qwen Sparse Attention, Gated Residual branches, N-gram embeddings that can live in host memory, and a refined Muon optimizer. Qwen said it trained at about one-ninth the cost of Qwen3.7-Plus while beating it across the board, especially on coding and office work: 58.7 on DeepSWE 1.1, 62.5 on SWE-bench Pro, 73.9 on CoWorkBench, 84.5 on AndroidWorld, and 95.7 on MathVision with CI. Native context is 262K tokens, extendable to 1M with YaRN; at 1M context the QSA kernel is up to 7.6x faster in prefill and 4.9x faster in decode. QwenCloud lists roughly $0.15 input / $0.47 output per million tokens, and day-0 runtimes arrived from NVIDIA NeMo, SGLang, Unsloth, OpenRouter, and OpenCode Go.

Key Takeaways

  • 125B/6B MoE hits 62.5 SWE-bench Pro and 58.7 DeepSWE 1.1 at ~1/9 the training cost of Qwen3.7-Plus.
  • QSA hybrid attention is up to 7.6x faster in prefill and 4.9x in decode at 1M context.
  • Open weights plus day-0 support on QwenCloud, OpenRouter, OpenCode, NeMo, SGLang, and Unsloth.
Read full story