AI Coding Live News

SolarRenderer Breaks Generative Video: 4-Step Denoising on Greyboxes and Depths for Real-Time 768p World Synthesis

Researchers from NUS and CUHKSZ have introduced SolarRenderer (arXiv:2610.28630), a structure-conditioned generative reference rendering framework. Converting game engine grey-boxes, pose skeletons, semantic maps, and depth passes into photorealistic video, SolarRenderer adapts a frozen MiniMax-H3 33B backbone via lightweight control and 4-step generation LoRAs. Using structure-guided distribution matching, it renders stylized video in just 4 denoising steps (~12.3x faster than 50-step diffusion) and introduces a block-causal variant for real-time 768p streaming synthesis in generative game engines.

SolarRenderer Breaks Generative Video: 4-Step Denoising on Greyboxes and Depths for Real-Time 768p World Synthesis

Key Takeaways

  • SolarRenderer (arXiv:2610.28630) enables high-fidelity video rendering directly from coarse 3D geometry (grey-boxes, skeletons, depth, meshes)
  • Adapts a frozen MiniMax-H3 33B backbone with lightweight Control and 4-step LoRA modules, preserving visual priors
  • Requires only 4 denoising steps via structure-guided distribution matching, achieving a 12.3x acceleration over 50-step baselines
  • Block-causal streaming variant achieves real-time continuous 768p video generation for next-generation generative gaming engines
Read full story
Linked Models & Agents:
⚡ MiniMax-H3⚡ SolarRenderer

Shanghai AI Lab Releases Sage-A1.5: A 35B MoE Agentic Model Advancing Long-Horizon Software and Scientific Discovery

The Shanghai Artificial Intelligence Laboratory published the technical report for Sage-A1.5 on arXiv:2610.28578, introducing an open-weights 35B Mixture-of-Experts (MoE) foundation model purpose-built for agentic tasks. Building on the Agents-A1 lineage, Sage-A1.5 focuses on scaling the agent execution horizon rather than model parameters through adaptive capability composition. Tailored for complex repository-level software engineering and multi-step scientific hypothesis exploration, Sage-A1.5 consistently outperforms dense 70B+ baselines on long-horizon reasoning benchmarks while maintaining lightweight deployment footprints.

Shanghai AI Lab Releases Sage-A1.5: A 35B MoE Agentic Model Advancing Long-Horizon Software and Scientific Discovery

Key Takeaways

  • Shanghai AI Lab published Sage-A1.5 (arXiv:2610.28578), open-sourcing a 35B MoE agentic foundation model
  • Pioneers horizon scaling over raw parameter expansion, sustaining consistent focus across 100+ execution steps
  • Optimized for repository-level software engineering bug fixes, matching dense 70B+ baselines on complex git issue resolution
  • Features intrinsic scientific exploration and hypothesis generation capabilities, tailored for local on-prem cluster deployment
Read full story
Linked Models & Agents:

NVIDIA open-sources Flora, the robotics data engine behind GR00T: three models that caption and score robot video at roughly 1/125 the cost of GPT-6 Astra

On Oct 20, NVIDIA's GEAR lab (Jim Fan's team) open-sourced Flora, a model suite that turns human and robot manipulation video into timestamped action captions, process rewards, outcome rewards and rubric scores. It includes Flora-Captioner 27B and Flora-Rewarder 27B (both on Qwen3.5-27B) and Flora-TempSeg 9B (a LoRA on Qwen3.5-9B), with weights on Hugging Face under an NVIDIA non-commercial license. NVIDIA says it is the in-house data engine used to train GR00T, labeling 200,000 hours of video a day on 512 GB300s, matching GPT-6 Astra on annotation quality at roughly 125x lower cost.

NVIDIA open-sources Flora, the robotics data engine behind GR00T: three models that caption and score robot video at roughly 1/125 the cost of GPT-6 Astra

