Agent Behavior Maps: Locating Agents by What They Would Do, Without Running Them
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
LLM agents with similar success rates can follow different action sequences. An Agent Behavior Map represents LLM-harness combinations using centered action log-likelihoods on shared reference traject...
MAPF-World introduces an autoregressive action world model for multi‑agent path finding that predicts short‑horizon local observations and neighboring agents’ action intentions, enabling decisions beyond immediate local views. The model incorporates a spatio‑agent positional encoding within Transformer architectures to enhance spatial awareness and agent semantics, fostering coordinated behaviors. Experiments on diverse maps, including a new automated map generator based on real‑world urban layouts, show that MAPF‑World outperforms existing learned solvers, achieving strong performance, robust zero‑shot generalization, and high success rates even at high agent densities.
arXiv:2602. 11619v2 Announce Type: replace Abstract: Running the same LLM agent on identical inputs yields 2.
The paper introduces a Latent World Model (LWM) for robot navigation that predicts action‑conditioned latent feature compatibility instead of reconstructing future observations. By exploiting the correlation between spatial proximity and latent feature similarity, the model evaluates action consequences directly in latent space and supports counterfactual training using sampled action sequences. The learned world model can supervise policy learning from unlabeled video and further improve policies via reinforcement learning entirely within the model, eliminating the need for action annotations and additional environment interaction.
arXiv:2606. 30639v1 Announce Type: new Abstract: World models offer a principled way to equip long-horizon LLM agents with foresight: predictions of action consequences before execution.
KC-Bench is a dynamic interactive benchmark designed to evaluate how large language model agents reconcile user instructions, internal knowledge, and real‑time environmental observations. It contains 238 manually curated multi‑turn tasks that test world‑knowledge conflicts, input inconsistencies, and multi‑source temporal conflicts, using a user simulator, stateful tools, deterministic environment assertions, an open‑source natural‑language evaluator, and human trajectory verification. Evaluation of nine models—including DeepSeek‑V4‑Flash, GLM‑5.2, and MiniMax‑M3—reveals significant cross‑domain variation, with no model reliably handling factual correction, identity consistency checking, and temporal conflict resolution across all settings, and shows that missed conflicts can propagate to tool calls or synthetic protected‑data flows.