推論系統

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

最新模型

TIDE Corrects Teacher–Student Mismatch, Raising Qwen3 Reasoning Avg@8 from 6.9% to 20.3%

TIDE no longer treats high token-level agreement as direct evidence of successful distillation. Instead, it separately addresses student overgeneration and the omission of teacher-preferred tokens. Under the severe-mismatch setting, the method also reduces the average response length by 3.6×, although reproducing the full training run still requires eight GPUs and the authors have not released a checkpoint.

最新模型

Matryoshka Embeds Three Models in a Single Set of Weights, Cutting Training Compute by 36%

Matryoshka Language Model Suites links 500M, 1.5B, and 3B submodels in a nested architecture that allows each model to be extracted and run independently, avoiding duplicate training for every size. Sharing early layers and the KV cache also increases speculative decoding throughput by 14% to 26%, though the approach has so far been validated only on base models up to 3B parameters.

推論系統

KVDiagnosis Traces KV-Cache Compression Failures Sample by Sample, Releases 12,520 Correct-to-Wrong Cases

Rather than merely comparing aggregate long-context scores, KVDiagnosis creates a paired FullCache baseline for every compression configuration to track evidence retention, attention, and probability drift. An implementation audit also led the team to exclude 7,800 PyramidKV records with identical results, highlighting how adapter errors can contaminate cross-method evaluations.

推論系統

Laguna S 2.1 INT4 With DFlash: Four RTX 3090s Tested at 200K Context and a Peak 282.5 tokens/s

A publicly available, reproducible community vLLM recipe deploys Laguna S 2.1 INT4 on four 24GB RTX 3090 GPUs and handles a real 190K-token request using a precision-matched DFlash draft model. The reported 282.5 tokens/s is a peak under a specific configuration, not sustained throughput, while the quality and compatibility of low-bit quantization remain highly dependent on the checkpoint and inference engine.

推論系統

CoBa Dynamically Allocates Inference Compute, Matching Best-of-16 With 58.9% Fewer Weighted Tokens

CoBa initially generates a small number of candidate answers, then uses disagreement and verification scores to decide whether to sample additional candidates or activate a stronger verifier. It achieved 85.13% macro-average accuracy across five reasoning benchmarks, although the results came from offline replay of pre-generated candidate pools rather than testing in a live service.

代理工具

Shepherd v0.3.0 Retains Agent Changes as Reviewable Proposals, but the Paper’s Automated Forking Supervision Is Not Yet Fully Delivered

Shepherd records model calls, tool operations, and file changes as persistent execution traces, allowing users to inspect or discard modifications before they enter the workspace. The latest documentation also explicitly states that the meta-agent delegation, in-flight forking, and automated retry interfaces demonstrated in the paper and on the project homepage are not yet directly usable features in v0.3.0.