Key Takeaways

  • Three models: TempSeg 9B segments actions, Captioner 27B writes one instruction per segment, and Rewarder 27B outputs dense process rewards and an episode success score
  • Cost (NVIDIA estimate): about $0.72 per hour of source video on eight GB300s at $10 per GPU-hour, versus about $88.49 for GPT-6 Astra at maximum effort, a 122-125x gap
  • Quality (NVIDIA 50-episode internal eval): 57.1% for Flora versus 53.7% for GPT-6 Astra; failure recall on DenseRewardBench is 53.3% while frontier API models mostly score under 1%
  • Scale: NVIDIA says Flora labels 200,000 hours of video a day on 512 GB300s to train GR00T-2
  • License: NVIDIA OneWay Noncommercial, research only, with commercial and production use explicitly unsupported
Read full story
Linked Models & Agents:
⚡ Flora-Captioner 27B⚡ Flora-Rewarder 27B⚡ Flora-TempSeg 9B⚡ Qwen3.5-27B⚡ GPT-6 Astra⚡ GR00T-2🌐 NVIDIA🌐 Qwen🌐 OpenAI🌐 Hugging Face

UCSD Unveils ACT3D: Active Exploration in 3D Space via Monocular VLM Interaction, Outperforming Gemini 3.6 Flash

Researchers from UC San Diego and Georgia Tech introduced ACT3D (arXiv:2610.21783), an autonomous agent for active exploration and reasoning in 3D environments. Rather than relying on heavy multi-view image suites, video streams, or 3D point cloud encoders, ACT3D preserves native monocular VLM encoding (processing a single first-person frame at a time like humans) while treating 3D space as an interactive environment. Optimized via outcome-driven RL without trajectory supervision, ACT3D achieves 53.2% average accuracy across six 3D benchmarks (+22.0% over base Qwen), outperforming proprietary Gemini 3.6 Flash while using 50%-70% fewer input frames.

UCSD Unveils ACT3D: Active Exploration in 3D Space via Monocular VLM Interaction, Outperforming Gemini 3.6 Flash

Key Takeaways

  • UC San Diego and Georgia Tech released ACT3D (arXiv:2610.21783), an active exploration VLM operating on single monocular first-person frames
  • Optimized through outcome-driven reinforcement learning, discovering question-conditioned navigation policies without trajectory supervision
  • Achieves 53.2% accuracy across six 3D benchmarks (+22.0% over base Qwen), beating Gemini 3.6 Flash while using 50%-70% fewer frames
  • Boosts accuracy on heavily occluded queries by 16.3% and gains +5.9% on unseen environments, proving monocular active exploration viability
Read full story
Linked Models & Agents:
ADSponsored

ETH Zurich and HKU Resolve MoE Routing Exploration Dilemma with MirrorMoE: Adaptive Suppression Counteracts Shared Expert Homogenization

Modern Mixture-of-Experts architectures increasingly combine fine-grained expert segmentation with shared experts. However, ETH Zurich and HKU researchers identified an 'Exploration Dilemma' (arXiv:2610.22353, GitHub: BingcongLi/MirrorMoE): shared experts homogenize token representations, suppressing routing exploration just as fine-grained segmentation combinatorially enlarges the routing space. MirrorMoE resolves this via token-adaptive suppression of unnecessary experts, cutting pretraining perplexity across all model scales.

ETH Zurich and HKU Resolve MoE Routing Exploration Dilemma with MirrorMoE: Adaptive Suppression Counteracts Shared Expert Homogenization

Key Takeaways

  • ETH Zurich and HKU introduced MirrorMoE (arXiv:2610.22353) to solve the exploration dilemma between shared experts and fine-grained routing
  • Employs token-adaptive expert suppression to shrink the combinatorial routing space without adding runtime latency
  • Consistently reduces pretraining perplexity across scales from 100M to 2.4B (slashing 2.4B PPL from 21.17 to 20.50)
  • Lifts downstream benchmark averages by +1.64 points on the 2.4B model, highlighted by a +4.03 pt boost on BoolQ (58.53% vs 54.50%)
Read full story
Linked Models & Agents:

Rule-Governed World Modeling Breakthroughs: OmniVerifier-C1 Graded Verifier, Meituan's WorldCast (72.8 vs 20.1 Open-Source Gap), and NUS's 4x Faster RPO Diffusion RL

