推論系統

推論 runtime、量化、 serving、KV cache、成本與效能。

推論系統

The Optimization Stack for Running Hybrid Qwen Models on Apple Silicon Remains Incomplete: MLX Conversion Does Not Fully Preserve MTP

Community testing indicates that Apple Silicon inference frameworks still cannot reliably provide built-in MTP speculative decoding, hybrid-state prefix caching, and batched serving at the same time. The problem affects more than benchmarks: it can also force long-running coding agents to repay the prefill cost on every conversational turn.

推論系統

vToken Virtualizes the KV Cache at Token Granularity, Up to Doubling Concurrency Under Memory Constraints

vToken adds a logical token table and asynchronous compaction on top of the existing PagedAttention design, allowing per-token eviction to actually release physical blocks. Its vLLM prototype improves SLA-constrained throughput by up to 1.37×, but the code has not yet been released, and the authors have not shown that its data-movement costs are suitable for all hardware and workloads.

最新模型

DreamX-Phi Constrains Dual-Arm Video Prediction with SE(3) Trajectories, Temporarily Ranks First on WorldArena 2.0

DreamX-Phi injects the rigid-body transformations of two robotic arms directly into attention and constrains video generation using depth, object masks, and V-JEPA features. It scored 60.65 on a WorldArena 2.0 snapshot, but its weights and inference code will not be released until the challenge concludes, and generalization to real robots remains unverified.

最新模型

SAEs Independently Select Their Highest-Activation Tokens, Inflating Cross-Dictionary Causal Variance From Near Zero to 11.9%

A new study finds that sparse autoencoder ablation evaluations typically allow each dictionary to select its own highest-activation token, meaning ostensibly identical latents are tested at different positions. After fixing a shared position, the 7.6% and 11.9% of variance previously attributed to dictionary differences in controlled experiments nearly disappeared.

最新模型

LittleLearner Limits Pretraining Knowledge to a Fifth-Grade Level, With Few-Shot Prompting on Advanced Math Still Stuck at Around 6%

Researchers filtered 88 billion tokens of K–5 material from FineWeb‑Edu and trained 0.6B, 1.3B, and 5B models from scratch alongside compute-matched control models. Experiments show that scaling the models, applying SFT+GRPO, and providing in-context examples primarily elicit existing capabilities rather than clearly pushing beyond the pretraining knowledge boundary.

AI 安全

SPP Instills Value Reflection From the First Token, Widening the 3B Model’s OOD Risk Gap to 19 Points

Synthetic Persona Pretraining embeds first-person reflections generated from a “values constitution” into roughly 10% of pretraining documents, then uses post-training to bind that persona to the assistant identity. Newly released full experiments, weights, and data show that early intervention mainly improves value generalization, while resisting conventional jailbreaks may not require training from scratch.

推論系統

RMM Prunes the Matrix Multiplication Contraction Axis Based on Input, Accelerating Llama 3.1 8B Long-Context Inference by Up to 1.40×

Reduced Matrix Multiplication leaves weights unchanged and, based on the column norms of the current activation, computes only the highest-scoring shared dimensions in a matrix multiplication. A100 tests show that gains increase with sequence length, but for short contexts, selection and kernel-launch overhead almost entirely offset the savings.