proomt

Search

Search posts, papers, and topics

All posts

Hugging Face Daily PapersYu Lin, Yiming Wang, Runyuan Cai1 min readpaperadvanced

The Other Half of the Memory Wall: Serving 35B MoEs from SSD with Trained Routing Prediction

Summary

The paper presents Edge0, a streaming MoE inference engine that predicts the next layer's routing one token ahead, allowing expert weights to be fetched from SSD while compute proceeds. This enables a 35 B‑parameter MoE to run on a single 24 GB machine at ~20 tokens/s using only ~3 GiB of active memory and with near‑teacher accuracy.

  • Edge0 adds a per‑layer routing predictor that forecasts the next layer’s expert set one token ahead, overlapping SSD reads with compute.
  • Streaming expert weights from SSD and keeping only the predicted set active reduces peak memory to ~3 GiB for a 35 B MoE.
  • An unmerged LoRA adapter, trained on the student path, recovers most accuracy loss from 4‑bit quantization and routing approximation.
  • On a single 24 GB GPU, Edge0 achieves ~20 tokens/s for a 35 B MoE, within a few points of the fp16 teacher across five benchmarks.

Engineers who need to run large MoE models on consumer‑grade hardware can now do so with low memory overhead and competitive speed.

7/10

Related reading

  1. IntBMoE: Integrating Block-Level Conditioning into Expert Composition for Full-Participation Mixture-of-Experts

    IntBMoE introduces block‑level conditioning to MoE, decoupling token participation, compute execution, and memory materialization. A hypernetwork merges all experts into a composed expert per block, while routing remains sparse. Dual‑Path Residual Gating further mixes two composed paths. Experiments show consistent gains on vision, language, and recommendation tasks, and the model is live in AMap…

    Hugging Face Daily Papersarxiv.org2 minpaper
  2. DeepSeek-V4.1-Flash: Pushing the Limits of KV Cache Compression

    DeepSeek‑V4.1‑Flash is a 552B‑parameter multimodal Mixture‑of‑Experts LLM that supports up to 1 M‑token contexts while slashing KV‑cache memory to 890 bytes/token (≈¼ of its predecessor) via cross‑layer reuse (CSA2) and FP4 quantisation, plus a SWA‑Bounded Replay scheme that cuts persistent cache to 1/8. The Causal Encoder‑Decoder design halves prefill compute (8B vs 16B active parameters) and th…

    Hugging Face Daily Papersarxiv.org3 minpaperHN12710
  3. When2Think: Learning Difficulty-Aware Length Control for Efficient Hybrid Reasoning Models

    When2Think introduces a post‑training framework that lets a large reasoning model decide per‑instance how much reasoning depth to allocate, using difficulty‑aware reward shaping (IDAC) and verifier rewards. It cuts token usage by ~28% while boosting Pass@3 by 10% on AIME24 and reaches 40% Pass@3 on AIME25, outperforming compression and routing baselines.

    Hugging Face Daily Papersarxiv.org1 minpaper
  4. M4N VM family, now GA: Highest per-core IOPS and throughput for I/O and memory-bound workloads

    Google Cloud’s GA‑available M4N VM family pairs 5th‑gen Intel Xeon CPUs with Google’s custom Titanium offload to deliver up to 1 M IOPS, 25 GiB/s block‑storage throughput, 400 Gbps VM‑to‑VM bandwidth, and a 26 GB/vCPU memory ratio (up to 5.9 TiB RAM). The design targets memory‑bound, I/O‑intensive workloads (Oracle, SAP HANA, vector search, real‑time analytics) and claims >20 % TCO reduction for…

    Google Cloud Bloggoogle.com5 min
  5. Show HN: Mini-AGI – Dynamic continual learning model trained on 8GB VRAM

    mini-AGI is a byte‑level continual‑learning language model that fits on a single 8 GB GPU by paging expert weight files from disk. It uses two dense prelude blocks followed by a recurrent block applied up to 24 times per character, with adaptive depth (PonderNet halting) and per‑application top‑8 expert routing. The system maintains a RAM cache and a VRAM resident set, swaps experts based on dema…

    Hacker News front pagegithub.com20 minHN14525lobste.rs2
  6. 1 points

    Saving another 100TB of RAM with math (and Rust)

    Cloudflare reduced the memory footprint of its Pingora Backend Router by re‑examining the consistent‑hashing implementation in the pingora‑ketama library. By increasing the number of virtual hash points per server from the default 1 to the standard 160 (and applying weighted hashing based on disk capacity), they cut the per‑node overhead enough to reclaim >100 TB of RAM across the fleet. The post…

    Hacker News front pagecloudflare.com13 minHN478120lobste.rs33