AI agents

Tool use, function calling, orchestration and the protocols that let models act rather than only answer.

15,750 stories · RSS feed

arXiv Computation and Language
Sep 18

PolyJarvis: An LLM-Orchestrated Agent for Automated All-Atom Molecular Dynamics of Amorphous Homopolymers

PolyJarvis is an LLM‑orchestrated platform that automates all‑atom molecular dynamics simulations of amorphous homopolymers. It generates validated run plans, constructs systems with Enhanced Monte Carlo, runs dynamics in LAMMPS, and extracts target properties, all while handling failures within a fixed decision budget. Validation on seven polymers—PE, aPS, sPVC, PLLA, PEG, PEEK, and PSU—showed that 13 of 19 property comparisons met experimental acceptance criteria, though some PCFF‑based systems exhibited density and glass‑transition discrepancies.

By Alexander Zhao, Achuth Chandrasekhar, Amir Barati Farimani
arXiv Computer Vision
Sep 18

VideoResearcher: Self-Improving Tool Design for Long-Video Understanding

VideoResearcher is a training‑free, multi‑agent framework that autonomously designs, tests, and refines high‑impact tools for long‑video understanding. It operates through dual Solving and Evolving loops, analyzing tool‑use trajectories to identify gaps, coordinating specialized agents to develop and validate executable tools, and reusing evolved tools to improve evidence acquisition in subsequent reasoning. The approach achieves state‑of‑the‑art performance among self‑improving agents and approaches the human‑designed upper bound, demonstrating a paradigm that expands agent capabilities while reducing costly manual engineering.

By Dingqiang Ye, Dongdi Zhao, Kaishen Wang, Qingqiao Hu, Jingchen Sun, Yijun Liang, Yuqi Jia, Yiqiao Huang, Yunjie Tian, Jiaxing Zhang, Chuanyang Jin, Ke Zhang, Vishal M. Patel, Di Fu
arXiv Computer Vision
Sep 18

MM-Future: Multi-Mode Joint World-Action Modeling for Autonomous Driving

MM-Future is a world-action model for autonomous driving that generates multiple paired scene-action hypotheses and captures bidirectional interaction within each pair. It initializes each hypothesis from a structured action prior and an independent future scene source, then co-evolves them using a modality-aware diffusion Transformer. The model compresses multi-view video into planning-oriented MM-Tokens and uses a future-conditioned proposal scorer to rank trajectory candidates, achieving strong performance on NAVSIM and HUGSIM benchmarks.

By Shuai Liu, Hechangle Gong, Hao Jiang, Runlin He, Junxiang Zhan, Kai Huang, Sheng Yang, Shaoqing Ren
arXiv Computer Vision
Sep 18

CoRef-GS: Cooperative Referring Gaussian Splatting for Multi-Agent Scene Understanding

CoRef-GS introduces a cooperative referring Gaussian splatting framework for multi‑agent scene understanding, enabling robots to ground object‑ and relation‑centric language queries across independently reconstructed maps. The method builds local open‑vocabulary instance‑aware Gaussian maps, aligns them using a cross‑agent module that enforces geometric and semantic consistency, and grounds queries with a view‑conditioned mask relation graph. Experiments on a new dual‑quadruped benchmark show significant improvements, reducing rotation error from 2.58° to 0.15° and raising real‑world referring mIoU from 52.6% to 68.8%.

By Zhikun Zhou, Kunyu Peng, Runyi Yang, Junhao Cai, Di Wen, Ruiping Liu, Danda Pani Paudel, Yi Zhou, Luc Van Gool, Kailun Yang
arXiv AI
Sep 18

Don't Mask the Environment: Observation Supervision Changes How Agents Explore Under RL

The paper introduces ActObs, a supervised fine‑tuning method that, unlike standard approaches, also predicts environment observations in agent trajectories. While both ActObs and action‑only training perform similarly after initial fine‑tuning, ActObs diverges during subsequent reinforcement learning, yielding higher pass@k scores on several benchmarks and better cross‑domain task performance. The authors attribute this advantage to ActObs’s joint supervision, which preserves observation gradients and prevents the policy from over‑specializing on actions alone.

By Juzheng Zhang, Disha Makhija, Manoj Ghuhan Arivazhagan, Vinayshekhar Bannihatti Kumar, Rashmi Gangadharaiah
arXiv Machine Learning
Sep 18

QEncodeBench: Can Large Language Models Encode Classical Problems into Verified Quantum Oracles?

QEncodeBench evaluates whether large language models can translate classical constraint problems into verified quantum phase oracles. The benchmark measures the correctness of generated circuits using an adversarial self‑validated verifier that checks full solution‑set equivalence while enforcing resource limits. Results show that models lacking a reasoning mode perform poorly, whereas enabling native reasoning improves accuracy tenfold; semantic errors dominate, and neuro‑symbolic pipelines close most gaps by delegating critical composition to deterministic procedures.