Three new studies tackle verification, evaluation, and RL alignment for rule-governed generative world models: OmniVerifier-C1 (arXiv:2610.22355, 32 upvotes) uses Decoupled RL to train a decomposed graded visual verifier that reaches 0.684 on ViVerBench and boosts FLUX.1-dev GenEval from 0.68 to 0.79 while enabling Maze and Sudoku world modeling; Meituan's WorldCast benchmark (arXiv:2610.20731, 30 upvotes) evaluates 12 models across 320 multi-step world state prediction cases, finding GPT-Image-2.5 System at 72.8 vs. 42.8 for Nano Banana Pro and 20.1 for the top open model; and NUS's Routing Policy Optimization (RPO, arXiv:2610.22282, 23 upvotes) turns attention routing into an internal exploration action to train video/image diffusion RL 3.1x–4.2x faster than Flow-GRPO and DanceGRPO.

Rule-Governed World Modeling Breakthroughs: OmniVerifier-C1 Graded Verifier, Meituan's WorldCast (72.8 vs 20.1 Open-Source Gap), and NUS's 4x Faster RPO Diffusion RL

Key Takeaways

  • OmniVerifier-C1 uses Decoupled RL (DAPO) to jointly optimize sub-question binary judgments and global continuous scoring, reaching 0.684 on ViVerBench and boosting FLUX.1-dev GenEval from 0.68 to 0.79
  • Meituan's 320-case WorldCast benchmark reveals a massive gap in multi-step visual state prediction: GPT-Image-2.5 System scores 72.8 vs. 42.8 for Nano Banana Pro and 20.1 for the best open-source model
  • NUS's Routing Policy Optimization (RPO) uses internal attention routing exploration to align Wan2.2-TI2V-5B in just 24.1 GPU-hours—3.1x faster than Flow-GRPO and 4.2x faster than DanceGRPO
Read full story
Linked Models & Agents:

Breaking GRPO Exploration Collapse: SERO Executable Oracle Continuations (+11.2 pts on ALFWorld OOD) and EDEN Anchored Embedding Noise (+13.3 pts on AIME 2025)

Addressing rollout homogenization and zero-variance advantage collapse in group-relative reinforcement learning (GRPO), SERO (arXiv:2610.19397) restores learner-visited states to execute multi-step oracle continuations with policy-reachability weighting—boosting 7B ALFWorld OOD success by +11.20 points to 87.50%—while UNSW's EDEN (arXiv:2610.16105) appends a single anchored Gaussian-perturbed embedding position to a fraction of rollouts, lifting Qwen2.5-Math-7B AIME 2025 Pass@256 by +13.33 points (to 66.67%) without increasing rollout budgets.

Breaking GRPO Exploration Collapse: SERO Executable Oracle Continuations (+11.2 pts on ALFWorld OOD) and EDEN Anchored Embedding Noise (+13.3 pts on AIME 2025)

Key Takeaways

  • SERO restores learner-visited states and executes multi-step oracle continuations with policy-reachability weighting, boosting 7B ALFWorld unseen success by +11.20 points to 87.50% (95.57% seen)
  • UNSW's EDEN appends a single anchored Gaussian-perturbed embedding position to a fraction of rollouts, beating G=32 standard GRPO using only G=16 rollouts
  • On AIME 2025, EDEN lifts Qwen2.5-Math-7B Pass@256 by +13.33 percentage points (from 53.33% to 66.67%) while preserving diverse multi-derivation reasoning traces
Read full story
Linked Models & Agents:

GUI-Decisions open-sourced: slot-reading replaces coordinate JSON decoding for ~3× faster computer-use grounding (31B/2B)

On 2026-10-10 Logesh Kumar Umapathi published GUI-Decisions on Hugging Face: computer-use actions/coordinates are read from fixed next-token slots instead of autoregressive JSON. On an RTX PRO 6000 with vLLM, Gemma-4-31B slot reads median ~146–158 ms/step vs ~472–546 ms native JSON (~3.5×) and ~20–25× vs thinking decode. ScreenSpot click-in-element ~0.87. Open weights for 31B/2B, GitHub, and a Spaces demo.

