AI Coding Live News

NVIDIA Unveils OpenShell Reference Architecture: Hardware-Isolated Security Guardrails for Autonomous Agents

At GTC Berlin, NVIDIA unveiled the OpenShell Reference Architecture alongside the Agent Knowledge Foundation within its Agent Toolkit. Addressing critical enterprise vulnerabilities where autonomous tool-using agents succumb to prompt injections, hallucinated destructive commands, or unauthorized data exfiltration, OpenShell establishes hardware-isolated runtime boundaries. Operating through hardware roots of trust, OpenShell dynamically intercepts out-of-boundary tool calls and file access in real time with sub-microsecond latency, establishing an authoritative blueprint for secure, auditable enterprise agent deployments.

NVIDIA Unveils OpenShell Reference Architecture: Hardware-Isolated Security Guardrails for Autonomous Agents

Key Takeaways

  • NVIDIA officially launched the OpenShell Reference Architecture at GTC Berlin, establishing hardware-isolated boundaries for autonomous agents
  • Implements dynamic runtime interception, strictly preventing out-of-boundary tool invocations, malicious script execution, and data leaks
  • Natively integrates with the NVIDIA Agent Toolkit and Agent Knowledge Foundation for end-to-end access control and compliance auditing
  • Solves critical enterprise security roadblocks preventing production rollout of high-privilege coding and autonomous operations agents
Read full story
Linked Models & Agents:

MemT-1.0: Towards Memory-Native Evolution Slashing 128K KV Footprint by 66x with Gated DeltaNet-2

Researchers introduced MemT-1.0 (arXiv:2610.26825), a groundbreaking architecture internalizing memory as an intrinsic component of foundation model computation. Moving beyond exploding KV caches and lossy Vector RAG pipelines, MemT-1.0 employs Gated DeltaNet-2 with stable within-turn token-level updates alongside a novel Mixture-of-Storage mechanism. Trained across a two-stage 34B-token pipeline, the released MemT-1.0-Nano model achieves a 1.86x end-to-end inference speedup and a staggering 66x reduction in persistent storage at 128K tokens relative to full-context KV caching, dramatically elevating procedural task execution in autonomous agents.

MemT-1.0: Towards Memory-Native Evolution Slashing 128K KV Footprint by 66x with Gated DeltaNet-2

Key Takeaways

  • MemT-1.0 introduced on arXiv:2610.26825, pioneering memory-native evolution by internalizing memory directly into model computation
  • Combines Gated DeltaNet-2 with stable token-level memory updates and Mixture-of-Storage to scale memory capacity intrinsically
  • At 128K context length, delivers a 1.86x inference speedup and slashes persistent storage by 66x compared to standard KV cache
  • Internalizes procedural operational experience, significantly improving agentic multi-turn task success rates
Read full story
Linked Models & Agents:
⚡ MemT-1.0-Nano⚡ MemT-1.0-Flash

Meta Releases Muse Glimmer 30B: An Apache 2.0 On-Device Agentic Model Running on a Single Consumer GPU

Meta AI published the technical report for Muse Glimmer 30B (arXiv:2610.24628), an open-source 30-billion parameter causal language model with an integrated perception encoder designed for on-device autonomous agents. Quantized to approximately 4 bits, Muse Glimmer operates inside 32GB of VRAM on a single consumer GPU (such as an RTX 5090) without cloud reliance. On rigorous agentic evaluations, Muse Glimmer sets new records for its size class: achieving 75.5 on MCPAtlas (surpassing Gemma4-31B at 54.2 and Qwen3.6-27B at 62.5) and 51.2 on SWE-Bench Pro, released fully under the Apache 2.0 license.

Meta Releases Muse Glimmer 30B: An Apache 2.0 On-Device Agentic Model Running on a Single Consumer GPU

Key Takeaways

  • Meta released the technical report for Muse Glimmer 30B (arXiv:2610.24628), open-sourcing the agentic foundation model under Apache 2.0
  • Runs on a single consumer GPU with ~4-bit quantization inside 32GB VRAM (e.g. RTX 5090), enabling 100% offline edge autonomy
  • Scores 75.5 on MCPAtlas tool use benchmark, outperforming Gemma4-31B (54.2) and Qwen3.6-27B (62.5) by wide margins
  • Achieves 51.2 on SWE-Bench Pro, demonstrating industrial-grade software engineering bug-fixing capabilities on local desktop silicon
Read full story
Linked Models & Agents:
⚡ Muse Glimmer 30B⚡ Gemma4-31B⚡ Qwen3.6-27B🌐 Meta

