AIAny
Icon for item

FreeToken: Efficient Edge-Native MoE Serving with Bandwidth-Adaptive Execution

Enables interactive serving of large Mixture-of-Experts (MoE) models on personal machines by adapting offload and execution to measured device bandwidth and agentic workload patterns. Key features include bandwidth-adaptive execution, semantic-aware caching of recurrent state, and an elastic GPU expert cache; supports 20+ MoE models and runs models from ~35B to 753B on consumer/workstation GPUs.

Introduction

FreeToken reframes the problem of running frontier MoE models locally: once sparse activation makes per-token compute feasible, the real challenge becomes orchestrating GPU, CPU, host memory and interconnect as a unified, elastic platform. The paper's core insight is that per-machine bandwidth profiles and agentic workload structure are first-order signals that should drive runtime expert placement and execution, not fixed offload strategies.

Key Findings
  • Bandwidth-adaptive execution: FreeToken measures pinned PCIe transfer bandwidth and host-side processing bandwidth, and dynamically splits each step's cache misses between PCIe transfers (GPU execution) and in-place CPU execution. This converts residual host bandwidth into useful token progress without stalling cache updates.
  • Semantic-aware caching and agentic checkpoints: The system anchors recurrent-state checkpoints at semantic boundaries (e.g., thinking segments, tool calls) so context edits re-prefill only the new suffix, reducing recomputation for agent workloads.
  • Elastic expert-memory lifecycle: GPU expert cache is a runtime-adjustable shared LRU across layers; FreeToken can resize and rebuild the cache at scheduler safe points without restarting or reloading the host pool.
  • Empirical gains: Across consumer and workstation GPUs (8GB laptop to RTX PRO 6000), FreeToken sustains substantially higher decode throughput and lower tail latency versus state-of-the-art edge serving systems, enabling interactive serving of models from ~35B up to 753B in practical settings.
Who it's for and tradeoffs

Great fit if you need to run MoE-based large models locally (development machines, privacy-sensitive deployments, or offline agents) and your hardware is heterogeneous in CPU/PCIe/VRAM balance. It is aimed at agentic workloads where routing locality and repeated agent turns can be exploited. Look elsewhere if you require minimal engineering integration and expect simpler dense models: FreeToken adds runtime complexity (profiling bandwidths, managing host-resident expert pool, dual-path execution) and is optimized for sparse MoE models rather than dense-only inference.

Where it fits

FreeToken sits between datacenter-focused serving stacks and lightweight local runtimes: it focuses on serving very large sparse models by actively trading off PCIe transfers and CPU execution, complementing systems that assume full-GPU residency or only simple prefetch caches.

How it works (brief)

FreeToken maintains a CPU-resident expert pool as the source of truth and an elastic GPU expert cache with slots for (layer, expert) tensors. During prefill it double-buffers expert streaming behind layer computation; during decode it computes a q* partition of misses between PCIe cache-fills and CPU execution using two profiled bandwidths (B_P and B_H). A shared LRU captures routing locality, and the scheduler can reshape the GPU cache at runtime to adapt to changing memory availability and workload patterns.

Information

  • Websitearxiv.org
  • AuthorsShuo Yang, Xiaoze Fan, Melissa Pan, Haocheng Xi, Zhe Wang, Shanlin Sun, Kurt Keutzer, Song Han, Matei Zaharia, Chenfeng Xu …
  • Published date2026/08/17

More Items

Calibrates multi-reward reinforcement learning by adaptively upweighting infrequently active rewards per rollout batch, so sparse objectives provide stronger signals when they matter. Proposes an inverse-square-root density correction and shows faster learning on tool-calling and math-reasoning tasks.

Models sequence generation by unmasking multiple tokens per denoising step and replaces a factorized reverse process with a mixture over discrete routing-based latents from an MoE backbone; improves few-step sampling quality without increasing active parameters.

Demonstrates that pretrained transformers typically use only ~1–3 lines of depth to follow reference chains, and that a task‑trained rank‑8 LoRA applied at one early layer (with all other weights frozen) can extend reference‑following to dozens or hundreds of lines while adding only a few ten‑thousand parameters.