GUI-Decisions open-sourced: slot-reading replaces coordinate JSON decoding for ~3× faster computer-use grounding (31B/2B)

Key Takeaways

  • Official: HF Blog (2026-10-10); code gui-decisions; Spaces demo
  • Latency (vendor, RTX PRO 6000, cold shots): slot read ~146 ms vs native JSON 472–546 ms (~3.5×); with thinking 2.6–3.1 s (~20–25×)
  • Quality: ScreenSpot click-in ~0.869; held-out AGUVIS steps ~0.65; RefCOCO val box IoU 0.770
  • Mechanism: 256-bin byte labels for coords; read only slots the action needs; type/answer still need base decode—slots speed grounding only
  • Serve: vllm serve infinitylogesh/GUI-Decisions-31B --max-logprobs 300 --api-server-count 8 then SlotModel.decide(...)
Read full story
Linked Models & Agents:
⚡ GUI-Decisions-31B⚡ GUI-Decisions-2B⚡ Gemma-4-31B🤖 computer-use🤖 GUI agent🌐 Hugging Face🌐 Google

TerminalHorizon Released: Automated Data Synthesis Engine for Long-Horizon Terminal Agents Powers 27B Model to 55.8% on Terminal-Bench 2.0

As autonomous software engineering agents and command-line assistants evolve from single-turn tool invocation toward complex, multi-stage delivery, the scarcity of high-quality, long-horizon terminal interaction data has emerged as a fundamental bottleneck. Researchers from USTC, Alibaba Group (AMAP), and SUSTech introduce TerminalHorizon (arXiv:2610.13166), a fully automated data synthesis engine for training long-horizon terminal agents. Addressing standard pitfalls where synthetic environments oversimplify core challenges and eliminate the need for exploration, TerminalHorizon extracts workflows from real-world tasks, pinpoints omitted steps through independent execution loops, dynamically reconstructs environments based on observed evidence, and organically scales task complexity across multiple stages under unified objectives. Synthesizing 1.5K environments and 2,852 trajectories averaging 52.8 turns, the authors train TerminalHorizon-27B (fine-tuned on Qwen3.5-27B). The model achieves 55.8% on Terminal-Bench 2.0 (+14.2 points over base Qwen3.5-27B), sweeping 12 benchmarks across coding agents, production environments, and reasoning with project datasets open-sourced.

TerminalHorizon Released: Automated Data Synthesis Engine for Long-Horizon Terminal Agents Powers 27B Model to 55.8% on Terminal-Bench 2.0

Key Takeaways

  • TerminalHorizon automated synthesis engine releases 1.5K environments and 2,852 trajectories averaging 52.8 interaction turns
  • TerminalHorizon-27B attains 55.8% on Terminal-Bench 2.0, delivering a 14.2-point leap over base Qwen3.5-27B
  • Outperforms massive synthetic datasets on 12 benchmarks covering coding agents, terminal operations, and multi-step reasoning
Read full story
Linked Models & Agents:

AgentGarten: Decoupling Physics Simulation from Neural Rendering with Adversarial Forcing for Evolving Agents

Interactive virtual environments allow embodied AI agents to learn through exploration and practice, but creating worlds that are simultaneously faithful (rigid state dynamics and programmatic rules) and realistic (photorealistic visual distributions) has remained a critical bottleneck: physics engines lack visual fidelity, whereas generative video models suffer from compounding visual hallucinations during extended agent interactions. MirroS Lab and researchers introduce AgentGarten (arXiv:2610.12374, repo: github.com/MirroS-Lab/AgentGarten, site: mirros-lab.github.io/agent-garten), an open-source framework that decouples physics simulation backends from a shared neural renderer. Simulators maintain ground-truth state and execute code-defined rules without ingesting rendered frames, strictly preventing error accumulation. Visual observations are synthesized in real-time (>30 FPS) from exported geometric conditions via a neural renderer trained with Adversarial Forcing, making history prefilling differentiable through exact replay. Agents learn through visual perception, distilling execution trajectories into playbooks that succeeding generations inherit. In benchmarks such as hide-and-seek, agents autonomously discover obstacle-moving and ramp-climbing tactics in just 4 to 10 rounds (compared to tens of millions of rounds in classic RL), with code and environments fully open-sourced.

