AI Coding Live News

NVIDIA open-sources Nemotron 3.5 Bolt E4B 4GB, a Gemma 4 E4B-based small model for local assistants, characters and robots with tool use

On 2026-10-23 (15:41 UTC) the official @NVIDIAAI account announced Nemotron 3.5 Bolt E4B 4GB, a small open model for local assistants, interactive characters and robots that can hold a conversation and use tools. The official Hugging Face model card says it is post-trained from Gemma-4-E4B-it, has 8B total parameters (4B effective), ships in Q4_K_M quantization, supports up to 64K input and 64K output tokens, and has a switchable thinking mode, plus a DFlash speculative-decoding drafter and a BF16 version. Weights, data and recipes are open under the OpenMDW-1.1 license, with commercial use allowed. On the model card the 4GB build scores 55.60 on MultiChallenge (Gemma4 E4B-it at the same quantization 39.36, Qwen3.5 4B 52.23), but trails Qwen3.5 4B on Tau2-Bench (52.32) and BFCL-v3 (67.31).

NVIDIA open-sources Nemotron 3.5 Bolt E4B 4GB, a Gemma 4 E4B-based small model for local assistants, characters and robots with tool use

Key Takeaways

  • NVIDIA officially released Nemotron 3.5 Bolt E4B 4GB for local assistants, interactive characters and robots
  • Post-trained from Gemma-4-E4B-it: 8B total parameters (4B effective), Q4_K_M quantization, 64K context, switchable thinking mode
  • Open weights, data and recipes under the OpenMDW-1.1 license with commercial use allowed, plus a DFlash speculative-decoding drafter
  • Model card results: 55.60 on MultiChallenge leads its size class, but it trails Qwen3.5 4B on Tau2-Bench and BFCL-v3
Read full story
Linked Models & Agents:
⚡ Nemotron 3.5 Bolt E4B⚡ Gemma 4 E4B🌐 NVIDIA🌐 Google

Are Embeddings Overpriced? Frozen 16 MB Vocabulary Slashes Small Model Weights by 62% with Zero Downstream Accuracy Loss

In small language models, vocabulary embedding tables often account for over 60% of total parameters, posing severe bottlenecks for edge deployment and ternary quantization. A new study (arXiv:2610.22428) replaces trainable embeddings with a single frozen 16 MB table of 512-bit binary codes derived via PCA and sign binarization. On Gemma 3 270M, trainable parameters collapse from 268.1M to 101.0M (-62.3%) while matching or exceeding original performance across HellaSwag (30.4%), LAMBADA (23.2%), and PIQA (61.5%).

Are Embeddings Overpriced? Frozen 16 MB Vocabulary Slashes Small Model Weights by 62% with Zero Downstream Accuracy Loss

Key Takeaways

  • Highlights structural waste in SLMs: embedding tables occupy 167.8M parameters in Gemma 3 270M (62.6% of the entire model)
  • Introduces a frozen 16 MB table of 512-bit binary codes (arXiv:2610.22428) derived via PCA and sign binarization with zero trainable weights
  • Slashes trainable parameters in Gemma 3 270M from 268.1M to 101.0M (-62.3% reduction)
  • Maintains parity on HellaSwag (30.4%) and outperforms the baseline on LAMBADA (23.2% vs 21.6%) and PIQA (61.5% vs 60.6%), while seamlessly enabling ternary models
Read full story
Linked Models & Agents:

SpecAgent & LEASH: Trajectory-Level Speculative Execution Halves Agent Latency while Latent-Uncertainty Escalation Beats Always-On Claude Opus 5 on OSWorld

Two new frameworks re-architect how weak and strong models collaborate in long-horizon agents: SpecAgent (arXiv:2610.21463) lets a small model draft multi-step read-only tool trajectories grounded in real observations while holding environment-modifying actions, allowing the strong model to verify the entire segment in a single parallel prefill pass—halving wall-clock time and memory traffic on τ²-Bench. Complementarily, LEASH (arXiv:2610.22280) uses training-free latent-state uncertainty to escalate and supervise computer-use agents, reaching 73.66% on OSWorld with Qwen3.5-35B-A3B—beating always-on Claude Opus 5 (72.90%) while cutting inference cost by 19.2%.

