Back to AI News
arxiv

Ask on Demand: Targeted Peer Communication for Parallel Agentic Systems

Researchers propose Ask on Demand (AOD), a communication framework that lets parallel LLM agents request targeted assistance from peers only when specific information needs arise. A lightweight gate trained on team outcomes decides when such requests are worthwhile. Experiments on AppWorld and WebShop show AOD improves task performance over independent execution while reducing inference cost compared to existing sharing methods.

AI Brief

Offers a practical, cost-efficient approach to multi-agent collaboration that adapts to agents' evolving information needs.

arXiv:2610.41378v1 Announce Type: new Abstract: Parallel LLM agents tackle complex tasks by exploring multiple trajectories, yet useful discoveries remain isolated in individual execution histories. Existing sharing methods often select or summarize information before other agents' needs become clear, potentially overlooking details that become important later. We propose Ask on Demand (AOD), a communication framework that enables agents to seek targeted peer assistance when specific information needs arise. Upon an approved request, AOD retrieves relevant evidence from peer execution histories, selects a suitable peer, and generates a response tailored to the request. To determine when such assistance is worthwhile, we train a lightweight gate using paired team continuations, with supervision derived from final team outcomes and inference cost. Experiments on AppWorld and WebShop demonstrate that AOD consistently improves task performance over independent parallel execution while achieving lower inference cost than existing information-sharing baselines. These findings highlight the benefits of aligning peer communication with agents' evolving information needs to achieve more effective and efficient collaboration.
Be the first to rate this article.

Comments & Questions (0)

Captcha
Please be respectful — let's keep the conversation friendly.

No comments yet

Be the first to comment!