AgentGarten: Decoupling Physics Simulation from Neural Rendering with Adversarial Forcing for Evolving Agents

Key Takeaways

  • MirroS Lab releases AgentGarten, decoupling physics simulation backends from neural rendering to eliminate compounding hallucinations
  • Introduces Adversarial Forcing differentiable replay, clocking 37.4 FPS real-time neural rendering on a single NVIDIA H100 GPU
  • Emerges complex multi-agent collaborative strategies in just 4 rounds, outperforming classic RL sample efficiency by orders of magnitude
Read full story
Linked Models & Agents:
ADSponsored

OuroWorld: Transforming Static 3D Gaussian Splats into Seamlessly Looping 3D Cinemagraphs Across Arbitrary Viewpoints

While 3D Gaussian Splatting (3DGS) has revolutionized photorealistic static 3D scene reconstruction, synthesized digital worlds remain frozen in time. Existing dynamic generation frameworks either constrain motion to simplistic Eulerian fluid simulations or synthesize finite non-looping video trajectories that rapidly degrade when explored from novel camera viewpoints. Researchers unveil OuroWorld (arXiv:2610.12461, site: ouroworld.userwei.com), the first mask-free framework capable of turning any static 3DGS scene into an endlessly looping 3D cinemagraph with seamless temporal continuity across arbitrary 6-DoF exploration trajectories. OuroWorld employs a vision-language model to infer plausible environmental physics and direct a foundation video model to synthesize a reference video, which is subsequently lifted and completed across multiple views. To reconcile cross-view generation discrepancies, the authors propose Inconsistency-Robust Periodic 4DGS: a Fourier-series deformation field guarantees seamless looping by construction, while a Grounded Drift Field anchored at the reference camera view absorbs cross-view generative noise. Evaluated across 39 complex reconstructed and generated scenes, OuroWorld decisively outscores existing dynamic 3D baselines and secures a 70.8% to 99.0% preference rate in human blind evaluations.

Key Takeaways

  • OuroWorld introduces the first mask-free 3D cinemagraph framework, transforming static 3DGS into endlessly looping 4D scenes
  • Employs Fourier-series periodic 4DGS deformation fields to guarantee seamless looping, securing 70.8% to 99.0% user study win rates
  • Integrates Grounded Drift Fields to absorb cross-view generative noise, ensuring rigid parallax across 360-degree free-viewpoint exploration
Read full story
Linked Models & Agents:
⚡ OuroWorld⚡ 3DGS⚡ Periodic-4DGS⚡ Fourier-Field🤖 Spatial-3D-Agent🤖 Cinemagraph-Animator🌐 NYCU🌐 Hugging Face

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

Opera: A Verbal Critic Framework for Long-Horizon Coding Agents Tracks Diagnosed Flaws Until Resolution to Boost SWE-Bench by 15%

Long-horizon coding agents tackling complex software repositories depend on timely guidance, yet conventional LLM critics often degrade agent outcomes by misinterpreting in-progress exploratory commands or offering ephemeral advice that is never tracked. Researchers from Rutgers and Lehigh University unveil Opera (arXiv:2609.33987), an open-source verbal critic framework that treats diagnostic corrections as persistent notes tracked until root problems are definitively resolved. Opera orchestrates reviews through hybrid periodic and event-driven triggers, verifies proposed critiques against visible terminal artifacts, and monitors downstream trajectories to distinguish mere superficial compliance from genuine resolution. As a test-time intervention, Opera elevates baseline agent resolve rates by 12.4 percentage points on Terminal-Bench 2.1, 15.0 on SWE-Bench Pro, and 8.9 on DeepSWE v1.1 across four foundation backbones. Furthermore, fine-tuning Qwen3.5-9B on Opera-guided rollouts yields a 10.2 percentage point gain on held-out repositories without any test-time critic, preserving stability across heterogeneous execution harnesses (such as OpenHands to Terminus-2).