SpecAgent & LEASH: Trajectory-Level Speculative Execution Halves Agent Latency while Latent-Uncertainty Escalation Beats Always-On Claude Opus 5 on OSWorld

Key Takeaways

  • Trajectory-level speculative execution (SpecAgent): small model executes read-only tools and pauses at write barriers while the strong model verifies via a single parallel prefill pass
  • Halves wall-clock time and memory traffic: matches strong-model accuracy within 1 point on τ²-Bench while cutting strong-model token generation by >=50% on MCP-Atlas
  • LEASH beats always-on Claude Opus 5 on OSWorld: reaches 73.66% with Qwen3.5-35B-A3B vs. 72.90% for always-on Claude Opus 5 while saving 19.2% in cost
Read full story

Anthropic research: small models may be months from weight-based self-replication without a datacenter; IoT fleets can serve 26B shards

On 2026-10-12 Anthropic (William Zhou, Daniel Freeman) published research arguing small models may be months from autonomous weight-based replication on commercial IoT. Models ≤30B already complete many replication steps; in simplified evals GLM-5.2 finishes end-to-end. A demo ran Gemma4-26B-A4B across 15 ~$55 Android TV boxes via pipeline parallel (~0.39 tok/s). Extrapolating Epoch Capabilities Index gains, small models may hit the replication floor by end of 2026.

Key Takeaways

  • Official: Anthropic research post (2026-10-12)
  • Demo: 15 cheap Android TV boxes (~4GB RAM) pipeline-parallel serve Gemma4-26B-A4B at ~0.39 tok/s; a 9B model stood up inference on 8/9 hardware types
  • E2E: in a firewalled redroid VPC with unauthenticated ADB, GLM-5.2 reached 8/8 nodes in 4/5 trials (7/8 once), tasked to serve Llama3.1-8B then spawn
  • Timescale (vendor): full inference-setup trajectories ~71–150h (Gemma4-26B-A4B) / 28–51h (Qwen3.5-9B)—day-scale doubling, not minute-scale worms
  • Defenses: drive R₀ < 1; ISP flow anomalies, honeypots, quarantine; manufacturer defaults and compliance
Read full story
Linked Models & Agents:
⚡ GLM-5.2⚡ Gemma4-26B-A4B⚡ Qwen3.5-9B⚡ Llama3.1-8B🤖 Pi🤖 Memento🌐 Anthropic
ADSponsored

TokenRouter: Tsinghua Unveils NeurIPS 2026 Serving System for Token-Level LLM Routing, Boosting Throughput by up to 64x

Token-level LLM routing—routing easy tokens to small models and switching to frontier models for critical reasoning tokens—presents an optimal trade-off between output quality and inference cost. However, current LLM serving engines (such as vLLM and TGI) are architected for single-model execution, suffering severe step desynchronization, batch admission latency, and extreme orchestration complexity when handling high-frequency token transfers across heterogeneous models. Researchers from Tsinghua University's NICS Lab present TokenRouter (arXiv:2610.12242, accepted at NeurIPS 2026, code: github.com/thu-nics/TokenRouter), an efficient and developer-friendly serving system engineered for token-level routed LLM inference. TokenRouter introduces a 'request-centric programming and model-centric execution' paradigm, enabling developers to write routing logic intuitively per request while the runtime handles asynchronous execution across subservers. Incorporating a Delayed-Batching Scheduler parameterized via discrete-time Markov chain modeling, a decoupled tri-loop architecture, and an instant handoff-resume mechanism, TokenRouter achieves 2.01x to 64.15x higher decoding throughput compared to existing serving platforms across diverse routing workloads, with complete code open-sourced.

TokenRouter: Tsinghua Unveils NeurIPS 2026 Serving System for Token-Level LLM Routing, Boosting Throughput by up to 64x

Key Takeaways

  • Tsinghua University open-sources TokenRouter (NeurIPS 2026), an optimized serving architecture for token-level LLM routing
  • Introduces request-centric programming and a delayed-batching scheduler, delivering 2.01x to 64.15x higher decoding throughput
  • Decoupled tri-loop execution cuts P99 inter-token latency by 43.6%, reducing enterprise cloud GPU costs by 50% to 70%
Read full story
Linked Models & Agents:

Perplexity open-sources pplx-embed-v2-late: 0.6B/9B multimodal ColBERT retrievers, OCR-free PDFs, small model queries the big model's index