By Xujun Che, Hanhan Wu, Yuchen Yuan, Chenyang Yu
arXiv Computation and Language
Sep 18

Data Journalist Agent: Transforming Data into Verifiable Multimodal Stories

The paper introduces Data Journalist Agent (Data2Story), a multi‑agent framework that orchestrates specialized roles into a single virtual newsroom to produce evidence‑grounded, multimodal news stories. It ensures every claim is traceable to data, code, or external references via an Inspector, and generates interactive visualizations such as maps and audio to match reader interests. Evaluations on 18 articles show competitive performance in angle coverage, rubric scores, and verifiability, while human writers still lead in editorial angle and creative design.

By Kevin Qinghong Lin, Batu EI, Yuhong Shi, Pan Lu, Juil Sock, Djordje Padejski, Philip Torr, James Zou
arXiv AI
Sep 18

An Architecture for Long-Horizon Agents: Levels, Ticks and Cascaded Intelligence

The paper proposes a hierarchical architecture for long-horizon language‑model agents that must operate over days or weeks without forgetting. It introduces three key components: time‑scale levels that store bounded summaries, a clocked tick as the basic action unit, and cascaded intelligence that escalates tasks to more capable models only after review failures. A ten‑day experiment demonstrated that the agent maintained continuity across context resets, adapted its behavior based on early knowledge, and identified where learned components could be integrated.

By Erik Nijkamp, Anurag Koul, Egor Pakhomov, Bo Pang
arXiv AI
Sep 18

A Unified Evaluation Framework for Trustworthy Large Language Models, Agentic AI, and Multimodal Systems

The paper introduces a unified evaluation framework for assessing the trustworthiness of large language models, agentic AI, and multimodal systems. It connects output-level, trajectory-level, and cross-modal assessments across eight dimensions—capability, robustness, safety, fairness, transparency, governance, oversight, and efficiency—while preserving system-specific metrics and providing uncertainty estimates. A meta-evaluation layer checks the validity, reliability, and reproducibility of the evaluation itself, and the framework aligns with governance standards and regulatory requirements.

By Shaina Raza, Ahmed Y. Radwan, Imran Liaquat, Kathryn Hume
arXiv AI
Sep 18

Rethinking Multi-Agent Collaboration: When More Is Less

The paper examines when multi‑agent collaboration is beneficial versus single‑agent approaches. It finds that collaboration yields systematic advantages mainly in long‑horizon tasks with sparse dependencies, while single agents perform better in tightly coupled, sequential workflows. The authors introduce SAIGE, a lightweight multi‑agent mechanism that models collaboration as a dynamically evolving graph, and show that it balances context efficiency and task performance without always improving outcomes as more agents are added.

By Yishuo Yuan, Yibo Wu, Yihan Zhang, Minyuan Sun, Shenliang Li, Xinkai Ma, Yifan Li, Jiaheng Liu
arXiv AI
Sep 18

Diagnose, Recover, Certify: Task Readiness under Hidden Dynamics Changes

The paper introduces a framework for diagnosing and recovering from hidden dynamics changes in deployed control policies, focusing on the problem of task readiness under dormant dynamics drift. It proposes an intervention-based Bayesian method called Evidence‑Gated Matched‑Pulse Transport that localizes faults and estimates actuator effectiveness, enabling agents to certify readiness for future tasks with limited, task‑agnostic interactions. The approach is evaluated on diverse benchmarks, measuring readiness coverage, selective risk, interaction cost, and return, and identifies regimes where transported evidence is decisive.

By Nguyen Viet Tuan Kiet, Huynh Thi Thanh Binh
arXiv AI
Sep 18

UnifiedPlayers: Enhance Tool-Integrated Reasoning in Agentic Reinforcement Learning

UnifiedPlayers is a cooperative framework that jointly adapts planning, execution, and evaluation for tool-integrated reinforcement learning agents. It consists of a Planning Player that generates tasks, an Execution Player that creates multi-turn trajectories with Python tool calls, and an Evaluation Player that builds executable verifiers, all coordinated by role‑specific rewards under GRPO. The approach outperforms prior baselines on mathematical and general reasoning benchmarks and yields a verifier with high adversarial detection accuracy and more discriminative reward signals.

By Wenjie Liao, Liangjie Zhao, Zehong Cao
arXiv AI
Sep 18

Self-Evolving Search Index

The paper introduces SELF-INDEX, a framework that allows an information retrieval index to autonomously evolve without human intervention. Its Optimizer diagnoses retrieval shortcomings, selectively updates index keys, and validates changes before applying them. Additionally, a Query Simulator proactively explores new demands, enabling the index to improve beyond current queries and consistently outperform existing optimization methods across various corpora and retrievers.

By Sangam Lee, Wonjae Lee, Sunghwan Kim, Deogyong Kim, Jaehoon Kim, Daye Nam, SeongKu Kang, Dongha Lee
arXiv AI
Sep 18

Astronex-World 1.0: Real-Time Interactive World Model Foundation