Key Takeaways

  • Rutgers and Lehigh release Opera, introducing persistent diagnostic notes that track diagnosed faults until proven resolution in coding agents
  • Elevates resolve rates by 12.4 points on Terminal-Bench 2.1 and 15.0 points on SWE-Bench Pro across multiple policy models
  • Fine-tuning Qwen3.5-9B on Opera rollouts yields a 10.2 point gain on held-out repos without test-time critics, preserving cross-harness stability
Read full story
Linked Models & Agents:

NVIDIA NeMo Study: Agentic Retrieval Boosts Complex Search nDCG@10 by 8.7 Points but Incurs 107s Latency and 764K Tokens per Query

Dense retrieval serves as the default paradigm for searching unstructured enterprise corpora in modern RAG systems. However, dense retrieval is fundamentally bound to surface-level semantic similarity, failing when queries require multi-hop exploration, dynamic hypothesis reformulation, and causal synthesis. Researchers from NVIDIA NeMo-Retriever present an in-depth investigation into Agentic Retrieval (arXiv:2610.05750), coupling LLM ReAct loops with dense and lexical retrievers. Evaluating across challenging benchmarks including ViDoRe v3 and BRIGHT, agentic retrieval improves nDCG@10 by 8.7 points using the identical underlying embedding model. Crucially, NVIDIA transparently quantifies the operational trade-offs: agentic searches average 107.4 seconds per query (versus 0.67 seconds for conventional retrieval) and consume an average of 764.1K input tokens and 5.8K output tokens per query. This landmark study provides critical empirical benchmarks for enterprise architectures balancing retrieval depth against inference budgets (github.com/NVIDIA/NeMo-Retriever).

Key Takeaways

  • NVIDIA NeMo-Retriever evaluates Agentic Retrieval coupling ReAct loops with dense retrievers for complex multi-hop search
  • Improves nDCG@10 by 8.7 points using the identical base embedding model across ViDoRe v3 and BRIGHT benchmarks
  • Transparently quantifies operational costs: average query latency reaches 107.4 seconds (vs 0.67s) consuming 764.1K input and 5.8K output tokens
Read full story
Linked Models & Agents:

OSWorld-Pro: NVIDIA Unveils Process-Based Benchmark for Computer-Use Agents Spanning 2,800+ Subgoals

Computer-Use Agents (CUAs) designed to operate graphical desktop environments through virtual keyboard and mouse interactions are traditionally evaluated using outcome-based functional verifiers that assess only the final state after hundreds of operational turns. This black-box approach obscures whether failures stem from syntax typographical errors, GUI bounding-box misalignments, or intermediate state drift, preventing actionable diagnostic insights. NVIDIA Research introduces OSWorld-Pro (arXiv:2609.24890), the first comprehensive process-based evaluation suite for computer-use agents. Spanning 300+ complex desktop workflows decomposed into 2,800+ sequentially dependent subgoals grounded in 67,000+ expert human annotations, OSWorld-Pro deploys calibrated LLM judges to track incremental subgoal completion. Evaluations reveal that OSWorld-Pro presents a formidable challenge to state-of-the-art models: frontier models like Claude Opus 5 achieve only 75.7% (compared to 83.4% on standard OSWorld), systematically isolating critical procedural failure patterns such as exploratory irrelevant actions and click grounding drifts.

OSWorld-Pro: NVIDIA Unveils Process-Based Benchmark for Computer-Use Agents Spanning 2,800+ Subgoals

Key Takeaways

  • NVIDIA Research unveils OSWorld-Pro, decomposing 300+ desktop tasks into 2,800+ sequentially dependent subgoals
  • Grounded in 67,000+ expert annotations, revealing Claude Opus 5 scores only 75.7% vs 83.4% on standard OSWorld
  • Isolates subgoal-irrelevant actions and click coordinate misalignments, replacing black-box outcome verifiers with process diagnostics
Read full story