AI Coding Live News

On Oct 28 Cartesia chief scientist Albert Gu (co-author of Mamba) and team published two research posts on a new generation of hierarchical networks (H-Nets). In a controlled scaling ladder, swapping BPE tokenization for learned dynamic chunking alone gave up to 3-5x compute efficiency. A larger two-stage byte-level H-Net (3.67B parameters), compute-matched per byte against SmolLM3-3B, reached SmolLM3’s final average downstream score after about 1T tokens versus 11T (vendor-reported). The new architecture is not released yet; Cartesia says it plans to release it over time.

Zoom

While supervised fine-tuning (SFT) distills agentic tool-use capabilities from frontier LLMs into small language models (SLMs, 0.6B to 8B parameters), student agents frequently suffer from 'progress stagnation'—collapsing into repetitive, unproductive tool-calling loops as interaction trajectories extend. In arXiv:2610.19439, researchers introduced Progress-Aware Distillation (ProD). ProD defines a rigorous stagnation scoring formulation that dynamically identifies and penalizes stagnant behavior during student trajectory rollouts via an adaptive SimPO-inspired margin. Experiments across 8 diverse SLMs prove ProD effectively eradicates repetitive loops while boosting task completion efficiency and success rates.

Zoom

Arena announced a major update to Code Arena: WebDev: DeepSeek-V4.1-Flash-20261017 (Max) clinched the #1 position among open models with 1670 points, surpassing Kimi K3 (Max) at a 10x lower cost. Ranking #12 overall, it outperforms Claude Opus 5 (High) and narrows the gap with closed-source frontier GPT-6 Sol (Max) to roughly 10 points, resetting the Pareto efficiency curve at $0.30 input / $1.20 output per million tokens.

Zoom

Two new 3D vision and generative compression frameworks solve long-standing efficiency and quality bottlenecks: Zhejiang University's InfiniSplat v2 (arXiv:2610.20341, 118 upvotes on HF) decouples geometry and Gaussian attribute prediction with a frozen geometry branch and large-angle supervision, slashing mean LPIPS by 25.8% and DISTS by 32.9% across six 3D datasets. Meanwhile, Technion's H-DDCM (arXiv:2610.18125) replaces dense Gaussian codebooks in training-free diffusion compression with implicit Walsh-Hadamard dictionaries—requiring O(d log d) compute and O(d) memory—to enable near-real-time streaming video compression on a single GPU.

Zoom

SemiAnalysis published the architectural breakdown behind the 1.3B tokens per dollar TCO record on AgentX: vLLM and Inferact utilized Prefill/Decode disaggregated serving at hyperscaler volume pricing to achieve 4x better cost-efficiency than an aggregated NVIDIA B300 configuration. Concurrently, open-source coding agent Cline reported that DeepSeek-V4.1-Flash-1017 beats GPT-5.6-Sol on Terminal-Bench at ~17x lower cost (+35% over prior V4.1-Flash) purely by scaling RL training across multiple coding agent harnesses.

Zoom

Reconstructing scene-aligned, high-fidelity 3D assets from casual photos is foundational for robotics and spatial computing. However, casual captures suffer from sparse viewpoints, optical blur, and severe occlusions, causing standard 3D diffusion models to produce warped unobserved backsides and incorrect 6-DoF poses. NVIDIA Research introduces GATOR (arXiv:2610.11215, project: research.nvidia.com/labs/lpr/gator), a generative and agentic framework that reconstructs complete textured 3D objects and their scene-relative poses from one or more casual images. GATOR couples patch-aligned RGB, target masks, and pointmap features through a local modality mixer, synthesizing initial textured geometry via stage-specific adapters. Crucially, the generated asset initializes a multimodal agent that iteratively inspects, refines, and aligns the asset through an observation-guided edit-render-review loop. Across synthetic benchmarks, cluttered tabletops, and real indoor scenes, GATOR achieves state-of-the-art geometric fidelity and instant simulation readiness with superior inference efficiency.

Zoom

Enabling LLM agents to distill and reuse modular skills from past task traces allows policies and skillbanks to co-evolve over time. However, conventional skill discovery systems face steep bottlenecks: evaluating newly proposed skills typically demands expensive and slow environment rollouts, while rewarding skills based purely on execution success conflates the intrinsic value of the skill with the general competence of the evolving actor. In newly published research (arXiv:2610.10164), researchers introduce UniSkill (repo: github.com/LimOkii/UniSKill). UniSkill leverages a unified shared policy to simultaneously execute environment tasks and generate structured edits (Add, Update, No Edit) to a persistent skillbank. Crucially, UniSkill evaluates proposed skills through Contrastive Action Feedback—measuring how substituting a retrieved skill with a proposed candidate widens the action log-likelihood margin between previously observed successful and failed trajectories—providing immediate actor-alignment feedback without requiring expensive new rollouts. Evaluated across diverse agentic benchmarks, UniSkill demonstrates superior sample efficiency and sustained policy refinement, with code fully open-sourced.

Zoom

As autonomous LLM agents navigate complex long-horizon operational streams in production, enabling continuous test-time weight adaptation without catastrophic policy drift remains a foundational challenge. Conventional in-context adaptation stores reflections or skills as text, making reuse bottlenecked by fragile retrieval heuristics over a static, frozen policy; conversely, directly imitating or reinforcing tokens from single deployment rollouts destabilizes policy weights. Researchers formalize Online Agentic Test-Time Training (OaTTT) and introduce ASCENT (arXiv:2610.05303). The agent executes each task in a single streaming pass. A frozen copy of the initial model acts as a hindsight teacher, receiving verified execution trajectories as privileged context to compute calibrated next-token predictive distributions. Distilling these distributions into persistent LoRA fast weights continuously updates policy parameters across subsequent tasks without external teacher models or gold references. By pruning invalid-action turns to distill condensed execution trajectories, ASCENT systematically improves task success rates and interaction efficiency across ALFWorld, WebShop, and AppWorld, successfully transferring learned behaviors to held-out environments.

Zoom

Looped Transformers achieve dramatic parameter efficiency by repeatedly executing a single shared block across recurrent cycles. However, standard autoregressive decoding discards all intermediate recurrent states, utilizing only the final pass. Researchers from UT Austin, Princeton, and collaborators introduce LoopCD, a training-free contrastive decoding framework. By contrasting final recurrent predictions with early-stage weaker passes in logit space (LoopCD-Logits) or hidden space with zero output pass overhead (LoopCD-Hidden), LoopCD raises Ouro-2.6B-Thinking's AIME 2024 Pass@1 from 61.88% to 73.33% and Huginn's HumanEval Pass@1 from 22.56% to 31.71%. Crucially, LoopCD allows halving recurrent loops while outperforming full-depth unguided baselines, reducing forward FLOPs by 22.5% to 48.2%.

Zoom

While looped transformers achieve high parameter efficiency by iteratively recycling layers for latent compute, fixed-depth looping expends redundant iterations on simple tokens and suffers from performance saturation. Tsinghua University's NICS lab developed TaH2, an adaptive looped framework that co-trains the backbone and an iteration decider via lookahead depth supervision. Evaluated on the rigorous AIME competition benchmarks, TaH2 accelerates the accuracy-compute scaling slope by 53% (2.74 vs 1.79) and surpasses non-looped baselines by +3.4 to +3.9 points at matched test-time compute.

Zoom