Cover image

Sparse Per Token, Dense Per Batch: XShare Reprices MoE Routing at Inference Time

XShare shows that MoE serving efficiency depends on the expert footprint of the whole batch, turning expert budgets into a controllable inference-time throughput and quality decision.

September 12, 2026 · 7 min · Zelina
Cover image

The Best Channel Model Depends on the Channel

CFM-Bench shows why wireless teams should select channel models by matched domain-task performance rather than a single leaderboard score or compute budget.

September 12, 2026 · 7 min · Zelina
Cover image

The Recipe Moves With the Run

OpenEuroLLM scaling experiments show why learning rate and batch size must be recalibrated across model scale, token budget, hardware constraints, and annealing.

September 12, 2026 · 8 min · Zelina
Cover image

Train the Family, Not Every Size From Scratch

CoM-PT shows how sequential knowledge reuse can reduce the total cost of training a vision-model family, while turning model-size selection into a chain-design problem.

September 12, 2026 · 8 min · Zelina
Cover image

Give the Quiet Experts More Bits

A new MoE quantization result suggests that precision should follow expert fragility, not simply expert usage.

September 11, 2026 · 6 min · Zelina
Cover image

More FLOPs, Worse Choice: Sparse MoE Scaling Has to Price the Cluster

MOSAIC shows why sparse-MoE architecture decisions should price the useful computation a real cluster can deliver, not model FLOPs alone.

September 11, 2026 · 7 min · Zelina
Cover image

Sparse Is Not Cheap by Default: What MoE Efficiency Actually Depends On

A sparse MoE model may activate far fewer parameters than it owns, but routing, capacity, communication, and deployment topology determine whether that sparsity becomes real system efficiency.

September 11, 2026 · 8 min · Zelina
Cover image

Sparse Routing May Buy You Inspectability, Not Just Efficiency

New evidence suggests sparse MoE routing may make model behavior easier to inspect at the expert level, not merely cheaper to execute.

September 11, 2026 · 8 min · Zelina
Cover image

Spend Verification Where Risk Is Highest

FACTOR shows how claim-level risk routing can improve factual generation while separating verifier cost from end-to-end latency.

September 11, 2026 · 7 min · Zelina
Cover image

SSD Capacity Is Not Throughput: What FlashMoE Changes About Local MoE Serving

FlashMoE shows that making oversized MoE models fit on local hardware is only half the problem; cache misses determine whether SSD-backed inference is fast enough to use.

September 11, 2026 · 8 min · Zelina