MemPilot Unveiled: On-Demand Multimodal Memory Curation for LLM Agents Solving Multi-Session Context Saturation

Researchers introduced MemPilot (arXiv:2610.06830), an on-demand multimodal memory curation framework for LLM agents. Resolving the chronic context explosion and cross-session forgetting that plague autonomous agents handling mixed text, screenshots, and action traces, MemPilot introduces an adaptive policy controlling memory retention, semantic clustering, and targeted retrieval. Across extensive long-horizon multi-modal agent benchmarks, MemPilot cuts active memory footprint by over 60% while substantially improving cross-session task completion.

MemPilot Unveiled: On-Demand Multimodal Memory Curation for LLM Agents Solving Multi-Session Context Saturation

Key Takeaways

  • Researchers introduced MemPilot (arXiv:2610.06830), an on-demand multimodal memory curation framework solving context saturation in LLM agents
  • Features a tri-tier architecture spanning active buffers, an image Memory Gallery, and a long-term semantic knowledge graph
  • Slashes active multimodal token consumption by 60% to 75%, extending agent continuous operational lifespan by over 3x
  • Boosts cross-session task completion by +18.5% over text-only RAG, providing a scalable blueprint for persistent computer-use agents
Read full story
Linked Models & Agents:
ADSponsored

Prospective Hindsight: Self-Calibrating Reinforcement Learning for Long-Horizon Agents Resolves Miscalibration

Salesforce AI Research has introduced Prospective Hindsight (PH), a self-calibrating training framework for long-horizon autonomous agents. Addressing the fundamental limitation of standard RL where credit assignment occurs strictly after environmental feedback, PH exploits the gap between the agent's pre-action prospective prediction and post-action retrospective evaluation. By weighting gradients with this surprise residual, PH eliminates overconfident failures in single-turn tasks and underconfident successes in multi-turn interactions across GRPO and on-policy distillation.

Prospective Hindsight: Self-Calibrating Reinforcement Learning for Long-Horizon Agents Resolves Miscalibration

Key Takeaways

  • Transcends retrospective credit assignment: captures the surprise residual between pre-action prospective expectations and post-action environmental realities
  • Calibration as an emergent byproduct: minimizing surprise provides an intrinsic descent pathway on agent miscalibration without auxiliary penalty loss terms
  • Resolves dual failure modes: successfully eliminates overconfident failures in single-turn verifiable tasks and underconfident hesitation in multi-turn agent environments
Read full story

MMPostTrainBench & MMResearch: Benchmarking Autonomous Agents in Multimodal Post-Training and Mitigating Capability Regressions

Autonomous research agents hold the promise of sustaining AI self-improvement by iteratively proposing hypotheses, tuning models, and refining post-training pipelines. While agents demonstrate competence on text-only code tasks, their capacity to execute multimodal post-training across images, audio, and video remains uncharted. Researchers introduce MMPostTrainBench (arXiv:2610.05398), the first benchmark designed to evaluate autonomous research agents conducting multimodal post-training across eight tasks spanning image, audio, video, joint audiovisual comprehension, and image-grounded software repair. Agents operate from a common base model under fixed budgets with development feedback before independent evaluation. The audit reveals sobering realities: across all tasks, 52.1% of agent-submitted models fall below the baseline, exhibiting severe non-target capability regressions, and agents fail to reliably select the best candidate (trailing top models by up to 5.38 percentage points). To resolve multimodal research drift, the authors introduce MMResearch, a framework integrating media-grounded evidence and hierarchical memory. Integrated into coding agent runtimes, MMResearch improves submitted model accuracy by up to 7.75 percentage points for Claude Code (Claude Opus 4.8) and 2.33 points for Codex (GPT-5.6).

Key Takeaways

  • MMPostTrainBench benchmarks autonomous research agents conducting multimodal post-training across eight core tasks
  • Reveals that 52.1% of unguided agent post-training runs degrade baseline performance, suffering a 5.38 pp selection gap
  • Introduces MMResearch scaffolding, elevating Claude Code model accuracy by +7.75 pp and slashing regressions by 64%
Read full story
Linked Models & Agents:

Tracing the Thoughts of a Coding Agent Playing ARC-AGI-3: White-Box Lessons for Continual Learning

Continual learning without weight fine-tuning represents a frontier in LLM agent research. When an agent acts purely by writing and executing Python scripts inside an execution sandbox, every thought, hypothesis, and plan leaves a verifiable trace on disk. In a newly released study (arXiv:2610.11450), researchers subject coding agents to ARC-AGI-3—a suite of instruction-free abstract visual reasoning environments where each sequential level introduces novel causal dynamics. Developing a fine-grained measurement protocol, the authors trace thoughts across file artifacts across seven full evaluation runs spanning three foundation backbones from two major model families. The empirical findings reveal that scripts written for one level are almost never invoked in subsequent levels (only 33 of 630 cross-task references survive), as agents deliberately abandon 74% of scripts at task boundaries to purge level-specific overfitted state while rewriting core rules. Notes are maintained in an append-only fashion, with conflicting claims arbitrated against raw execution logs to achieve selective rather than catastrophic forgetting. Crucially, the study identifies carrying hard-coded variables across task boundaries as the single most devastating failure mode of autonomous agents.

Key Takeaways

  • Presents the first white-box thought-tracing audit of coding agents continually learning across ARC-AGI-3 environments
  • Finds agents deliberately abandon 74% of scripts at task shifts to purge state, settling append-only notes against immutable logs
  • Identifies carrying hard-coded constants across task boundaries as the single most catastrophic agent failure mode
Read full story
Linked Models & Agents:
⚡ ARC-AGI-3⚡ Coding-Agent⚡ Continual-Learning🤖 ARC-Agent🤖 Thought-Tracer🌐 Hugging Face🌐 Open Source Research

Learn2Play-Bench: New Benchmark Evaluates How LLM Agents Truly Learn from Interaction in Counterintuitive Worlds

Whether LLM-based autonomous agents truly learn from interactive experience or merely regurgitate memorized knowledge remains a fundamental question in AI research. Most conventional agent benchmarks evaluate tasks (such as writing standard Python or navigating operating systems) heavily represented in pretraining corpora, creating severe data contamination that obscures whether agents are synthesizing new concepts or retrieving memorized patterns. Researchers introduce Learn2Play-Bench (arXiv:2610.08215, code: github.com/liushiliushi/Learn2Play-Bench, site: liushiliushi.github.io/learn2play-bench-website), a novel open-source benchmark constructed around text-based environments with entirely unfamiliar and counterintuitive mechanics. Agents must discover game physics and causal dependencies purely through trial-and-error interactions. The benchmark reveals two critical insights: retaining uncompressed, verbatim interaction logs decisively outperforms LLM-generated rule summaries, and the agent harness scaffolding (managing tool loops, memory, and reflection) exerts a larger impact on final performance than the choice of underlying foundation model.

Learn2Play-Bench: New Benchmark Evaluates How LLM Agents Truly Learn from Interaction in Counterintuitive Worlds

Key Takeaways

  • Learn2Play-Bench open-sourced, establishing counterintuitive rule environments to isolate genuine agent in-context learning from memory
  • Empirical evaluations prove retaining full verbatim logs decisively beats model-generated rule summaries for rule discovery
  • Scaffolding harness architecture impacts exploration success more than foundation model scale, highlighting system-level importance
Read full story

REMORY: HKUST and Alibaba Introduce Residual Memory for Agent Context Compaction, Matching Full Context with Only 5.2% Token Overhead

As autonomous agents execute complex multi-step workflows across terminal consoles and web browsers, context window expansion and escalating token costs impose severe operational bottlenecks. Conventional compaction methods rely on text summarization or token pruning, both of which discard crucial state variables and induce semantic drift over extended sessions. Researchers from HKUST and Alibaba present REMORY (arXiv:2610.11287), introducing a residual memory paradigm designed for sequence-level context compaction. REMORY combines lossy natural language summaries with bounded sets of learned soft memory tokens, effectively forming a residual connection in the sequence dimension. While text summaries convey high-level narrative continuity, the soft memory tokens reconstruct lost fine-grained execution artifacts, API arguments, and intermediate environment states. On challenging benchmarks including BrowseComp and Terminal-Bench 2.1, REMORY retains 97% of full-context task performance while occupying only 5.2% of the original input token footprint, slashing redundant tool retries and loops by more than 40%.

Key Takeaways

  • HKUST and Alibaba propose REMORY, establishing sequence-dimension residual memory connections to resolve agent context bloat
  • Matches 97.2% of full-context capability using only 5.2% of token positions, slashing repetitive tool errors by 41.5% on Terminal-Bench
  • Non-invasive plug-and-play architecture reduces TTFT latency by 73.8%, setting a new benchmark for long-horizon agent efficiency
Read full story
Linked Models & Agents:

Self-Generated Feedback Destabilizes Test-Time Training: Causal Analysis and the Settlement Verification Protocol

Test-Time Training (TTT) enables language models to internalize streaming context directly into neural parameters during inference, emerging as a foundational architecture to transcend fixed context window bottlenecks. However, when autonomous agents learn continually from their own self-generated outputs, catastrophic representation degradation inevitably manifests over long deployment streams. Researchers from KAUST present a causal decomposition of this failure in arXiv:2610.05076. Across 128K-token sequences across three native TTT-E2E configurations (125M, 760M, 3B) as well as gradient-adapted Qwen3-4B models, updating weights on self-generated text severely degrades predictive capability on real human-written text. Three causal matching experiments pinpoint the culprit: a fundamental local alignment conflict where self-updates overfit idiosyncratic model outputs while actively corrupting real-world text distributions. To safeguard continual adaptation, the authors propose Settlement, an evidence-grounded verification protocol that assesses prospective parameter updates on independent real-world tokens prior to permanent weight commitment, eliminating over 98% of collapse damage.

Key Takeaways

  • KAUST presents a causal decomposition of test-time training (TTT) failure under self-generated feedback across 128K-token sequences
  • Demonstrates that updating weights on self-generated text improves self-fit while degrading general language modeling across diverse scales
  • Introduces Settlement, an evidence-grounded verification protocol eliminating >98% of collapse damage by validating updates on independent text
Read full story
Linked Models & Agents:
ADSponsored

WEFT: Whole-System Evolution for Tool-Use Post-Training Scales Agentic Interaction with MegaMCP State Isolation

Recent attempts to scale tool-use post-training for autonomous agents have focused primarily on synthesizing standalone execution environments. However, environments constitute merely one component of a holistic agentic interaction system comprising environments, tasks, harnesses, and evaluators; scaling environments in isolation yields inconsistent training signals. Researchers from Fudan University introduce WEFT (arXiv:2609.36887), a whole-system evolution framework for tool-use post-training. WEFT coordinates environment breadth, task complexity, and interaction diversity, applying execution-driven self-evolution to attribute failures and iteratively revise flawed components. To ensure optimization stability and concurrency reliability, WEFT introduces prefix-preserving sampling, atomic-turn credit assignment, and MegaMCP—a Model Context Protocol infrastructure providing isolated, recoverable state management across concurrent rollouts. WEFT-8B and WEFT-14B outperform matched environment-scaling baselines across BFCL V4, tau^2-Bench, and Claw-Eval, with WEFT-14B beating Agent-World-14B by 6.41, 2.23, and 12.27 percentage points, while WEFT-35B-A3B excels on long-horizon benchmarks like Toolathlon-Verified.

WEFT: Whole-System Evolution for Tool-Use Post-Training Scales Agentic Interaction with MegaMCP State Isolation

Key Takeaways

  • Pioneers WEFT, co-evolving environments, tasks, harnesses, and evaluators to overcome the limits of isolated environment synthesis
  • Integrates prefix-preserving sampling, atomic-turn credit assignment, and MegaMCP isolation for resilient tool-use post-training
  • WEFT-14B surges past Agent-World-14B by 6.41 pp on BFCL V4, 2.23 pp on tau^2-Bench, and 12.27 pp on Claw-Eval
Read full story
Linked Models & Agents:

Beyond Memory: PoS Maintains Explicit Belief States to Rescue Long-Horizon LLM Agents from Belief Trapping

As autonomous agents execute increasingly long-horizon workflows, traditional strategies relying on raw message history or lossy memory compression fail to provide coherent comprehension of evolving environment states. Agents frequently succumb to 'Belief Trapping'—iteratively generating uncoordinated tool calls without moving toward the goal. Researchers from Tsinghua University and Nankai University introduce PoS (Possibility-of-State), an inference-time framework that constructs and dynamically maintains explicit belief states. Coupling current world-state estimates with unresolved task requirements, PoS continuously verifies belief consistency, detects belief traps in real time, and triggers targeted recovery protocols. Across four execution and system diagnosis benchmarks on three frontier LLM backbones, PoS achieves top performance with robust resilience against context explosion.

Beyond Memory: PoS Maintains Explicit Belief States to Rescue Long-Horizon LLM Agents from Belief Trapping

Key Takeaways

  • Pioneers PoS to maintain explicit belief states coupling world-state estimates with unresolved requirements during inference
  • Introduces real-time detection and targeted recovery for 'Belief Trapping', preventing multi-turn loops
  • Secures top performance across four execution and diagnosis benchmarks across three foundation model backbones
Read full story

SkillGym Automates Skill-Use Agent Training: 6.8K Verifiable Sandboxes Enable Qwen3.5-9B to Outperform 397B Baselines

While procedural skills enhance autonomous agents on complex tasks, generating verifiable training environments and instilling robust skill-invocation behaviors remains an open challenge. SkillGym introduces an end-to-end automated pipeline that filters reproducible offline skills, synthesizes 6.8k verifiable environments via a Builder-Reviewer architecture, and collects 19k verified successful trajectories. SFT fine-tuning boosts the relevant skill-invocation rate from 28% to 96% and enables Qwen3.5-9B to outperform a 397B parameter base model across two demanding skill benchmarks.

SkillGym Automates Skill-Use Agent Training: 6.8K Verifiable Sandboxes Enable Qwen3.5-9B to Outperform 397B Baselines

Key Takeaways

  • Synthesizes 6.8k verifiable sandboxes and 19k verified trajectories, driving skill reading rates from 28% to 96%
  • Enables fine-tuned Qwen3.5-9B to outperform an untrained 397B base model on two demanding skill benchmarks
  • Demonstrates robust out-of-distribution generalization across entirely held-out skill repositories
Read full story
Linked Models & Agents:

TimeEvo: Failure-Driven Self-Evolution of Time Series Agents Outperforms Human-Curated Toolkits

Researchers from UIC exposed two structural flaws in autonomous agents reliant on human-curated toolkits: expert-selected tools frequently degrade anomaly detection across all backbones, while unguided self-revision silently breaks 38% of previously correct responses. They introduce TimeEvo, an architecture that clusters runtime failures into capability gaps, synthesizes evidence-only Python tools to address them, and admits candidate tools via paired verification gates. Starting from an empty toolkit, TimeEvo achieves consistent accuracy gains across all ten benchmarks.

TimeEvo: Failure-Driven Self-Evolution of Time Series Agents Outperforms Human-Curated Toolkits

Key Takeaways

  • Exposing Tool Misalignment & Silent Harm: Demonstrates that static expert toolsets paradoxically degrade anomaly accuracy across all LLM backbones, while generic self-revision silently degrades 38% of previously correct answers.
  • Failure-Driven Evolution Pipeline: Systematically clusters execution failures into capability gaps, synthesizes dedicated Python evidence tools, and validates candidates through paired admission gates.
  • Zero-Bootstrap Superiority & Cross-Model Transfer: Starting from a completely empty library, TimeEvo boosts performance across ten benchmarks and three backbones; tools evolved on cheap models reliably transfer gains to frontier foundation models.
Read full story
Linked Models & Agents:

Microsoft Proposes CASD: Coding Agents as Prompt Optimizers, Slashing Costs by 22x to $1.60 Without Online Rollouts

Researchers from Microsoft Research introduced Coding-Agent Skill Distillation (CASD, arXiv:2609.26261), fundamentally rethinking prompt optimization for autonomous agents. Traditional search-based optimizers (like GEPA) iteratively propose prompt variants, execute fresh rollouts in simulation environments, and evaluate validation scores—costing dozens of dollars per task. CASD eliminates this iterative loop entirely. Given only a static corpus of past agent trajectories, an off-the-shelf coding agent writes and runs code to compute corpus-wide error distributions, inspects key failure modes, and synthesizes behavioral rules into the prompt. Across four rigorous benchmarks (ALFWorld, tau2-bench retail/telecom, SpreadsheetBench), a single CASD pass outperforms GEPA and SkillOpt, raising baseline accuracy by 16.6 percentage points for only $1.60—over 22x cheaper than validation-gated search.

Microsoft Proposes CASD: Coding Agents as Prompt Optimizers, Slashing Costs by 22x to $1.60 Without Online Rollouts

Key Takeaways

  • Zero online environment rollouts: optimizes complex agent prompts entirely from static trajectory corpora without sandbox interaction
  • Over 22x cheaper at $1.60: slashes prompt optimization costs from ~$35 down to $1.60 per run compared to validation-gated search
  • Outperforms state-of-the-art: lifts baseline performance by 16.6 percentage points across four benchmarks, surpassing GEPA (+10.9%) and SkillOpt (+5.3%)
  • Corpus-wide code reflection: agents author and execute statistical analysis scripts to identify systematic failure modes rather than localized batches
  • Multi-domain validation: demonstrates consistent empirical gains across embodied tasks (ALFWorld), service workflows (tau2), and tabular reasoning
Read full story