Astronex-World 1.0 is an open, controllable video world‑model foundation that can generate future visual states from text prompts or initial images, supporting frame‑aligned camera trajectories, continuous actions, and text events during rollout. It offers both a bidirectional model for full‑context generation and a causal model with block‑causal attention, built on the Wan2.2‑TI2V‑5B prior, and achieves real‑time 832×480 video at 24 fps. The model was trained over five stages on two NVIDIA L20 GPUs, scores 73.5 on WBench Navi and 70.0 on WBench Full, and outperforms several larger competitors while providing interfaces for embodied intelligence and autonomous driving.

By Xin Zhou, Cong Miao
arXiv AI
Sep 18

Mitigating Retaliatory Algorithmic Collusion in Repeated Games

The paper introduces CURB, a reward‑shaping framework that penalizes the total variation distance between an agent’s action distributions under cooperation and defection histories, thereby preventing collusive equilibria in repeated games. By linking empirical Q‑learning collusion to Simple Penal Codes, the authors prove that any non‑trivial SPC can be neutralized, and demonstrate CURB’s effectiveness in both tabular and deep Q‑learning settings for Bertrand and Cournot competition.

By Karthik Sivachandran, Rohan Paleja
arXiv AI
Sep 18

Chronicle: Cut-Point Replay for Regression Testing of LLM Agents

Chronicle introduces a method called cut‑point replay to make regression testing of large language model (LLM) agents reproducible. It records an agent’s run at non‑deterministic boundaries as immutable envelopes and then replays selected boundaries while executing the rest live, enabling continuous‑integration tests that detect faulty code changes. Benchmarks show minimal overhead, perfect bit‑stability, and effective detection of unsafe actions in a mutation study.

By Tisha Chawla, Susheem Koul
arXiv Machine Learning
Sep 18

Odds-Ratio Thompson Sampling: A Specification and Design Guide for Contrast-Based Multi-Armed Bandits

The paper introduces Odds‑Ratio Thompson Sampling (OR‑TS), a method for batched multi‑armed bandits that updates the joint posterior over log‑odds contrasts and refits the shared level in each batch, rather than carrying over absolute reward rates. It presents a Bayesian bandit agent with controls for decay of past evidence and aggressiveness of allocation, and evaluates OR‑TS against traditional absolute‑rate memory across 86 public A/B series and synthetic environments. Results show that when the shared level varies significantly, OR‑TS outperforms absolute‑rate memory, reducing regret and ensuring the best arm receives more traffic, while also handling cases where contrasts themselves shift.

By Sulgi Kim
arXiv Machine Learning
Sep 18

UniExo: Unified Multi-Skill Policies for Musculoskeletal Locomotion and Co-Adaptive Exoskeleton Control

UniExo is a framework that builds a single, multi-skill musculoskeletal human policy by distilling four imitation experts—walking, turning, running, and backward walking—into one network guided by a skill latent. The human policy is fine‑tuned with reinforcement learning on transition sequences, achieving a 94.7% tracking success rate on unseen clips and greater robustness to perturbations. A hip exoskeleton controller is then co‑adapted with this human policy via multi‑agent reinforcement learning, enabling it to assist across four treadmill speeds and a continuous route of all four skills without explicit mode switching.

By Yifei Yuan, Jakob Wolf, Ghaith Androwis, Xianlian Zhou
arXiv Computer Vision
Sep 18

MTF-Net: Multi-Modal Temporal Feature Fusion Network for Pedestrian Intention Prediction

MTF‑Net is a Multi‑Modal Temporal Feature Fusion Network that jointly models kinematic, appearance, and contextual cues for pedestrian intention prediction. It fuses four modalities—bounding‑box dynamics, human pose keypoints, local context, and scene‑level semantics—within a recurrent framework enhanced by gated linear units (GLUs) and an attention‑guided fusion head. Evaluations on the PIE and JAAD benchmarks show that MTF‑Net outperforms recent transformer‑ and graph‑based models, achieving up to 0.95 AUC on PIE and 0.94 AUC on JAAD while maintaining real‑time performance.

By Md Mahfuzur Rahman, Pengzhan Zhou, A. F. M. Abdun Noor, Md Imam Ahasan, Md Mustafizur Rahman, Fang Qu
arXiv Computer Vision
Sep 18

4D Radar Perception Algorithms for Autonomous Driving: A Review

The review surveys 4D millimeter‑wave radar perception algorithms for autonomous driving, covering signal processing, object detection, semantic segmentation, motion estimation, occupancy prediction, and dynamic scene reconstruction. It organizes the field by perception tasks, discusses radar fundamentals, data representations, and quality‑enhancement methods, and compares radar‑only learning, multimodal fusion, and cross‑modal supervision. The paper also summarizes datasets, annotations, evaluation protocols, and outlines common challenges and future research directions.

By Xumin Wu, Jun Zhou, Jilin Mei, Chen Min, Yu Hu