On Oct 7 Perplexity released pplx-embed-v2-late, multimodal late-interaction (ColBERT) retrievers in 0.6B (340M active) and 9B (7.4B active) sizes, built on Qwen3.5 with bidirectional attention. Each token gets a 128-dim vector scored by MaxSim, covering text, images and rendered PDFs or slides without OCR. Both sizes share one embedding space, so the 0.6B model can query a 9B-built index. Public ViDoRe v3 image nDCG@10 is 62.3% / 65.2%; MIT-licensed weights are on Hugging Face.

Key Takeaways

  • Public ViDoRe v3 nDCG@10: 0.6B 62.3% image / 61.2% markdown; 9B 65.2% image / 64.7% markdown (0.6B model card)
  • Perplexity says the 0.6B model matches models with about 5x the active parameters on ViDoRe V3 (blog)
  • Shared embedding space: index with 9B, query online with 0.6B to cut query-time cost
  • Training: distilled from an internal 18B ColBERT teacher with a token-level LEAF-style objective; 9B fully fine-tunes the last 8 layers and uses LoRA elsewhere, including the vision encoder
  • Setup: sentence-transformers >= 6.0.0 and transformers >= 5.4.0, MIT license; encode text-only and image-only batches separately (9B model card)
Read full story
Linked Models & Agents:
⚡ pplx-embed-v2-late-0.6b⚡ Pplx Embed V2 Late 9b⚡ Pplx Embed V2 Context⚡ Qwen3.5🌐 Perplexity🌐 Hugging Face

KAIST Unveils FlyBy: Overcoming Blind Thinking in Small Reasoning Models via Cost-Aware RL, Outperforming 14B at 63% Lower Cost

While test-time compute scaling has propelled reasoning capabilities in large models, small reasoning models (sRMs, 4B-8B) frequently fail when scaling thinking tokens: self-refinement merely consolidates probability onto already reachable hypotheses, failing completely when missing parametric knowledge. KAIST researchers introduce FlyBy, a selective querying framework that formally decouples execution bottlenecks (recoverable through internal reflection) from knowledge bottlenecks (requiring external teacher queries). Optimized via cost-aware reinforcement learning, FlyBy teaches small models when to think, when to ask, and how much compute budget to expend. Evaluated across 1,158 hard problems on six benchmarks, FlyBy-4B reaches 45.96% pass@8, outperforming the much larger Qwen3-14B (41.64%) while slashing serving costs by 2.7x (a 63% reduction).

KAIST Unveils FlyBy: Overcoming Blind Thinking in Small Reasoning Models via Cost-Aware RL, Outperforming 14B at 63% Lower Cost

Key Takeaways

  • Diagnosing Blind Thinking in sRMs: Empirical interventions demonstrate that self-refinement primarily concentrates probability mass on pre-reachable states; lacking key facts, extra test-time compute leads to hallucination loops.
  • Execution vs. Knowledge Bottleneck Decoupling: FlyBy introduces formal state interventions to separate execution errors (amenable to reflection) from knowledge bottlenecks (requiring external model invocation).
  • 4B Surpasses 14B at 63% Lower Cost: On 1,158 difficult multi-domain problems, FlyBy-4B scores 45.96% pass@8 (beating Qwen3-14B's 41.64%) at 2.7x lower serving cost, while FlyBy-8B scales to 51.81%.
Read full story

IBM Granite 4.2 lands on Ollama: 3B/8B/30B Apache-2.0 models for enterprise agents

Ollama added IBM Granite 4.2 in 3B, 8B, and 30B sizes, Apache 2.0, free for research and commercial use. The family is aimed at enterprise agents: coding, RAG, tool use, structured JSON, multilingual chat, and a built-in thinking mode, with data and training run through IBM GRC and document-quality reviews. Context is 128K; ollama run granite4.2 is enough to start locally. For teams that cannot send code off-network but still want a reason-on/off small model with a commercial license, it is a compliance-friendly local agent base.

Key Takeaways

  • Granite 4.2 ships 3B/8B/30B under Apache 2.0 for research and commercial use.
  • Targets enterprise agents: coding, RAG, tools, JSON, multilingual, plus togglable thinking.
  • GRC-screened training data; 128K context on Ollama via ollama run granite4.2.
Read full story
Linked Models & Agents: