AI Coding Live News

Reflection Publishes 156-Page Beam Technical Report: 23.8T-Token Pretraining, 4-Week Async RL on 10.5K GB300s, NVFP4 Keeps ~99% of Scores

On 2026-11-06 Reflection's official account released the Beam model technical report (a 156-page PDF), detailing how its 501.3B-total / 23.4B-active open-weight MoE was trained: 23.8T pretraining tokens on 6,144 GB300 GPUs in under four weeks, then a fully asynchronous RL run on about 10.5K GB300s for four weeks that produced over 100M rollouts. The report says FP8 and NVFP4 checkpoints keep 99.93% and 98.98% of median benchmark scores, and the 1.93B DFlash 2 drafter speeds single-request decoding 1.96–3.03x (vendor figures).

Reflection Publishes 156-Page Beam Technical Report: 23.8T-Token Pretraining, 4-Week Async RL on 10.5K GB300s, NVFP4 Keeps ~99% of Scores

Key Takeaways

  • Scale: 501.3B total / 23.4B active, 52 layers, 256 experts per layer with 8 active per token, 151,936-token vocabulary
  • Pretraining: 23.8T tokens on 6,144 GB300s in under four weeks, 92.3% goodput late in the run and 21% steady-state MFU
  • RL: about 10.5K GB300s for four weeks, 100M+ rollouts, 110K concurrent rollouts and 12-second weight updates; the report sees no plateau as RL compute grows
  • Serving: FP8 / NVFP4 keep 99.93% / 98.98% of median scores; DFlash 2 speeds single-request decoding 1.96-3.03x
  • Safety: 88.9% refuse/pivot on harmful requests and 81.5% compliance on harmless ones in in-house ISE; Limited in all four systemic-risk categories
Read full story
Linked Models & Agents:

UMD & Google Introduce BeliefWeaver: Implicit World Models for Multi-Step Failure Recovery, Slashing 9B Agent Costs by 54.8%

Researchers from the University of Maryland, Google, and MBZUAI introduced BeliefWeaver (arXiv:2610.18082), an autonomous failure-recovery framework for long-horizon agents. Addressing cases where failures stem from root errors multiple steps earlier that local reflection cannot fix, BeliefWeaver maintains a persistent relational belief state across checkpoints and attempts, using an Implicit World Model (IWM) to evaluate hypotheses and gate repair execution. When distilled into a 9B model via on-policy distillation, it improves final benchmark scores by 9.8 percentage points while slashing teacher API costs by 54.8%.

UMD & Google Introduce BeliefWeaver: Implicit World Models for Multi-Step Failure Recovery, Slashing 9B Agent Costs by 54.8%

Key Takeaways

  • UMD, Google, and MBZUAI introduced BeliefWeaver (arXiv:2610.18082), an autonomous multi-step failure recovery framework for long-horizon agents
  • Maintains a persistent relational belief graph across attempts and employs an Implicit World Model (IWM) to gate repair execution
  • Improves terminal benchmark scores by +5.1 points; an on-policy distilled 9B student model beats baseline by +9.8 points
  • Slashes estimated teacher API costs by 54.8%, offering a highly economical blueprint for production-grade self-healing agents
Read full story
Linked Models & Agents:

Arena Alignment Index Updates Across 90K+ Real Agent Sessions: Meta Muse Wonder (77.5%), Reflection Beam-1.0 (75.3%), and StepFun Step 5 Preview (75.1%) Debut

Arena released an update to the Arena Alignment Index built from 90,000+ real-world agent sessions: Meta's Muse Wonder (Max) ranks #6 by lab at 77.5% (2.09% unauthorized action rate, 14.41% deceptive completion rate), Reflection AI's open-weight Beam-1.0-501B-A23B debuts at #7 with 75.3% (4.50% false attribution rate), and StepFun's open-weight Step 5 Preview lands at #8 with 75.1% (2.11% unauthorized action rate).

Arena Alignment Index Updates Across 90K+ Real Agent Sessions: Meta Muse Wonder (77.5%), Reflection Beam-1.0 (75.3%), and StepFun Step 5 Preview (75.1%) Debut

Key Takeaways

  • Built from 90,000+ real-world agent sessions, the Arena Alignment Index evaluates Unauthorized Action (UA), False Attribution (FA), and Deceptive Completion (DC)
  • Meta's Muse Wonder (Max) ranks #6 by lab at 77.5%, posting the lowest unauthorized action rate (2.09%) and deceptive completion rate (14.41%) of the new cohort
  • Reflection AI's Beam-1.0-501B-A23B (#1 US open model on Agent Arena) debuts at #7 with 75.3% and leads the newcomers with a 4.50% false attribution rate
  • StepFun's open-weight Step 5 Preview (600B-A27B) lands at #8 with 75.1% and a 2.11% unauthorized action rate, nearly matching Muse Wonder
Read full story
Linked Models & Agents:

Google AI Studio Opens Gemini 4 Argon in Build & Playground for Pro Users; Transformers v5.20.1 Adds Native Reflection AI Beam and Meta 816B Muse Spark Open

Google AI Studio launched Gemini 4 Argon access in AI Studio Build and Playground for Google AI Pro subscribers, while Hugging Face Transformers v5.20.0 and v5.20.1 added native support for Reflection AI's frontier coding model Beam, Meta's 816B-parameter (42B active, 1M context) multimodal agentic coding model Muse Spark Open, InclusionAI's Ling 3.0 Flash, and OpenBMB's MiniCPM-V 4.7.

Google AI Studio Opens Gemini 4 Argon in Build & Playground for Pro Users; Transformers v5.20.1 Adds Native Reflection AI Beam and Meta 816B Muse Spark Open

Key Takeaways

  • Google AI Studio opens Gemini 4 Argon in AI Studio Build and Playground (https://ai.studio/build) for Google AI Pro subscribers
  • Hugging Face Transformers v5.20.1 natively integrates Reflection AI's token-efficient coding model Beam and fixes DeepGEMM Mega MoE under expert parallelism
  • Adds native support for Meta's 816B-parameter (42B active, 1M context, BF16/NVFP4) omni-modal coding model Muse Spark Open and InclusionAI's KDA+MLA hybrid Ling 3.0 Flash
Read full story
Linked Models & Agents:
ADSponsored

OpenCode Makes GLM 5.3 Flash and 1M-Context Reflection Beam Free in Its Open-Source Coding Agent, Drawing 1.92M+ Views

OpenCode (@opencode), the wildly popular open-source terminal coding agent, announced free access to both Zhipu AI's high-speed GLM 5.3 Flash and Reflection AI's newly released 501B/23B MoE model Beam with a full 1M-token context window. The GLM 5.3 Flash announcement alone surged past 1.92 million views and 17,500 likes on X within hours.

OpenCode Makes GLM 5.3 Flash and 1M-Context Reflection Beam Free in Its Open-Source Coding Agent, Drawing 1.92M+ Views

Key Takeaways

  • Viral 1.92M-view developer launch: OpenCode's free GLM 5.3 Flash rollout drew 1.92M+ views and 17.5K likes on X
  • 1M-context Reflection Beam added for free: integrates the 501B/23B MoE model (80.1% on Terminal-Bench 2.1) with a full 1M-token context window
  • Zero-cost dual coding workflow: pairs ultra-fast GLM 5.3 Flash tool loops with 1M-context whole-repo reasoning inside the open-source OpenCode CLI
Read full story

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

Can AI Agents Make Open-Ended Scientific Discovery? Station Multi-Agent Ecosystem Rediscovers 62.7% of ICLR Oral Breakthroughs

While AI systems have driven remarkable progress on narrowly scoped scientific problems with well-defined metrics, whether autonomous AI agents can undertake genuine open-ended scientific discovery has remained unproven. Researchers present Station (arXiv:2610.08927), an open-world multi-agent environment simulating a collaborative scientific research ecosystem. To overcome systemic drift during open-ended exploration without intermediate ground-truth metrics, Station introduces two mechanisms: an iterative Supervisor hierarchy and periodic Meta Reflection to enforce persistent inquiry. The framework was evaluated against open-ended research tasks formulated from three recent ICLR oral presentations, where agents received solely the primary research inquiry while withholding original experimental conclusions and disabling internet access. Station autonomously rediscovers an average of 62.7% of the original scientific criteria, compared to just 15.4% for Codex Multiagent-v2 and 14.4% to 20.6% for AI Scientist-v2. In open-ended tasks without oracle answers, the ecosystem produced verified scientific findings matching discoveries independently published by human researchers after the models' knowledge cutoff dates.

Key Takeaways

  • Station simulates collaborative scientific ecosystems, demonstrating autonomous open-ended discovery without external search
  • Rediscovers 62.7% of original findings from ICLR oral papers, decisively outperforming AI Scientist-v2 (14.4%-20.6%)
  • Introduces supervisory steering and periodic meta-reflection, successfully forecasting empirical discoveries published after model training cutoffs
Read full story

Memento 3: UCL and Huawei Noah's Ark Enable Recursive Self-Improvement for Frozen LLMs via Reflective Rulebooks, Clearing ARC-AGI-3

Endowing artificial agents with general intelligence requires inferring environment dynamics and refining world models continuously in the wild. Fine-tuning models directly is prohibitively expensive and precipitates catastrophic forgetting. Researchers from University College London (UCL) and Huawei Noah's Ark Lab UK present Memento 3 (arXiv:2610.11794), a framework enabling frozen LLM agents to achieve model-based Recursive Self-Improvement (RSI) purely via external memory. The agent maintains a natural-language rulebook representing its evolving hypotheses of environment physics, which is compiled into executable code for fast simulation and action planning. Governed by a continuous observation-reflection-revision-compilation-verification loop, the system leverages prediction errors to refine rules. Edits are merged only after passing LLM semantic alignment audits and deterministic cell-exact replay verification. On the rigorous ARC-AGI-3 abstraction benchmark, Memento 3 solves 100% of levels across all 25 public environments, scoring a perfect 100.0 Relative Human Action Efficiency (RHAE) while utilizing only 44% of human action counts. In Atari Pong, a synthesized feedback controller shuts out opponents 21:0 across three evaluation seeds with zero test-time LLM inference.

Key Takeaways

  • UCL and Huawei Noah's Ark introduce Memento 3, unlocking model-based Recursive Self-Improvement for frozen LLMs via executable rulebooks
  • Compiles natural-language physics hypotheses into code world models validated through cell-exact replay verification
  • Clears all 25 games on ARC-AGI-3 using only 44% of human actions, and delivers 21:0 Pong shutouts with zero runtime LLM calls
Read full story

EVISKILL: Grounding Skill Evolution in Replayable Evidence Enables Continual Procedural Capability Accumulation Without Weight Updates

Continual skill evolution allows LLM agents to autonomously accumulate, refine, and reuse procedural knowledge across multi-turn interactions without updating model parameters. However, prevailing experience-driven reflection mechanisms suffer from two fundamental weaknesses: they decouple synthesized guidance from concrete behavioral traces, and they rely on monolithic global validation that blindly discards valid local corrections whenever an entire workflow fails. Researchers from Tsinghua University and partner institutions introduce EVISKILL (arXiv:2610.05030), an evidence-grounded framework anchoring procedural adaptation to deterministic execution traces. EVISKILL structures raw observations into Replayable Evidence Cards and synthesizes skill edits with explicit contextual lineage. A targeted replay engine verifies edits through isolated re-execution before cross-epoch refinement. Across three interactive benchmarks spanning six LLM backbones, EVISKILL consistently outperforms state-of-the-art reflective baselines, demonstrating durable procedural accumulation.

Key Takeaways

  • Tsinghua University introduces EVISKILL, anchoring continual procedural skill evolution in Replayable Evidence Cards without parameter updates
  • Decouples local edit verification from monolithic global validation, achieving a 3x increase in the retention of valid localized skills
  • Validated across 3 interactive benchmarks and 6 foundation LLMs, consistently outperforming standard reflection architectures
Read full story
Linked Models & Agents:

MemAdapter: Counterfactual Adaptation Against Memory-Induced Sycophancy in Long-Term Memory LLM Agents

Persistent long-term memory empowers LLM-based agents to maintain personal preferences and contextual continuity across extensive multi-session interactions. However, accumulated memories frequently induce 'Memory-Induced Sycophancy'—compelling agents to slavishly conform to a user's historical misconceptions, obsolete beliefs, or flawed arguments at the expense of objective truth. Prior mitigation efforts operate under the premise that sycophancy stems exclusively from polluted or biased memories, attempting heuristic filtering at storage or retrieval stages. In reality, completely objective and valid memories can still trigger sycophancy when inappropriately prioritized across shifting conversational contexts. To overcome this systemic vulnerability, researchers from Jilin University and collaborators present MemAdapter (arXiv:2610.05162). MemAdapter adaptively modulates retrieved memory influence across three decoupled components: Counterfactual Induction, Context-Aware Reflection, and Evidence-Based Reasoning. Open-sourced on GitHub (DEEP-JLU/MemAdapter), the framework systematically restores objective grounding across three major sycophancy benchmarks while preserving benign personalization.

Key Takeaways

  • Exposes memory-induced sycophancy in LLM agents and introduces MemAdapter for counterfactual memory calibration
  • Decouples counterfactual induction, context-aware reflection, and evidence-based reasoning to segregate facts from subjective preferences
  • Reduces sycophantic alignment rates by 45%-60% across three benchmarks while preserving over 98% benign personalization integrity
Read full story
ADSponsored

ASCENT: Online Test-Time Training (OaTTT) for Long-Horizon Agents Enables Self-Evolution via Verified Experience Distillation

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.

ASCENT: Online Test-Time Training (OaTTT) for Long-Horizon Agents Enables Self-Evolution via Verified Experience Distillation

Key Takeaways

  • Formalizes Online Agentic Test-Time Training (OaTTT) and introduces ASCENT for teacher-free continual self-evolution
  • Leverages a frozen initial model snapshot for privileged hindsight distillation, consolidating pruned traces into persistent LoRAs
  • Demonstrates monotonic task success gains across ALFWorld, WebShop, and AppWorld with robust transfer to held-out environments
Read full story
H
Hugging Face / Reflectionhuggingface.co·
👀317
🔥98

Reflection Beam weights are live: 501B/23B MoE under Apache 2.0, BF16/FP8/NVFP4 on Hugging Face, 80.1% Terminal-Bench 2.1

On 2026-10-16 Hugging Face and Reflection confirmed Beam weights are downloadable: ~501B-total / ~23B-active sparse MoE, 1M context, Apache 2.0. BF16/FP8/NVFP4 checkpoints ship with day-0 transformers≥5.20.1, vLLM and SGLang. Model-card figures (vendor): SWE-bench Verified 81.6% (BF16), Terminal-Bench 2.1 80.1%, MCP Atlas 80.8%. This closes the Oct 5 promise to release weights later that month.

Reflection Beam weights are live: 501B/23B MoE under Apache 2.0, BF16/FP8/NVFP4 on Hugging Face, 80.1% Terminal-Bench 2.1

Key Takeaways

  • Weights live: reflection/Beam-1.0-501B-A23B plus FP8/NVFP4; Apache 2.0 (HF blog)
  • Scale: ~501B total / 23B active; 52 layers (3 dense + 49 MoE), 256 experts, top-8; hybrid sliding-window + global attention; 1M context
  • Coding/terminal (model card BF16, temp=0.7): SWE-bench Verified 81.6%; Terminal-Bench 2.1 80.1%; DeepSWE v1.1 43.3%; MCP Atlas 80.8% (vendor-reported)
  • Efficiency: Reflection claims ~3× fewer inference reasoning tokens vs leading open peers; effort low–max with preserve_thinking
  • Deploy: vLLM/SGLang recipes with DFlash2; BF16 ~1TB, NVFP4 ~280GB; plan ≥4×B200; try HF Inference Providers (Baseten/Fireworks/Together)
Read full story
Linked Models & Agents:

AREX-2 Advances Self-Improving Agents via Long-Horizon Reflective Tasks: Scoring 81.8 on MLE-bench and 92.2 on GAIA

Test-time self-improvement—the ability of an agent to iteratively refine solutions during inference—relies on high-fidelity reflection to surpass current proposals and long-horizon execution to maintain coherent multi-round exploration. Researchers from Renmin University of China, Microsoft Research, and USTC introduce AREX-2, establishing that these capabilities are domain-agnostic and learnable from verifiable environments. Synthesizing long-horizon reflective trajectories across machine learning and algorithmic programming, an AREX-2 agent built on Qwen3.8-27B achieves 81.8 on MLE-bench Lite and 70.7 on Frontier-CS, transferring seamlessly to deep research with 84.0 on BrowseComp, 92.2 on GAIA, and 93.8 on DeepSearchQA while monotonically scaling with compute budget.

AREX-2 Advances Self-Improving Agents via Long-Horizon Reflective Tasks: Scoring 81.8 on MLE-bench and 92.2 on GAIA

Key Takeaways

  • Identifies reflection and long-horizon execution as domain-agnostic foundations for test-time self-improving agents
  • Achieves 81.8 on MLE-bench Lite and 70.7 on Frontier-CS using an AREX-2 Qwen3.8-27B model
  • Transfers zero-shot to deep research benchmarks, scoring 92.2 on GAIA, 93.8 on DeepSearchQA, and 84.0 on BrowseComp
Read full story

AREX-2 Advances Test-Time Self-Improving Agents via Long-Horizon Reflective Programming: 81.8 on MLE-bench

Endowing LLM agents with test-time self-improvement—the ability to iteratively refine solutions—is a vital milestone for autonomous engineering. Researchers from Renmin University and collaborators present AREX-2, an open-source framework leveraging long-horizon reflective trajectories. Decoupling self-improvement into reflection (generating superior alternatives) and long-horizon execution (sustaining iteration over multiple turns), AREX-2 trains on verified machine learning and algorithmic programming trajectories. Built on Qwen3.8-27B, AREX-2 achieves 81.8 on MLE-bench Lite and 70.7 on Frontier-CS, transferring effectively to deep research with 92.2 on GAIA and 93.8 on DeepSearchQA.

AREX-2 Advances Test-Time Self-Improving Agents via Long-Horizon Reflective Programming: 81.8 on MLE-bench

Key Takeaways

  • Decouples test-time self-improvement into domain-agnostic reflection and long-horizon execution
  • Achieves 81.8 on MLE-bench Lite and 70.7 on Frontier-CS with Qwen3.8-27B, transferring to 92.2 on GAIA
  • Breaks multi-turn degradation bottlenecks, showing monotonic score improvements as iteration budgets increase
Read full story

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