ARCO introduces a rubric framework that enables step-level credit assignment for multi-step LLM agents. It jointly updates a shared model with generation and scoring heads, allowing the rubric content and scoring function to co-evolve via on-policy data, improving performance and interpretability across benchmarks.
ARCO: Adaptive Rubric with Co-Evolution for Multi-Step LLM Agents
Self-Evolution of Tool-Calling Agents via Divergence-Point Preference Learning
ToolGraph enhances multi-turn tool-using agents by integrating schema topology, transition weights, and history-aware controls. Training with DPO on 161 divergence-point preference pairs improves performance: ToolGraph+DPO achieves a 16.8% relative reward gain over baseline, especially in airline and retail tasks, with reward positivity emerging as the key diagnostic signal.
ARCO: Adaptive Rubric with Co-Evolution for Multi-Step LLM Agents
ARCO introduces a rubric framework that enables step-level credit assignment for multi-step LLM agents. It jointly updates a shared model with generation and scoring heads, allowing the rubric content and scoring function to co-evolve via on-policy data, improving performance and interpretability across benchmarks.
AllenAI releases MolmoMotion vision models for future motion prediction
AllenAI has released two MolmoMotion models that predict 3D point trajectories based on short video histories and natural-language instructions. One model uses a three-frame history, the other a one-frame history, enabling future motion forecasting for objects in 3D space.
H-RePlan: Hierarchical Recovery for Cross-Device Agent Systems
H-RePlan introduces a hierarchical replanning framework that separates device-local strategy recovery from global orchestrator replanning. It outperforms existing baselines by achieving higher completion and instruction adherence, with reduced token cost, through scope-aware recovery in multi-device agent systems.
RACL: Reasoning-Agent Control Layer for Metaheuristic Learning
RACL introduces a reasoning agent that controls metaheuristic search behavior without replacing optimizers or altering constraints. It improves or ties key policies in vehicle routing experiments, reducing average cost by 8.337% versus Fixed and 1.605% versus Stagnation-Triggered policies, with no significant computational overhead.