惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Hugging Face - Blog
Hugging Face - Blog
Stack Overflow Blog
Stack Overflow Blog
量子位
腾讯CDC
N
Netflix TechBlog - Medium
aimingoo的专栏
aimingoo的专栏
小众软件
小众软件
S
SegmentFault 最新的问题
A
About on SuperTechFans
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
T
Tailwind CSS Blog
G
Google Developers Blog
U
Unit 42
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
雷峰网
雷峰网
罗磊的独立博客
Vercel News
Vercel News
L
LangChain Blog
V
V2EX
P
Proofpoint News Feed
M
MIT News - Artificial intelligence
博客园 - Franky
V
Visual Studio Blog
J
Java Code Geeks

Apple Machine Learning Research

Multilingual Knowledge Transfer under Data Constraints via Lexical Interventions Scaling Laws for Mixture Pretraining Under Data Constraints Examining Human-Like Behaviors in LLMs: A Multi-Dimensional Analysis of Model Behaviors, User Factors, and System Prompts The P-Completeness of Inverted Index Traversal: On the Complexity of Evaluating Boolean Query DAGs GRPO Beyond English: A Large-Scale Study of GRPO in Non-English and Multilingual Settings MVICAD2: Multi-View Independent Component Analysis with Delays and Dilations A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport When Unlearning Is Free: Leveraging Low Influence Points to Reduce Computational Costs Scaling Categorical Flow Maps Beyond Next-Token Prediction: A Performance Characterization of Diffusion versus Autoregressive Language Models Arbitrage: Efficient Reasoning via Advantage-Aware Speculation Locking Pretrained Weights via Deep Low-Rank Residual Distillation DeepAmbigQA: Ambiguous Multi-hop Questions for Benchmarking LLM Answer Completeness Taming Outlier Tokens in Diffusion Transformers Understanding Alignment in Multimodal LLMs: A Comprehensive Study Dimensionality Reduction Meets Network Science: Sensemaking on UMAP’s kNN Graph MoMo: Dial Motion Mode in Robot Manipulation with Spatiotemporal Action Tokenization Memory Efficient Audio Synthesis with Decoupled Temporal Depth Diffusion Transformers GH-ESD: Grounded Hypothesis-Driven Error Slice Discovery for Instance-Level Vision Tasks LEAD: Breaking the No-Recovery Bottleneck in Long-Horizon Reasoning Environment-free Synthetic Data Generation for API-Calling Agents Accelerating Text-to-Video Generation with Calibrated Sparse Attention RayRoPE: Projective Ray Positional Encoding for Multi-View Attention LVSum: A Benchmark for Timestamp-Aware Long Video Summarization Length Value Model: Scalable Value Pretraining for Token-Level Length Modeling When Unlearning Is Free: Leveraging Low Influence Points to Reduce Computational Costs Show Me Examples: Inferring Visual Concepts from Image Sets Location-Invariant Properties of Functions Versus Properties of Distributions: United in Testing but Separated in Verification Interactive Proofs for General Distribution Properties Doubly Sub-linear Interactive Proofs of Proximity
SpecMD: A Comprehensive Study on Speculative Expert Prefe...
2026-05-06 · via Apple Machine Learning Research

AuthorsDuc Hoang, Ajay Jaiswal, Mohammad Samragh Razlighi, Minsik Cho

Mixture-of-Experts (MoE) models enable sparse expert activation, meaning that only a subset of the model’s parameters is used during each inference. However, to translate this sparsity into practical performance, an expert caching mechanism is required. Previous works have proposed hardware-centric caching policies, but how these various caching policies interact with each other and different hardware specification remains poorly understood. To address this gap, we develop SpecMD, a standardized framework for benchmarking ad-hoc cache policies on various hardware configurations. Using SpecMD, we perform an exhaustive benchmarking of several MoE caching strategies, reproducing and extending prior approaches in controlled settings with realistic constraints. Our experiments reveal that MoE expert access is not consistent with temporal locality assumptions (e.g LRU, LFU). Motivated by this observation, we propose Least-Stale, a novel eviction policy that exploits MoE’s predictable expert access patterns to reduce collision misses by up to 85× over LRU. With such gains, we achieve over 88% hit rates with up to 34.7% Time-to-first-token (TTFT) reduction on OLMoE at only 5% or 0.6GB of VRAM cache capacity.

Related readings and updates.

Modern large language models (LLMs) extend context lengths to millions of tokens, enabling coherent, personalized responses grounded in long conversational history. However, the Key-Value (KV) cache grows linearly with the extended dialogue history, causing the model’s memory footprint to quickly exceed device limits. While recent KV cache compression methods attempt to reduce memory usage, most apply cache eviction after processing the entire…

Read more

Serving transformer language models with high throughput requires caching Key-Values (KVs) to avoid redundant computation during autoregressive generation. The memory footprint of KV caching is significant and heavily impacts serving costs. This work proposes to lessen these memory requirements. While recent work has largely addressed KV cache reduction via compression and eviction along the temporal axis, we argue that the depth dimension offers…

Read more